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.r114-smll-177955740600412.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 ErlangenMainframeV0-PT-0404, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740600412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.1K Mar 7 04:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 04:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 04:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 7 04:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Mar 7 04:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 7 04:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 04:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 04:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 187K 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 ErlangenMainframeV0-PT-0404-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-0404-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779851909502

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0404
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 03:18:31] [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-27 03:18:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 03:18:32] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2026-05-27 03:18:32] [INFO ] Transformed 183 places.
[2026-05-27 03:18:32] [INFO ] Transformed 445 transitions.
[2026-05-27 03:18:32] [INFO ] Found NUPN structural information;
[2026-05-27 03:18:32] [INFO ] Parsed PT model containing 183 places and 445 transitions and 3331 arcs in 470 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 445/445 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 139 transition count 401
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 139 transition count 401
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 107 place count 120 transition count 382
Iterating global reduction 0 with 19 rules applied. Total rules applied 126 place count 120 transition count 382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 117 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 117 transition count 379
Applied a total of 132 rules in 101 ms. Remains 117 /183 variables (removed 66) and now considering 379/445 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1033861612857549482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14903973595331478385.kers'
[2026-05-27 03:18:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1033861612857549482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14903973595331478385.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 379 rows 117 cols 3199 entries
Finished phase 1 with 100 SingleSign rule and 3 generalized
[2026-05-27 03:18:32] [INFO ] Computed 14 invariants in 4 ms
Computed 14 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14903973595331478385.kers
Total runtime 7 ms.
[2026-05-27 03:18:33] [INFO ] Implicit Places using invariants in 475 ms returned []
[2026-05-27 03:18:33] [INFO ] Invariant cache hit.
[2026-05-27 03:18:33] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2026-05-27 03:18:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/117 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (OVERLAPS) 379/496 variables, 117/137 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 137 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/117 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (OVERLAPS) 379/496 variables, 117/140 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 378/518 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 520 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61340ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 61384ms
Starting structural reductions in LTL mode, iteration 1 : 117/183 places, 379/445 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62681 ms. Remains : 117/183 places, 379/445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2026-05-27 03:19:35] [INFO ] Invariant cache hit.
[2026-05-27 03:19:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-27 03:19:35] [INFO ] Invariant cache hit.
[2026-05-27 03:19:35] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 117/117 places, 379/379 transitions.
Support contains 39 out of 117 places after structural reductions.
[2026-05-27 03:19:35] [INFO ] Flatten gal took : 162 ms
[2026-05-27 03:19:36] [INFO ] Flatten gal took : 110 ms
[2026-05-27 03:19:36] [INFO ] Input system was already deterministic with 379 transitions.
RANDOM walk for 40000 steps (8 resets) in 1899 ms. (21 steps per ms) remains 18/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
[2026-05-27 03:19:37] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 70/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 16/114 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 3/117 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 379/496 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/496 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 131 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 18/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 70/98 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 16/114 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 3/117 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 379/496 variables, 117/131 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 16/147 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 147 constraints, problems are : Problem set: 1 solved, 17 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6122ms problems are : Problem set: 1 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 379/379 transitions.
Graph (trivial) has 69 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 115 transition count 361
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 101 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 100 transition count 360
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 31 place count 100 transition count 351
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 49 place count 91 transition count 351
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 58 place count 82 transition count 327
Iterating global reduction 3 with 9 rules applied. Total rules applied 67 place count 82 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 82 transition count 325
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 69 place count 82 transition count 322
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 75 place count 79 transition count 322
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 113 place count 60 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 117 place count 58 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 58 transition count 332
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 58 transition count 329
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 124 place count 55 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 55 transition count 328
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 127 place count 55 transition count 328
Applied a total of 127 rules in 198 ms. Remains 55 /117 variables (removed 62) and now considering 328/379 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 55/117 places, 328/379 transitions.
RANDOM walk for 40000 steps (8 resets) in 1302 ms. (30 steps per ms) remains 14/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 118 ms. (336 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
[2026-05-27 03:19:44] [INFO ] Flow matrix only has 322 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15308327843838861994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16758571612537184244.kers'
[2026-05-27 03:19:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15308327843838861994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16758571612537184244.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 322 rows 54 cols 3092 entries
Finished phase 1 with 38 SingleSign rule and 3 generalized
[2026-05-27 03:19:44] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16758571612537184244.kers
Total runtime 5 ms.
[2026-05-27 03:19:44] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 6/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 10/55 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 322/377 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 28/97 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/377 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 97 constraints, problems are : Problem set: 0 solved, 14 unsolved in 873 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 55/55 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 6/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 10/55 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 322/377 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 28/97 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/377 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 111 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3879 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 55/55 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4822ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 12 properties in 5056 ms.
Support contains 9 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 328/328 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 55 transition count 327
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 327
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 10 place count 46 transition count 247
Ensure Unique test removed 4 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 42 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 193
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 0 with 4 rules applied. Total rules applied 28 place count 39 transition count 191
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 36 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 39 place count 36 transition count 189
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 36 transition count 187
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 45 place count 34 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 58 place count 34 transition count 172
Applied a total of 58 rules in 50 ms. Remains 34 /55 variables (removed 21) and now considering 172/328 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 34/55 places, 172/328 transitions.
RANDOM walk for 40000 steps (8 resets) in 1368 ms. (29 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2026-05-27 03:19:54] [INFO ] Flow matrix only has 168 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13034884873776097921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13305679505426230426.kers'
[2026-05-27 03:19:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13034884873776097921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13305679505426230426.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 168 rows 33 cols 1358 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-27 03:19:54] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13305679505426230426.kers
Total runtime 2 ms.
[2026-05-27 03:19:54] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/34 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 168/202 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 102/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 34/34 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/34 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 168/202 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 102/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 34/34 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2389 steps, including 175 resets, run visited all 1 properties in 13 ms. (steps per millisecond=183 )
Parikh walk visited 1 properties in 22 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 20 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Graph (trivial) has 80 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 114 transition count 360
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 98 transition count 360
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 98 transition count 350
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 88 transition count 350
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 67 place count 74 transition count 253
Ensure Unique test removed 1 places
Iterating global reduction 2 with 15 rules applied. Total rules applied 82 place count 73 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 73 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 84 place count 73 transition count 249
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 71 transition count 249
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 68 transition count 155
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 67 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 66 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 66 transition count 131
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 145 place count 42 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 40 transition count 104
Ensure Unique test removed 2 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 38 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 37 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 37 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 36 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 157 place count 35 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 160 place count 35 transition count 95
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 35 transition count 95
Applied a total of 163 rules in 99 ms. Remains 35 /117 variables (removed 82) and now considering 95/379 (removed 284) transitions.
[2026-05-27 03:19:55] [INFO ] Flow matrix only has 82 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8862059975343549377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5901007684788021981.kers'
[2026-05-27 03:19:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8862059975343549377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5901007684788021981.kers]
Normalized transition count is 81 out of 82 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 35 cols 564 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-27 03:19:55] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5901007684788021981.kers
Total runtime 1 ms.
[2026-05-27 03:19:56] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-27 03:19:56] [INFO ] Flow matrix only has 82 transitions (discarded 13 similar events)
[2026-05-27 03:19:56] [INFO ] Invariant cache hit.
[2026-05-27 03:19:56] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-27 03:19:56] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2026-05-27 03:19:56] [INFO ] Redundant transitions in 3 ms returned []
Running 93 sub problems to find dead transitions.
[2026-05-27 03:19:56] [INFO ] Flow matrix only has 82 transitions (discarded 13 similar events)
[2026-05-27 03:19:56] [INFO ] Invariant cache hit.
[2026-05-27 03:19:56] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 81/116 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 72 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4919 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 35/35 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 81/116 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 93/164 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 165 constraints, problems are : Problem set: 0 solved, 93 unsolved in 8708 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 35/35 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13690ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 13691ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/117 places, 95/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14010 ms. Remains : 35/117 places, 95/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 203 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-00 finished in 14381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1)||(X(X(X(p2)))&&F(p3)))))'
Support contains 10 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 106 transition count 300
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 23 place count 105 transition count 300
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 27 place count 101 transition count 293
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 100 transition count 293
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 97 transition count 236
Ensure Unique test removed 2 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 95 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 94 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 94 transition count 234
Applied a total of 42 rules in 14 ms. Remains 94 /117 variables (removed 23) and now considering 234/379 (removed 145) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7032496955341867909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14056867451876597280.kers'
[2026-05-27 03:20:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7032496955341867909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14056867451876597280.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 94 cols 1293 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-27 03:20:10] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14056867451876597280.kers
Total runtime 2 ms.
[2026-05-27 03:20:10] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-27 03:20:10] [INFO ] Invariant cache hit.
[2026-05-27 03:20:10] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2026-05-27 03:20:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/328 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 106 constraints, problems are : Problem set: 0 solved, 233 unsolved in 18538 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 234/328 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 233/340 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 346 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 48812ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 48815ms
Starting structural reductions in LTL mode, iteration 1 : 94/117 places, 234/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49058 ms. Remains : 94/117 places, 234/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1)||(X(X(X(p2)))&&F(p3)))))'
Stuttering acceptance computed with spot in 475 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p3) p0 (NOT p1)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3426 steps with 0 reset in 58 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-01 finished in 49673 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||G(p1)))))'
Support contains 9 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Graph (trivial) has 77 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 114 transition count 360
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 98 transition count 360
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 33 place count 98 transition count 351
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 89 transition count 351
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 65 place count 75 transition count 254
Ensure Unique test removed 1 places
Iterating global reduction 2 with 15 rules applied. Total rules applied 80 place count 74 transition count 254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 74 transition count 252
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 82 place count 74 transition count 250
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 72 transition count 250
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 70 transition count 192
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 69 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 68 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 68 transition count 156
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 137 place count 46 transition count 134
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 44 transition count 131
Ensure Unique test removed 2 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 42 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 41 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 147 place count 40 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 40 transition count 139
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 154 place count 40 transition count 139
Applied a total of 154 rules in 64 ms. Remains 40 /117 variables (removed 77) and now considering 139/379 (removed 240) transitions.
[2026-05-27 03:20:59] [INFO ] Flow matrix only has 126 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15315923543567661987.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16087934967977023974.kers'
[2026-05-27 03:20:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15315923543567661987.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16087934967977023974.kers]
Normalized transition count is 125 out of 126 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 40 cols 1090 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-27 03:20:59] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16087934967977023974.kers
Total runtime 2 ms.
[2026-05-27 03:20:59] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-27 03:20:59] [INFO ] Flow matrix only has 126 transitions (discarded 13 similar events)
[2026-05-27 03:20:59] [INFO ] Invariant cache hit.
[2026-05-27 03:21:00] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-27 03:21:00] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2026-05-27 03:21:00] [INFO ] Redundant transitions in 7 ms returned []
Running 137 sub problems to find dead transitions.
[2026-05-27 03:21:00] [INFO ] Flow matrix only has 126 transitions (discarded 13 similar events)
[2026-05-27 03:21:00] [INFO ] Invariant cache hit.
[2026-05-27 03:21:00] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 125/165 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 1/166 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/166 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 61 constraints, problems are : Problem set: 0 solved, 137 unsolved in 7774 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 125/165 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 137/197 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 1/166 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/166 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 198 constraints, problems are : Problem set: 0 solved, 137 unsolved in 20661 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28578ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 28578ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/117 places, 139/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28858 ms. Remains : 40/117 places, 139/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 349 ms.
Product exploration explored 100000 steps with 0 reset in 432 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 9 factoid took 72 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 985 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 326 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1834272 steps, run timeout after 3001 ms. (steps per millisecond=611 ) properties seen :3 out of 4
Probabilistic random walk after 1834272 steps, saw 240139 distinct states, run finished after 3011 ms. (steps per millisecond=609 ) properties seen :3
[2026-05-27 03:21:33] [INFO ] Flow matrix only has 126 transitions (discarded 13 similar events)
[2026-05-27 03:21:33] [INFO ] Invariant cache hit.
[2026-05-27 03:21:33] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/40 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/165 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/166 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/40 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/165 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/166 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 169 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=84 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 9 factoid took 121 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 4360 ms.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 9 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 139/139 transitions.
Applied a total of 0 rules in 7 ms. Remains 40 /40 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2026-05-27 03:21:34] [INFO ] Flow matrix only has 126 transitions (discarded 13 similar events)
[2026-05-27 03:21:34] [INFO ] Invariant cache hit.
[2026-05-27 03:21:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-27 03:21:34] [INFO ] Flow matrix only has 126 transitions (discarded 13 similar events)
[2026-05-27 03:21:34] [INFO ] Invariant cache hit.
[2026-05-27 03:21:34] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-27 03:21:34] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2026-05-27 03:21:34] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 40/40 places, 139/139 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge based reduction with 9 factoid took 63 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1949078 steps, run timeout after 3001 ms. (steps per millisecond=649 ) properties seen :3 out of 4
Probabilistic random walk after 1949078 steps, saw 254210 distinct states, run finished after 3001 ms. (steps per millisecond=649 ) properties seen :3
[2026-05-27 03:21:37] [INFO ] Flow matrix only has 126 transitions (discarded 13 similar events)
[2026-05-27 03:21:37] [INFO ] Invariant cache hit.
[2026-05-27 03:21:37] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/40 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/165 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/166 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/40 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/165 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/166 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 317ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 618 steps, including 39 resets, run visited all 1 properties in 3 ms. (steps per millisecond=206 )
Parikh walk visited 1 properties in 2 ms.
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 3731 ms.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 326 ms.
Product exploration explored 100000 steps with 0 reset in 351 ms.
Built C files in :
/tmp/ltsmin3768211497546409824
[2026-05-27 03:21:38] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2026-05-27 03:21:38] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 03:21:38] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2026-05-27 03:21:38] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 03:21:38] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2026-05-27 03:21:38] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 03:21:38] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3768211497546409824
Running compilation step : cd /tmp/ltsmin3768211497546409824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 987 ms.
Running link step : cd /tmp/ltsmin3768211497546409824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin3768211497546409824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased164434398084673963.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2026-05-27 03:21:53] [INFO ] Flow matrix only has 126 transitions (discarded 13 similar events)
[2026-05-27 03:21:53] [INFO ] Invariant cache hit.
[2026-05-27 03:21:53] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-27 03:21:53] [INFO ] Flow matrix only has 126 transitions (discarded 13 similar events)
[2026-05-27 03:21:53] [INFO ] Invariant cache hit.
[2026-05-27 03:21:53] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-27 03:21:54] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2026-05-27 03:21:54] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 40/40 places, 139/139 transitions.
Built C files in :
/tmp/ltsmin14520026168976959736
[2026-05-27 03:21:54] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2026-05-27 03:21:54] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 03:21:54] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2026-05-27 03:21:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 03:21:54] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2026-05-27 03:21:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 03:21:54] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14520026168976959736
Running compilation step : cd /tmp/ltsmin14520026168976959736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 662 ms.
Running link step : cd /tmp/ltsmin14520026168976959736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14520026168976959736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7447511477325217336.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 03:22:09] [INFO ] Flatten gal took : 22 ms
[2026-05-27 03:22:09] [INFO ] Flatten gal took : 20 ms
[2026-05-27 03:22:09] [INFO ] Time to serialize gal into /tmp/LTL12629445792357114852.gal : 5 ms
[2026-05-27 03:22:09] [INFO ] Time to serialize properties into /tmp/LTL434784269121546278.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12629445792357114852.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12453078663604103075.hoa' '-atoms' '/tmp/LTL434784269121546278.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL434784269121546278.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12453078663604103075.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
84 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.912611,35088,1,0,58,79612,34,49,3314,100802,207
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-02 finished in 70404 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(X(p0))&&F(p1))))&&(!p2 U (p3||G(!p2)))))'
Support contains 10 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 105 transition count 299
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 25 place count 104 transition count 299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 29 place count 100 transition count 292
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 99 transition count 292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 97 transition count 289
Ensure Unique test removed 2 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 95 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 94 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 94 transition count 235
Applied a total of 42 rules in 7 ms. Remains 94 /117 variables (removed 23) and now considering 235/379 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11600139301375996470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-143987128671662291.kers'
[2026-05-27 03:22:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11600139301375996470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-143987128671662291.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 235 rows 94 cols 1295 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-27 03:22:10] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-143987128671662291.kers
Total runtime 2 ms.
[2026-05-27 03:22:10] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-27 03:22:10] [INFO ] Invariant cache hit.
[2026-05-27 03:22:10] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-27 03:22:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 235/329 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/329 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 106 constraints, problems are : Problem set: 0 solved, 234 unsolved in 18395 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 235/329 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 234/341 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 7/348 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 350 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48635ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 48637ms
Starting structural reductions in LTL mode, iteration 1 : 94/117 places, 235/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48922 ms. Remains : 94/117 places, 235/379 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(X(p0))&&F(p1))))&&(!p2 U (p3||G(!p2)))))'
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), true, (OR (NOT p0) (NOT p1)), (AND (NOT p3) p2), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-03
Product exploration explored 100000 steps with 77 reset in 563 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 0 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-03 finished in 49881 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(p1)&&p0))&&X(G(p1))))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 108 transition count 327
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 108 transition count 327
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 102 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 102 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 99 transition count 188
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 99 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 98 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 98 transition count 172
Applied a total of 38 rules in 12 ms. Remains 98 /117 variables (removed 19) and now considering 172/379 (removed 207) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11506645199707074430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14463892468609020706.kers'
[2026-05-27 03:23:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11506645199707074430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14463892468609020706.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 98 cols 965 entries
Finished phase 1 with 82 SingleSign rule and 2 generalized
[2026-05-27 03:23:00] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14463892468609020706.kers
Total runtime 2 ms.
[2026-05-27 03:23:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-27 03:23:00] [INFO ] Invariant cache hit.
[2026-05-27 03:23:00] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2026-05-27 03:23:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/270 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 120 constraints, problems are : Problem set: 0 solved, 171 unsolved in 11437 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 172/270 variables, 98/121 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 171/292 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 296 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41498ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 41499ms
Starting structural reductions in LTL mode, iteration 1 : 98/117 places, 172/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41843 ms. Remains : 98/117 places, 172/379 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(p1)&&p0))&&X(G(p1))))'
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-05 finished in 42000 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&&F(p1))))))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 107 transition count 301
Ensure Unique test removed 1 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 21 place count 106 transition count 301
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 28 place count 99 transition count 153
Iterating global reduction 0 with 7 rules applied. Total rules applied 35 place count 99 transition count 153
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 37 place count 97 transition count 147
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 96 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 95 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 95 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 94 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 94 transition count 137
Applied a total of 44 rules in 8 ms. Remains 94 /117 variables (removed 23) and now considering 137/379 (removed 242) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-229393680704874549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9594603283740463236.kers'
[2026-05-27 03:23:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-229393680704874549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9594603283740463236.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 94 cols 535 entries
Finished phase 1 with 80 SingleSign rule and 2 generalized
[2026-05-27 03:23:42] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9594603283740463236.kers
Total runtime 1 ms.
[2026-05-27 03:23:42] [INFO ] Implicit Places using invariants in 72 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/117 places, 137/379 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 93/117 places, 137/379 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&&F(p1))))))'
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-07
Product exploration explored 100000 steps with 21 reset in 307 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 1 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-07 finished in 577 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(X((!X(((G(F(p0)) U p0)&&G(F(p1)))) U p2))))'
Support contains 8 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 105 transition count 299
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 25 place count 104 transition count 299
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 31 place count 98 transition count 202
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 97 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 94 transition count 175
Ensure Unique test removed 2 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 92 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 91 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 91 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 90 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 90 transition count 157
Applied a total of 50 rules in 16 ms. Remains 90 /117 variables (removed 27) and now considering 157/379 (removed 222) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10140438927736398135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1758319587164264014.kers'
[2026-05-27 03:23:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10140438927736398135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1758319587164264014.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 90 cols 683 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-27 03:23:42] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1758319587164264014.kers
Total runtime 1 ms.
[2026-05-27 03:23:42] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-27 03:23:42] [INFO ] Invariant cache hit.
[2026-05-27 03:23:42] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2026-05-27 03:23:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/247 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/247 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 102 constraints, problems are : Problem set: 0 solved, 156 unsolved in 10282 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 157/247 variables, 90/103 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 156/259 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/247 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 269 constraints, problems are : Problem set: 0 solved, 156 unsolved in 28265 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 38577ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 38579ms
Starting structural reductions in LTL mode, iteration 1 : 90/117 places, 157/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38805 ms. Remains : 90/117 places, 157/379 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(X((!X(((G(F(p0)) U p0)&&G(F(p1)))) U p2))))'
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 p1)), p1, (AND p0 p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 227 ms.
Stack based approach found an accepted trace after 1248 steps with 0 reset with depth 1249 and stack size 1126 in 5 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-08 finished in 39359 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 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Graph (trivial) has 88 edges and 117 vertex of which 6 / 117 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 113 transition count 359
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 97 transition count 359
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 97 transition count 348
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 86 transition count 348
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 65 place count 76 transition count 213
Iterating global reduction 2 with 10 rules applied. Total rules applied 75 place count 76 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 76 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 78 place count 76 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 74 transition count 208
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 72 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 72 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 71 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 71 transition count 145
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 144 place count 43 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 41 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 41 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 39 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 39 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 154 place count 38 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 38 transition count 81
Applied a total of 157 rules in 49 ms. Remains 38 /117 variables (removed 79) and now considering 81/379 (removed 298) transitions.
[2026-05-27 03:24:22] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5038387312262923650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6032740059389343045.kers'
[2026-05-27 03:24:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5038387312262923650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6032740059389343045.kers]
Normalized transition count is 68 out of 69 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 38 cols 466 entries
Finished phase 1 with 22 SingleSign rule and 2 generalized
[2026-05-27 03:24:22] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6032740059389343045.kers
Total runtime 1 ms.
[2026-05-27 03:24:22] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-27 03:24:22] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
[2026-05-27 03:24:22] [INFO ] Invariant cache hit.
[2026-05-27 03:24:22] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-27 03:24:22] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2026-05-27 03:24:22] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2026-05-27 03:24:22] [INFO ] Flow matrix only has 69 transitions (discarded 12 similar events)
[2026-05-27 03:24:22] [INFO ] Invariant cache hit.
[2026-05-27 03:24:22] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 68/106 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 29/81 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/107 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 82 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4338 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 68/106 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 29/81 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/107 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 161 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5076 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 38/38 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9448ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 9449ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/117 places, 81/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9744 ms. Remains : 38/117 places, 81/379 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 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-09
Product exploration explored 100000 steps with 4 reset in 437 ms.
Stuttering criterion allowed to conclude after 89236 steps with 1 reset in 344 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-09 finished in 10641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U (X((F(G(p2)) U p3))&&p1)))'
Support contains 14 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 105 transition count 299
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 25 place count 104 transition count 299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 29 place count 100 transition count 292
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 99 transition count 292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 97 transition count 289
Ensure Unique test removed 2 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 95 transition count 289
Applied a total of 40 rules in 6 ms. Remains 95 /117 variables (removed 22) and now considering 289/379 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15395274189128161287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2301454734326869766.kers'
[2026-05-27 03:24:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15395274189128161287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2301454734326869766.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 289 rows 95 cols 1727 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-27 03:24:32] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2301454734326869766.kers
Total runtime 3 ms.
[2026-05-27 03:24:32] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-27 03:24:32] [INFO ] Invariant cache hit.
[2026-05-27 03:24:32] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2026-05-27 03:24:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/384 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 0/384 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 107 constraints, problems are : Problem set: 0 solved, 288 unsolved in 21539 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 289/384 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 288/396 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 6/402 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/384 variables, and 404 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51945ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 51947ms
Starting structural reductions in LTL mode, iteration 1 : 95/117 places, 289/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52210 ms. Remains : 95/117 places, 289/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U (X((F(G(p2)) U p3))&&p1)))'
Stuttering acceptance computed with spot in 695 ms :[(OR (NOT p1) (NOT p3)), (NOT p0), (NOT p3), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p3)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-10 finished in 52969 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((X(p0) U ((X(p0)&&G(!p1))||X(G(p0)))))||(X(X(X(F(p2))))&&(X(p0) U ((X(p0)&&G(!p1))||X(G(p0)))))))'
Support contains 8 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 110 transition count 318
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 110 transition count 318
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 106 transition count 203
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 106 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 104 transition count 193
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 104 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 103 transition count 177
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 103 transition count 177
Applied a total of 28 rules in 11 ms. Remains 103 /117 variables (removed 14) and now considering 177/379 (removed 202) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17742158893960778384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17133857188269376723.kers'
[2026-05-27 03:25:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17742158893960778384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17133857188269376723.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 177 rows 103 cols 975 entries
Finished phase 1 with 87 SingleSign rule and 2 generalized
[2026-05-27 03:25:25] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17133857188269376723.kers
Total runtime 2 ms.
[2026-05-27 03:25:25] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-27 03:25:25] [INFO ] Invariant cache hit.
[2026-05-27 03:25:25] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2026-05-27 03:25:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/280 variables, 103/120 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 121 constraints, problems are : Problem set: 0 solved, 176 unsolved in 12410 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 177/280 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 176/298 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 306 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42505ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 42506ms
Starting structural reductions in LTL mode, iteration 1 : 103/117 places, 177/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42766 ms. Remains : 103/117 places, 177/379 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((X(p0) U ((X(p0)&&G(!p1))||X(G(p0)))))||(X(X(X(F(p2))))&&(X(p0) U ((X(p0)&&G(!p1))||X(G(p0)))))))'
Stuttering acceptance computed with spot in 709 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (NOT p2) p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 323 ms.
Product exploration explored 100000 steps with 0 reset in 340 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Detected a total of 19/103 stabilizing places and 19/177 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 12 factoid took 89 ms. Reduced automaton from 15 states, 51 edges and 3 AP (stutter sensitive) to 12 states, 36 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 362 ms. (110 steps per ms) remains 6/15 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
[2026-05-27 03:26:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 5 (OVERLAPS) 25/103 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem apf9 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 177/280 variables, 103/118 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 118 constraints, problems are : Problem set: 3 solved, 3 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/78 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/103 variables, 4/14 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 177/280 variables, 103/118 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 3/121 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/121 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/121 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 121 constraints, problems are : Problem set: 3 solved, 3 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 766ms problems are : Problem set: 3 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 68 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=17 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 4 ms.
Found 3 invariant AP formulas.
Knowledge based reduction with 15 factoid took 285 ms. Reduced automaton from 12 states, 36 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Knowledge-based reduction took 1813 ms.
Stuttering acceptance computed with spot in 360 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Support contains 6 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2026-05-27 03:26:12] [INFO ] Invariant cache hit.
[2026-05-27 03:26:12] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-27 03:26:12] [INFO ] Invariant cache hit.
[2026-05-27 03:26:12] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 103/103 places, 177/177 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 198 ms. (201 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
[2026-05-27 03:26:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/77 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/103 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 177/280 variables, 103/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/77 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/103 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/280 variables, 103/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 120 constraints, problems are : Problem set: 0 solved, 2 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 726ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 61 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 1 ms.
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Knowledge-based reduction took 1419 ms.
Stuttering acceptance computed with spot in 370 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 354 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 0 reset in 212 ms.
Spot run failed in 163 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9205424322790079471
[2026-05-27 03:26:15] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9205424322790079471
Running compilation step : cd /tmp/ltsmin9205424322790079471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 787 ms.
Running link step : cd /tmp/ltsmin9205424322790079471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin9205424322790079471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased18346676627578506.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 177/177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 175
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 174
Applied a total of 6 rules in 2 ms. Remains 100 /103 variables (removed 3) and now considering 174/177 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9302588816460625894.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4797067610228575016.kers'
[2026-05-27 03:26:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9302588816460625894.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4797067610228575016.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 100 cols 969 entries
Finished phase 1 with 84 SingleSign rule and 2 generalized
[2026-05-27 03:26:30] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4797067610228575016.kers
Total runtime 2 ms.
[2026-05-27 03:26:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-27 03:26:30] [INFO ] Invariant cache hit.
[2026-05-27 03:26:30] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2026-05-27 03:26:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/274 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 116 constraints, problems are : Problem set: 0 solved, 173 unsolved in 11716 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 174/274 variables, 100/117 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 173/290 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 295 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 41795ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 41796ms
Starting structural reductions in LTL mode, iteration 1 : 100/103 places, 174/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42030 ms. Remains : 100/103 places, 174/177 transitions.
Built C files in :
/tmp/ltsmin12822749371921356939
[2026-05-27 03:27:12] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12822749371921356939
Running compilation step : cd /tmp/ltsmin12822749371921356939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 761 ms.
Running link step : cd /tmp/ltsmin12822749371921356939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin12822749371921356939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4351249208063337645.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 03:27:27] [INFO ] Flatten gal took : 15 ms
[2026-05-27 03:27:27] [INFO ] Flatten gal took : 13 ms
[2026-05-27 03:27:27] [INFO ] Time to serialize gal into /tmp/LTL16746676605417489555.gal : 4 ms
[2026-05-27 03:27:27] [INFO ] Time to serialize properties into /tmp/LTL7666048406739301104.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16746676605417489555.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5854047873909354902.hoa' '-atoms' '/tmp/LTL7666048406739301104.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7666048406739301104.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5854047873909354902.hoa
Reverse transition relation is NOT exact ! Due to transitions t12, t14, t16, t19, t44, t48, t55, t59, t62, t64, t68, t70, t75, t76, t78, t81, t255, t256, t...332
Detected timeout of ITS tools.
[2026-05-27 03:27:42] [INFO ] Flatten gal took : 13 ms
[2026-05-27 03:27:42] [INFO ] Flatten gal took : 11 ms
[2026-05-27 03:27:42] [INFO ] Time to serialize gal into /tmp/LTL16858229890122379312.gal : 4 ms
[2026-05-27 03:27:42] [INFO ] Time to serialize properties into /tmp/LTL12543694511230619617.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16858229890122379312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12543694511230619617.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G((X("(p31!=1)"))U((X(G("(p31!=1)")))||((X("(p31!=1)"))&&(G(!("((((p10==1)&&(p33==1))&&((p58==1)&&(p77==1)))&&(p116==1))")))))))||...324
Formula 0 simplified : F(X!"(p31!=1)" R (XF!"(p31!=1)" & (X!"(p31!=1)" | F"((((p10==1)&&(p33==1))&&((p58==1)&&(p77==1)))&&(p116==1))"))) & ((X!"(p31!=1)" R...284
Reverse transition relation is NOT exact ! Due to transitions t3, t12, t14, t16, t19, t44, t50, t53, t55, t59, t62, t64, t68, t70, t74, t75, t76, t78, t81,...340
Detected timeout of ITS tools.
[2026-05-27 03:27:57] [INFO ] Flatten gal took : 11 ms
[2026-05-27 03:27:57] [INFO ] Applying decomposition
[2026-05-27 03:27:57] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17110616267393857521.txt' '-o' '/tmp/graph17110616267393857521.bin' '-w' '/tmp/graph17110616267393857521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17110616267393857521.bin' '-l' '-1' '-v' '-w' '/tmp/graph17110616267393857521.weights' '-q' '0' '-e' '0.001'
[2026-05-27 03:27:57] [INFO ] Decomposing Gal with order
[2026-05-27 03:27:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:27:57] [INFO ] Removed a total of 243 redundant transitions.
[2026-05-27 03:27:57] [INFO ] Flatten gal took : 101 ms
[2026-05-27 03:27:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 14 ms.
[2026-05-27 03:27:57] [INFO ] Time to serialize gal into /tmp/LTL7725270860209322699.gal : 5 ms
[2026-05-27 03:27:57] [INFO ] Time to serialize properties into /tmp/LTL12288496763090198404.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7725270860209322699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12288496763090198404.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G((X("(u4.p31!=1)"))U((X(G("(u4.p31!=1)")))||((X("(u4.p31!=1)"))&&(G(!("((((i0.u11.p10==1)&&(i0.u11.p33==1))&&((i0.u11.p58==1)&&(i...421
Formula 0 simplified : F(X!"(u4.p31!=1)" R (XF!"(u4.p31!=1)" & (X!"(u4.p31!=1)" | F"((((i0.u11.p10==1)&&(i0.u11.p33==1))&&((i0.u11.p58==1)&&(i0.u11.p77==1)...381
Reverse transition relation is NOT exact ! Due to transitions t3, t12, t19, t68, t74, t290, u4.t75, u4.t76, u4.t78, u4.t259, u4.t260, u5.t70, u5.t255, u5.t...382
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
521 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.2455,160712,1,0,153645,58875,2598,755151,1490,698723,317371
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-11 finished in 158250 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)&&X(F((p1||X(X(F(p2)))))))))'
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 106 transition count 300
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 23 place count 105 transition count 300
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 28 place count 100 transition count 239
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 99 transition count 239
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 96 transition count 200
Ensure Unique test removed 2 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 94 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 92 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 92 transition count 160
Applied a total of 46 rules in 6 ms. Remains 92 /117 variables (removed 25) and now considering 160/379 (removed 219) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14478510113240560554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16588894448575847261.kers'
[2026-05-27 03:28:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14478510113240560554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16588894448575847261.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 92 cols 689 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-27 03:28:03] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16588894448575847261.kers
Total runtime 1 ms.
[2026-05-27 03:28:03] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-27 03:28:03] [INFO ] Invariant cache hit.
[2026-05-27 03:28:04] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2026-05-27 03:28:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/252 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/252 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 104 constraints, problems are : Problem set: 0 solved, 159 unsolved in 10103 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 160/252 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 159/264 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 274 constraints, problems are : Problem set: 0 solved, 159 unsolved in 26164 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36304ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 36305ms
Starting structural reductions in LTL mode, iteration 1 : 92/117 places, 160/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36498 ms. Remains : 92/117 places, 160/379 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)&&X(F((p1||X(X(F(p2)))))))))'
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-12 finished in 36780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((p1||F(G(p2))))))))'
Support contains 13 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 105 transition count 299
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 25 place count 104 transition count 299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 29 place count 100 transition count 292
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 99 transition count 292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 97 transition count 289
Ensure Unique test removed 2 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 95 transition count 289
Applied a total of 40 rules in 7 ms. Remains 95 /117 variables (removed 22) and now considering 289/379 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18142934452034175847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14494211158653068149.kers'
[2026-05-27 03:28:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18142934452034175847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14494211158653068149.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 289 rows 95 cols 1727 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-27 03:28:40] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14494211158653068149.kers
Total runtime 2 ms.
[2026-05-27 03:28:40] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-27 03:28:40] [INFO ] Invariant cache hit.
[2026-05-27 03:28:40] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2026-05-27 03:28:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/384 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 0/384 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 107 constraints, problems are : Problem set: 0 solved, 288 unsolved in 23506 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 289/384 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 288/396 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 6/402 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/384 variables, and 404 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53989ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 53991ms
Starting structural reductions in LTL mode, iteration 1 : 95/117 places, 289/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54221 ms. Remains : 95/117 places, 289/379 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(G(p1))))||p2))))'
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 409 ms.
Product exploration explored 100000 steps with 0 reset in 548 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 7 factoid took 67 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 306 ms. (130 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 318947 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 5
Probabilistic random walk after 318947 steps, saw 141037 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2026-05-27 03:29:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 45/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 37/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 289/384 variables, 95/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/384 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 105 constraints, problems are : Problem set: 0 solved, 5 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 45/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 37/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 289/384 variables, 95/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 109 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1481ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 841 steps, including 12 resets, run visited all 1 properties in 4 ms. (steps per millisecond=210 )
Parikh walk visited 5 properties in 216 ms.
Knowledge based reduction with 7 factoid took 130 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 5367 ms.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 13 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 289/289 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 289/289 (removed 0) transitions.
[2026-05-27 03:29:41] [INFO ] Invariant cache hit.
[2026-05-27 03:29:41] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-27 03:29:41] [INFO ] Invariant cache hit.
[2026-05-27 03:29:41] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 95/95 places, 289/289 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 6 factoid took 57 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 283347 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 5
Probabilistic random walk after 283347 steps, saw 127573 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2026-05-27 03:29:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 45/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 37/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 289/384 variables, 95/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/384 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 105 constraints, problems are : Problem set: 0 solved, 5 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 45/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 37/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 289/384 variables, 95/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 109 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1398ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 435 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=217 )
Parikh walk visited 5 properties in 110 ms.
Knowledge based reduction with 6 factoid took 118 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 5047 ms.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 239 ms.
Product exploration explored 100000 steps with 0 reset in 510 ms.
Spot run failed in 80 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2053935792747911716
[2026-05-27 03:29:47] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2053935792747911716
Running compilation step : cd /tmp/ltsmin2053935792747911716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 969 ms.
Running link step : cd /tmp/ltsmin2053935792747911716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2053935792747911716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7895018459046601399.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 13 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 289/289 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 289/289 (removed 0) transitions.
[2026-05-27 03:30:02] [INFO ] Invariant cache hit.
[2026-05-27 03:30:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-27 03:30:02] [INFO ] Invariant cache hit.
[2026-05-27 03:30:03] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 95/95 places, 289/289 transitions.
Built C files in :
/tmp/ltsmin17480439515495412087
[2026-05-27 03:30:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17480439515495412087
Running compilation step : cd /tmp/ltsmin17480439515495412087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 991 ms.
Running link step : cd /tmp/ltsmin17480439515495412087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17480439515495412087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased349243095120566984.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 03:30:18] [INFO ] Flatten gal took : 31 ms
[2026-05-27 03:30:18] [INFO ] Flatten gal took : 26 ms
[2026-05-27 03:30:18] [INFO ] Time to serialize gal into /tmp/LTL11359700304376039902.gal : 5 ms
[2026-05-27 03:30:18] [INFO ] Time to serialize properties into /tmp/LTL14896167915585413901.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11359700304376039902.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9949866981986547756.hoa' '-atoms' '/tmp/LTL14896167915585413901.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14896167915585413901.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9949866981986547756.hoa
Reverse transition relation is NOT exact ! Due to transitions t12, t14, t16, t19, t44, t48, t55, t59, t62, t68, t75, t81, t86, t87, t88, t89, t90, t91, t92...1223
Detected timeout of ITS tools.
[2026-05-27 03:30:33] [INFO ] Flatten gal took : 25 ms
[2026-05-27 03:30:33] [INFO ] Flatten gal took : 24 ms
[2026-05-27 03:30:33] [INFO ] Time to serialize gal into /tmp/LTL2858535583454428965.gal : 9 ms
[2026-05-27 03:30:33] [INFO ] Time to serialize properties into /tmp/LTL8403636422790190995.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2858535583454428965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8403636422790190995.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("((((p15==1)&&(p40==1))&&((p53==1)&&(p78==1)))&&((p118==1)&&(p177==1)))")||(F(G("((((p15==0)||(p34==0))||((p49==0)||(p78==0...269
Formula 0 simplified : XG(!"((((p11==1)&&(p30==1))&&((p59==1)&&(p72==1)))&&((p118==1)&&(p171==1)))" & X(!"((((p15==1)&&(p40==1))&&((p53==1)&&(p78==1)))&&((...257
Reverse transition relation is NOT exact ! Due to transitions t12, t14, t16, t19, t44, t48, t55, t59, t62, t68, t75, t81, t86, t87, t88, t89, t90, t91, t92...1223
Detected timeout of ITS tools.
[2026-05-27 03:30:48] [INFO ] Flatten gal took : 12 ms
[2026-05-27 03:30:48] [INFO ] Applying decomposition
[2026-05-27 03:30:48] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16108728526270285963.txt' '-o' '/tmp/graph16108728526270285963.bin' '-w' '/tmp/graph16108728526270285963.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16108728526270285963.bin' '-l' '-1' '-v' '-w' '/tmp/graph16108728526270285963.weights' '-q' '0' '-e' '0.001'
[2026-05-27 03:30:48] [INFO ] Decomposing Gal with order
[2026-05-27 03:30:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:30:48] [INFO ] Removed a total of 160 redundant transitions.
[2026-05-27 03:30:48] [INFO ] Flatten gal took : 30 ms
[2026-05-27 03:30:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2026-05-27 03:30:48] [INFO ] Time to serialize gal into /tmp/LTL8896477447120992790.gal : 6 ms
[2026-05-27 03:30:48] [INFO ] Time to serialize properties into /tmp/LTL7215458874301775795.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8896477447120992790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7215458874301775795.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("((((u10.p15==1)&&(u10.p40==1))&&((u10.p53==1)&&(u10.p78==1)))&&((u10.p118==1)&&(u10.p177==1)))")||(F(G("((((u10.p15==0)||(...341
Formula 0 simplified : XG(!"((((u10.p11==1)&&(u10.p30==1))&&((u10.p59==1)&&(u10.p72==1)))&&((u10.p118==1)&&(u10.p171==1)))" & X(!"((((u10.p15==1)&&(u10.p40...329
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-13 finished in 142951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(G(p0))))))))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 379/379 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 105 transition count 299
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 25 place count 104 transition count 299
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 30 place count 99 transition count 238
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 98 transition count 238
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 94 transition count 197
Ensure Unique test removed 2 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 92 transition count 197
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 89 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 89 transition count 155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 87 transition count 151
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 87 transition count 151
Applied a total of 56 rules in 7 ms. Remains 87 /117 variables (removed 30) and now considering 151/379 (removed 228) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2333409400095637367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9461171290784145424.kers'
[2026-05-27 03:31:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2333409400095637367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9461171290784145424.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 87 cols 671 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-27 03:31:03] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9461171290784145424.kers
Total runtime 1 ms.
[2026-05-27 03:31:03] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-27 03:31:03] [INFO ] Invariant cache hit.
[2026-05-27 03:31:03] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2026-05-27 03:31:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/238 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/238 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 99 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9724 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 151/238 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 150/250 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/238 variables, and 258 constraints, problems are : Problem set: 0 solved, 150 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 39782ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 39782ms
Starting structural reductions in LTL mode, iteration 1 : 87/117 places, 151/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39979 ms. Remains : 87/117 places, 151/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(G(p0))))))))'
Stuttering acceptance computed with spot in 353 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0404-LTLFireability-15
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0404-LTLFireability-15 finished in 40370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((p1||F(G(p2))))))))'
Spot run failed in 82 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-27 03:31:44] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17196211375954355810
[2026-05-27 03:31:44] [INFO ] Computing symmetric may disable matrix : 379 transitions.
[2026-05-27 03:31:44] [INFO ] Applying decomposition
[2026-05-27 03:31:44] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 03:31:44] [INFO ] Computing symmetric may enable matrix : 379 transitions.
[2026-05-27 03:31:44] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 03:31:44] [INFO ] Flatten gal took : 41 ms
[2026-05-27 03:31:44] [INFO ] Computing Do-Not-Accords matrix : 379 transitions.
[2026-05-27 03:31:44] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 03:31:44] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17196211375954355810
Running compilation step : cd /tmp/ltsmin17196211375954355810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph516466126735068901.txt' '-o' '/tmp/graph516466126735068901.bin' '-w' '/tmp/graph516466126735068901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph516466126735068901.bin' '-l' '-1' '-v' '-w' '/tmp/graph516466126735068901.weights' '-q' '0' '-e' '0.001'
[2026-05-27 03:31:44] [INFO ] Decomposing Gal with order
[2026-05-27 03:31:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:31:44] [INFO ] Removed a total of 384 redundant transitions.
[2026-05-27 03:31:44] [INFO ] Flatten gal took : 171 ms
[2026-05-27 03:31:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 21 ms.
[2026-05-27 03:31:44] [INFO ] Time to serialize gal into /tmp/LTLFireability1835742172089532772.gal : 15 ms
[2026-05-27 03:31:44] [INFO ] Time to serialize properties into /tmp/LTLFireability2858086244132313485.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1835742172089532772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2858086244132313485.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((i5.u11.p11==1)&&(i5.u11.p30==1))&&((i5.u11.p59==1)&&(i5.u11.p72==1)))&&((i5.u11.p118==1)&&(i5.u22.p171==1)))")||(X(("((((...395
Formula 0 simplified : XG(!"((((i5.u11.p11==1)&&(i5.u11.p30==1))&&((i5.u11.p59==1)&&(i5.u11.p72==1)))&&((i5.u11.p118==1)&&(i5.u22.p171==1)))" & X(!"((((i5....383
Compilation finished in 1870 ms.
Running link step : cd /tmp/ltsmin17196211375954355810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17196211375954355810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||X(((LTLAPp1==true)||<>([]((LTLAPp2==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t12, t44, t74, t75, t81, u4.t78, u4.t259, u4.t260, u3.t257, u3.t258, i0.i0.u8.t55, i0...757
Detected timeout of ITS tools.
[2026-05-27 03:56:09] [INFO ] Applying decomposition
[2026-05-27 03:56:09] [INFO ] Flatten gal took : 30 ms
[2026-05-27 03:56:09] [INFO ] Decomposing Gal with order
[2026-05-27 03:56:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:56:09] [INFO ] Removed a total of 1443 redundant transitions.
[2026-05-27 03:56:09] [INFO ] Flatten gal took : 65 ms
[2026-05-27 03:56:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 13 ms.
[2026-05-27 03:56:09] [INFO ] Time to serialize gal into /tmp/LTLFireability8028454702498200700.gal : 1 ms
[2026-05-27 03:56:09] [INFO ] Time to serialize properties into /tmp/LTLFireability17702992705585354257.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8028454702498200700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17702992705585354257.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((i0.i0.i0.i0.u5.p11==1)&&(i0.i0.i0.i0.u6.p30==1))&&((i0.i0.i0.u7.p59==1)&&(i0.i0.u8.p72==1)))&&((i0.i1.u13.p118==1)&&(i1.u...473
Formula 0 simplified : XG(!"((((i0.i0.i0.i0.u5.p11==1)&&(i0.i0.i0.i0.u6.p30==1))&&((i0.i0.i0.u7.p59==1)&&(i0.i0.u8.p72==1)))&&((i0.i1.u13.p118==1)&&(i1.u18...461
Reverse transition relation is NOT exact ! Due to transitions i0.t315, i0.i0.u8.t3, i0.i0.u8.t4, i0.i0.u8.t62, i0.i0.u8.t261, i0.i0.u8.t262, i0.i0.i0.u7.t1...621
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5865 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,58.6762,898580,1,0,1.18897e+06,11033,1994,6.13257e+06,859,151922,369824
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV0-PT-0404-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2323722 ms.

BK_STOP 1779854235386

--------------------
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="ErlangenMainframeV0-PT-0404"
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 ErlangenMainframeV0-PT-0404, 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 r114-smll-177955740600412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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