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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-rw-r--r-- 1 mcc users 5.6K Mar 7 05:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 7 05:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 05:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 05:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 09:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 09:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 05:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Mar 7 05:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 7 05:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 05:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:54 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 531K 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-0505-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779854339457

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-0505
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 03:59:01] [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:59:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 03:59:02] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2026-05-27 03:59:02] [INFO ] Transformed 203 places.
[2026-05-27 03:59:02] [INFO ] Transformed 949 transitions.
[2026-05-27 03:59:02] [INFO ] Found NUPN structural information;
[2026-05-27 03:59:02] [INFO ] Parsed PT model containing 203 places and 949 transitions and 10344 arcs in 585 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 949/949 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 155 transition count 901
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 155 transition count 901
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 123 place count 128 transition count 874
Iterating global reduction 0 with 27 rules applied. Total rules applied 150 place count 128 transition count 874
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 152 place count 126 transition count 872
Iterating global reduction 0 with 2 rules applied. Total rules applied 154 place count 126 transition count 872
Applied a total of 154 rules in 131 ms. Remains 126 /203 variables (removed 77) and now considering 872/949 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1744771232710113483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1386107148081670358.kers'
[2026-05-27 03:59:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1744771232710113483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1386107148081670358.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 872 rows 126 cols 10190 entries
Finished phase 1 with 107 SingleSign rule and 3 generalized
[2026-05-27 03:59:02] [INFO ] Computed 16 invariants in 11 ms
Computed 16 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-1386107148081670358.kers
Total runtime 16 ms.
[2026-05-27 03:59:03] [INFO ] Implicit Places using invariants in 449 ms returned []
[2026-05-27 03:59:03] [INFO ] Invariant cache hit.
[2026-05-27 03:59:03] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Running 871 sub problems to find dead transitions.
[2026-05-27 03:59:04] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 871 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/998 variables, and 21 constraints, problems are : Problem set: 0 solved, 871 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/126 constraints, PredecessorRefiner: 871/127 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 871 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 5 (OVERLAPS) 872/998 variables, 126/147 constraints. Problems are: Problem set: 0 solved, 871 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/998 variables, 127/274 constraints. Problems are: Problem set: 0 solved, 871 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 998/998 variables, and 275 constraints, problems are : Problem set: 0 solved, 871 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 871/127 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61950ms problems are : Problem set: 0 solved, 871 unsolved
Search for dead transitions found 0 dead transitions in 61996ms
Starting structural reductions in LTL mode, iteration 1 : 126/203 places, 872/949 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63584 ms. Remains : 126/203 places, 872/949 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Applied a total of 0 rules in 11 ms. Remains 126 /126 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2026-05-27 04:00:06] [INFO ] Invariant cache hit.
[2026-05-27 04:00:06] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-27 04:00:06] [INFO ] Invariant cache hit.
[2026-05-27 04:00:06] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 667 ms. Remains : 126/126 places, 872/872 transitions.
Support contains 41 out of 126 places after structural reductions.
[2026-05-27 04:00:07] [INFO ] Flatten gal took : 384 ms
[2026-05-27 04:00:07] [INFO ] Flatten gal took : 133 ms
[2026-05-27 04:00:08] [INFO ] Input system was already deterministic with 872 transitions.
RANDOM walk for 40000 steps (8 resets) in 2936 ms. (13 steps per ms) remains 22/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
[2026-05-27 04:00:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 29/63 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 40/103 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 21 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 6 (OVERLAPS) 23/126 variables, 5/17 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 3/20 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 872/998 variables, 126/146 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/998 variables, 0/146 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/998 variables, 0/146 constraints. Problems are: Problem set: 2 solved, 20 unsolved
No progress, stopping.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
After SMT solving in domain Real declared 998/998 variables, and 146 constraints, problems are : Problem set: 2 solved, 20 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 22/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 29/62 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 40/102 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 24/126 variables, 5/17 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 3/20 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 6/26 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 872/998 variables, 126/152 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 998/998 variables, and 152 constraints, problems are : Problem set: 2 solved, 20 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10125ms problems are : Problem set: 2 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 872/872 transitions.
Graph (trivial) has 71 edges and 126 vertex of which 4 / 126 are part of one of the 2 SCC in 9 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 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 124 transition count 852
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 108 transition count 852
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 108 transition count 841
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 97 transition count 841
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 93 transition count 828
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 93 transition count 828
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 93 transition count 827
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 93 transition count 826
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 92 transition count 826
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 112 place count 69 transition count 803
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 68 transition count 796
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 68 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 68 transition count 795
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 119 place count 66 transition count 812
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 120 place count 66 transition count 811
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 125 place count 66 transition count 806
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 132 place count 61 transition count 804
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 145 place count 61 transition count 791
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 147 place count 61 transition count 791
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 152 place count 61 transition count 791
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 157 place count 61 transition count 786
Applied a total of 157 rules in 864 ms. Remains 61 /126 variables (removed 65) and now considering 786/872 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 864 ms. Remains : 61/126 places, 786/872 transitions.
RANDOM walk for 40000 steps (8 resets) in 700 ms. (57 steps per ms) remains 12/20 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6585521978521909859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5598029014727106599.kers'
[2026-05-27 04:00:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6585521978521909859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5598029014727106599.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 786 rows 60 cols 9912 entries
Finished phase 1 with 42 SingleSign rule and 3 generalized
[2026-05-27 04:00:21] [INFO ] Computed 16 invariants in 7 ms
Computed 16 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-5598029014727106599.kers
Total runtime 11 ms.
[2026-05-27 04:00:21] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 8/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 7/48 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 13/61 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 786/847 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/847 variables, 26/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/847 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/847 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 847/847 variables, and 103 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2247 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 8/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 7/48 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 13/61 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 786/847 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/847 variables, 26/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/847 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/847 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 847/847 variables, and 103 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2543 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4844ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 7 properties in 1952 ms.
Support contains 18 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 786/786 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 61 transition count 783
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 6 place count 58 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 57 transition count 702
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 57 transition count 702
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 0 with 2 rules applied. Total rules applied 10 place count 56 transition count 701
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 53 transition count 701
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 53 transition count 698
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 23 place count 53 transition count 694
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 27 place count 49 transition count 694
Applied a total of 27 rules in 171 ms. Remains 49 /61 variables (removed 12) and now considering 694/786 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 49/61 places, 694/786 transitions.
RANDOM walk for 40000 steps (8 resets) in 3034 ms. (13 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
[2026-05-27 04:00:29] [INFO ] Flow matrix only has 692 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14055049299631451848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8039961154651458503.kers'
[2026-05-27 04:00:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14055049299631451848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8039961154651458503.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 692 rows 48 cols 8430 entries
Finished phase 1 with 30 SingleSign rule and 3 generalized
[2026-05-27 04:00:29] [INFO ] Computed 16 invariants in 5 ms
Computed 16 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8039961154651458503.kers
Total runtime 7 ms.
[2026-05-27 04:00:29] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/31 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/49 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 692/741 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 270/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/741 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 741/741 variables, and 335 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1838 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 49/49 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/20 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/31 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/49 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 692/741 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 270/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/741 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 741/741 variables, and 335 constraints, problems are : Problem set: 0 solved, 4 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 49/49 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2850ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 461 ms.
Support contains 11 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 694/694 transitions.
Graph (trivial) has 13 edges and 49 vertex of which 2 / 49 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 48 transition count 690
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 5 place count 46 transition count 690
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 0 with 2 rules applied. Total rules applied 7 place count 45 transition count 689
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 44 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 44 transition count 442
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 44 transition count 441
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 42 transition count 441
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 42 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 42 transition count 438
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 42 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 41 transition count 437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 40 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 39 transition count 436
Applied a total of 21 rules in 183 ms. Remains 39 /49 variables (removed 10) and now considering 436/694 (removed 258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 39/49 places, 436/694 transitions.
RANDOM walk for 40000 steps (8 resets) in 1330 ms. (30 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
[2026-05-27 04:00:33] [INFO ] Flow matrix only has 432 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-5803945719205028696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9911496706249129289.kers'
[2026-05-27 04:00:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5803945719205028696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9911496706249129289.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 432 rows 34 cols 4507 entries
Finished phase 1 with 21 SingleSign rule and 3 generalized
[2026-05-27 04:00:33] [INFO ] Computed 15 invariants in 3 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9911496706249129289.kers
Total runtime 4 ms.
[2026-05-27 04:00:33] [INFO ] State equation strengthened by 244 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) 13/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 420/451 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/455 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/457 variables, 244/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/467 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/467 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/471 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/471 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/471 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/471 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 1/0 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) 13/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 420/451 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/455 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/457 variables, 244/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/467 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/467 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/471 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/471 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/471 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/471 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1039ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 436/436 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 35 transition count 306
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 35 transition count 306
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 33 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 33 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 33 transition count 167
Applied a total of 16 rules in 36 ms. Remains 33 /39 variables (removed 6) and now considering 167/436 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 33/39 places, 167/436 transitions.
RANDOM walk for 15832 steps (2 resets) in 148 ms. (106 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 17 stabilizing places and 17 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((!p0 U (p1||G(!p0))) U G(!p2))) U (X(p3)||F(p0))))'
Support contains 16 out of 126 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 119 transition count 732
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 119 transition count 732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 118 transition count 731
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 118 transition count 731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 117 transition count 730
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 117 transition count 730
Applied a total of 18 rules in 17 ms. Remains 117 /126 variables (removed 9) and now considering 730/872 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12352944177767870110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15068091254022262237.kers'
[2026-05-27 04:00:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12352944177767870110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15068091254022262237.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 730 rows 117 cols 8556 entries
Finished phase 1 with 98 SingleSign rule and 3 generalized
[2026-05-27 04:00:35] [INFO ] Computed 16 invariants in 11 ms
Computed 16 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-15068091254022262237.kers
Total runtime 15 ms.
[2026-05-27 04:00:35] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-27 04:00:35] [INFO ] Invariant cache hit.
[2026-05-27 04:00:35] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Running 729 sub problems to find dead transitions.
[2026-05-27 04:00:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 2 (OVERLAPS) 1/117 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 729 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 117/847 variables, and 18 constraints, problems are : Problem set: 0 solved, 729 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/117 constraints, PredecessorRefiner: 729/120 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 729 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 2 (OVERLAPS) 1/117 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 6 (OVERLAPS) 730/847 variables, 117/136 constraints. Problems are: Problem set: 0 solved, 729 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/847 variables, 120/256 constraints. Problems are: Problem set: 0 solved, 729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 847/847 variables, and 256 constraints, problems are : Problem set: 0 solved, 729 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 729/120 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61306ms problems are : Problem set: 0 solved, 729 unsolved
Search for dead transitions found 0 dead transitions in 61312ms
Starting structural reductions in LTL mode, iteration 1 : 117/126 places, 730/872 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62060 ms. Remains : 117/126 places, 730/872 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((!p0 U (G(!p0)||p1)) U G(!p2))) U (X(p3)||F(p0))))'
Stuttering acceptance computed with spot in 476 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 1042 ms.
Product exploration explored 100000 steps with 0 reset in 620 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 10 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 516 ms. (77 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 531 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 177081 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 8
Probabilistic random walk after 177081 steps, saw 87823 distinct states, run finished after 3007 ms. (steps per millisecond=58 ) properties seen :0
[2026-05-27 04:01:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/48 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 39/87 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 30/117 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 730/847 variables, 117/135 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/847 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/847 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 847/847 variables, and 135 constraints, problems are : Problem set: 1 solved, 7 unsolved in 1776 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 32/48 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 39/87 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 30/117 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 730/847 variables, 117/136 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/847 variables, 1/137 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/847 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/847 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 847/847 variables, and 137 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3065 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4874ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 4280 steps, including 57 resets, run visited all 2 properties in 116 ms. (steps per millisecond=36 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 600 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 11 factoid took 196 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 9 states, 28 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 492 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p2), false, false, false, false, false, false]
[2026-05-27 04:01:49] [INFO ] Invariant cache hit.
[2026-05-27 04:01:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
Proved EG (AND (NOT p0) (NOT p3)) asserting that LTL formula F !(AND (NOT p0) (NOT p3)) is false.
Negative knowledge disproves property using: (F (NOT (AND (NOT p0) (NOT p3))))
Knowledge-based reduction took 11026 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-00 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-00 finished in 75409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((X(X(!p1)) U ((X(X(!p1))&&(!p1||F(!p0)))||X(X(G(!p1)))))))))'
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 117 transition count 657
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 117 transition count 657
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 111 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 111 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 109 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 109 transition count 231
Applied a total of 34 rules in 34 ms. Remains 109 /126 variables (removed 17) and now considering 231/872 (removed 641) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11604514045702058937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3650954671769792153.kers'
[2026-05-27 04:01:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11604514045702058937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3650954671769792153.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 231 rows 109 cols 1734 entries
Finished phase 1 with 91 SingleSign rule and 2 generalized
[2026-05-27 04:01:50] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3650954671769792153.kers
Total runtime 4 ms.
[2026-05-27 04:01:50] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-27 04:01:50] [INFO ] Invariant cache hit.
[2026-05-27 04:01:50] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2026-05-27 04:01:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 231/340 variables, 109/128 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 132 constraints, problems are : Problem set: 0 solved, 230 unsolved in 22294 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 231/340 variables, 109/133 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 230/363 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 366 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52573ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 52575ms
Starting structural reductions in LTL mode, iteration 1 : 109/126 places, 231/872 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53062 ms. Remains : 109/126 places, 231/872 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((X(X(!p1)) U ((X(X(!p1))&&(!p1||F(!p0)))||X(X(G(!p1)))))))))'
Stuttering acceptance computed with spot in 649 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), p1, p1, (AND p0 p1), (AND p1 (NOT p0)), p1, (AND p0 p1), (AND p1 (NOT p0)), true, (AND p0 p1), (AND (NOT p0) p1), p0, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 231 ms.
Product exploration explored 100000 steps with 20000 reset in 267 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 15 states, 23 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1592396 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :0 out of 1
Probabilistic random walk after 1592396 steps, saw 561015 distinct states, run finished after 3001 ms. (steps per millisecond=530 ) properties seen :0
[2026-05-27 04:02:47] [INFO ] Invariant cache hit.
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) 52/78 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/109 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/340 variables, 109/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 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) 52/78 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/109 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/340 variables, 109/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 179 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=89 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[p1, p1, p1, p1, true, p1]
Knowledge-based reduction took 3978 ms.
Stuttering acceptance computed with spot in 232 ms :[p1, p1, p1, p1, true, p1]
Support contains 6 out of 109 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 231/231 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2026-05-27 04:02:48] [INFO ] Invariant cache hit.
[2026-05-27 04:02:48] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-27 04:02:48] [INFO ] Invariant cache hit.
[2026-05-27 04:02:49] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 109/109 places, 231/231 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1261378 steps, run timeout after 3001 ms. (steps per millisecond=420 ) properties seen :0 out of 1
Probabilistic random walk after 1261378 steps, saw 465290 distinct states, run finished after 3001 ms. (steps per millisecond=420 ) properties seen :0
[2026-05-27 04:02:52] [INFO ] Invariant cache hit.
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) 52/78 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/109 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/340 variables, 109/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 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) 52/78 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/109 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 231/340 variables, 109/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 522ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 179 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=179 )
Parikh walk visited 1 properties in 2 ms.
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[p1, p1, p1, p1, true, p1]
Knowledge-based reduction took 3960 ms.
Stuttering acceptance computed with spot in 249 ms :[p1, p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 249 ms :[p1, p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 20000 reset in 120 ms.
Product exploration explored 100000 steps with 20000 reset in 120 ms.
Spot run failed in 169 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/ltsmin4207555983514384558
[2026-05-27 04:02:54] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4207555983514384558
Running compilation step : cd /tmp/ltsmin4207555983514384558;'/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 1375 ms.
Running link step : cd /tmp/ltsmin4207555983514384558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin4207555983514384558;'/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/stateBased194763030289506694.hoa' '--buchi-type=spotba'
LTSmin run took 76 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-04 finished in 65401 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((X(X((X(p0)&&F(p1)))) U (p2 U !p1)))))'
Support contains 14 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 116 transition count 656
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 116 transition count 656
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 114 transition count 493
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 114 transition count 493
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 112 transition count 490
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 112 transition count 490
Applied a total of 28 rules in 19 ms. Remains 112 /126 variables (removed 14) and now considering 490/872 (removed 382) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10326350251055142500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-615525124467053263.kers'
[2026-05-27 04:02:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10326350251055142500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-615525124467053263.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 490 rows 112 cols 5372 entries
Finished phase 1 with 94 SingleSign rule and 2 generalized
[2026-05-27 04:02:55] [INFO ] Computed 16 invariants in 5 ms
Computed 16 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-615525124467053263.kers
Total runtime 8 ms.
[2026-05-27 04:02:55] [INFO ] Implicit Places using invariants in 234 ms returned []
[2026-05-27 04:02:55] [INFO ] Invariant cache hit.
[2026-05-27 04:02:56] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 489 sub problems to find dead transitions.
[2026-05-27 04:02:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 5 (OVERLAPS) 490/602 variables, 112/130 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/602 variables, and 134 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 489/119 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 489 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 5 (OVERLAPS) 490/602 variables, 112/134 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 119/253 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 257 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 489/119 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60766ms problems are : Problem set: 0 solved, 489 unsolved
Search for dead transitions found 0 dead transitions in 60772ms
Starting structural reductions in LTL mode, iteration 1 : 112/126 places, 490/872 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61516 ms. Remains : 112/126 places, 490/872 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((X(X((X(p0)&&F(p1)))) U (p2 U !p1)))))'
Stuttering acceptance computed with spot in 501 ms :[p1, p1, (OR (NOT p1) (NOT p0)), p1, (AND (NOT p0) p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-05
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-05 finished in 62083 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 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 111 transition count 625
Ensure Unique test removed 5 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 35 place count 106 transition count 625
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 41 place count 100 transition count 202
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 100 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 50 place count 97 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 53 place count 97 transition count 197
Applied a total of 53 rules in 18 ms. Remains 97 /126 variables (removed 29) and now considering 197/872 (removed 675) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6614939470624591522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5305166860109825100.kers'
[2026-05-27 04:03:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6614939470624591522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5305166860109825100.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 97 cols 1031 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-27 04:03:57] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5305166860109825100.kers
Total runtime 2 ms.
[2026-05-27 04:03:57] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-27 04:03:57] [INFO ] Invariant cache hit.
[2026-05-27 04:03:58] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-27 04:03:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/294 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 110 constraints, problems are : Problem set: 0 solved, 196 unsolved in 14293 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/294 variables, 97/111 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 196/307 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 294/294 variables, and 312 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 44418ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 44419ms
Starting structural reductions in LTL mode, iteration 1 : 97/126 places, 197/872 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44775 ms. Remains : 97/126 places, 197/872 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-0505-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 269 ms.
Product exploration explored 100000 steps with 0 reset in 450 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1756163 steps, run timeout after 3030 ms. (steps per millisecond=579 ) properties seen :0 out of 1
Probabilistic random walk after 1756163 steps, saw 573549 distinct states, run finished after 3030 ms. (steps per millisecond=579 ) properties seen :0
[2026-05-27 04:04:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/294 variables, 97/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 97/97 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/294 variables, 97/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/294 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 0 ms.
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 3964 ms.
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 197/197 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2026-05-27 04:04:47] [INFO ] Invariant cache hit.
[2026-05-27 04:04:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-27 04:04:47] [INFO ] Invariant cache hit.
[2026-05-27 04:04:48] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 97/97 places, 197/197 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1795376 steps, run timeout after 3001 ms. (steps per millisecond=598 ) properties seen :0 out of 1
Probabilistic random walk after 1795376 steps, saw 582536 distinct states, run finished after 3001 ms. (steps per millisecond=598 ) properties seen :0
[2026-05-27 04:04:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/294 variables, 97/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 97/97 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 197/294 variables, 97/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/294 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 456ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 4022 ms.
Stuttering acceptance computed with spot in 355 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 355 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 277 ms.
Product exploration explored 100000 steps with 0 reset in 344 ms.
Spot run failed in 69 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/ltsmin17642859070674548138
[2026-05-27 04:04:53] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17642859070674548138
Running compilation step : cd /tmp/ltsmin17642859070674548138;'/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 538 ms.
Running link step : cd /tmp/ltsmin17642859070674548138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17642859070674548138;'/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/stateBased10882983983521158188.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 197/197 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2026-05-27 04:05:08] [INFO ] Invariant cache hit.
[2026-05-27 04:05:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-27 04:05:08] [INFO ] Invariant cache hit.
[2026-05-27 04:05:08] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 97/97 places, 197/197 transitions.
Built C files in :
/tmp/ltsmin14986043999495712645
[2026-05-27 04:05:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14986043999495712645
Running compilation step : cd /tmp/ltsmin14986043999495712645;'/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 734 ms.
Running link step : cd /tmp/ltsmin14986043999495712645;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14986043999495712645;'/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/stateBased8159105114766928128.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 04:05:24] [INFO ] Flatten gal took : 10 ms
[2026-05-27 04:05:24] [INFO ] Flatten gal took : 12 ms
[2026-05-27 04:05:24] [INFO ] Time to serialize gal into /tmp/LTL8902359098715938988.gal : 6 ms
[2026-05-27 04:05:24] [INFO ] Time to serialize properties into /tmp/LTL10601244616627619520.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/LTL8902359098715938988.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2148760013593943842.hoa' '-atoms' '/tmp/LTL10601244616627619520.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/LTL10601244616627619520.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2148760013593943842.hoa
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t13, t18, t44, t48, t53, t57, t60, t66, t69, t73, t79, t81, t84, t85, t90, t91, t96,...662
Detected timeout of ITS tools.
[2026-05-27 04:05:39] [INFO ] Flatten gal took : 10 ms
[2026-05-27 04:05:39] [INFO ] Flatten gal took : 10 ms
[2026-05-27 04:05:39] [INFO ] Time to serialize gal into /tmp/LTL16507918282989744498.gal : 4 ms
[2026-05-27 04:05:39] [INFO ] Time to serialize properties into /tmp/LTL7030079185875470996.ltl : 5 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/LTL16507918282989744498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7030079185875470996.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(X(G("((((p16==0)||(p41==0))||((p50==0)||(p79==0)))||(((p88==0)||(p138==0))||(p197==0)))")))))))))
Formula 0 simplified : XXXXXXF!"((((p16==0)||(p41==0))||((p50==0)||(p79==0)))||(((p88==0)||(p138==0))||(p197==0)))"
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t13, t18, t44, t48, t53, t57, t60, t66, t69, t73, t79, t81, t84, t85, t90, t91, t96,...662
Detected timeout of ITS tools.
[2026-05-27 04:05:54] [INFO ] Flatten gal took : 10 ms
[2026-05-27 04:05:54] [INFO ] Applying decomposition
[2026-05-27 04:05:54] [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/graph953116769976767441.txt' '-o' '/tmp/graph953116769976767441.bin' '-w' '/tmp/graph953116769976767441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph953116769976767441.bin' '-l' '-1' '-v' '-w' '/tmp/graph953116769976767441.weights' '-q' '0' '-e' '0.001'
[2026-05-27 04:05:54] [INFO ] Decomposing Gal with order
[2026-05-27 04:05:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 04:05:54] [INFO ] Removed a total of 182 redundant transitions.
[2026-05-27 04:05:54] [INFO ] Flatten gal took : 102 ms
[2026-05-27 04:05:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 10 ms.
[2026-05-27 04:05:54] [INFO ] Time to serialize gal into /tmp/LTL16063037410580677625.gal : 7 ms
[2026-05-27 04:05:54] [INFO ] Time to serialize properties into /tmp/LTL3553996524244564482.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/LTL16063037410580677625.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3553996524244564482.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 : !((X(X(X(X(X(X(G("((((u12.p16==0)||(u12.p41==0))||((u12.p50==0)||(u12.p79==0)))||(((u12.p88==0)||(u12.p138==0))||(u12.p197==0)))")))))...159
Formula 0 simplified : XXXXXXF!"((((u12.p16==0)||(u12.p41==0))||((u12.p50==0)||(u12.p79==0)))||(((u12.p88==0)||(u12.p138==0))||(u12.p197==0)))"
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-06 finished in 131896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 111 transition count 625
Ensure Unique test removed 5 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 35 place count 106 transition count 625
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 41 place count 100 transition count 202
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 100 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 50 place count 97 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 53 place count 97 transition count 197
Applied a total of 53 rules in 9 ms. Remains 97 /126 variables (removed 29) and now considering 197/872 (removed 675) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9059842470943143742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16031214470309956170.kers'
[2026-05-27 04:06:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9059842470943143742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16031214470309956170.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 97 cols 1031 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-27 04:06:09] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16031214470309956170.kers
Total runtime 2 ms.
[2026-05-27 04:06:09] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-27 04:06:09] [INFO ] Invariant cache hit.
[2026-05-27 04:06:09] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 97/126 places, 197/872 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 97/126 places, 197/872 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-07 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Graph (trivial) has 92 edges and 126 vertex of which 6 / 126 are part of one of the 3 SCC in 1 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 122 transition count 852
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 106 transition count 852
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 106 transition count 841
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 95 transition count 841
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 63 place count 87 transition count 618
Iterating global reduction 2 with 8 rules applied. Total rules applied 71 place count 87 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 87 transition count 617
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 72 place count 87 transition count 616
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 74 place count 86 transition count 616
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 79 place count 81 transition count 194
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 81 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 79 transition count 190
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 79 transition count 190
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 150 place count 48 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 46 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 46 transition count 114
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 43 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 43 transition count 118
Applied a total of 165 rules in 99 ms. Remains 43 /126 variables (removed 83) and now considering 118/872 (removed 754) transitions.
[2026-05-27 04:06:10] [INFO ] Flow matrix only has 104 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2496160260183476766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16524864672183623625.kers'
[2026-05-27 04:06:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2496160260183476766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16524864672183623625.kers]
Normalized transition count is 103 out of 104 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 43 cols 930 entries
Finished phase 1 with 25 SingleSign rule and 2 generalized
[2026-05-27 04:06:10] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16524864672183623625.kers
Total runtime 2 ms.
[2026-05-27 04:06:10] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-27 04:06:10] [INFO ] Flow matrix only has 104 transitions (discarded 14 similar events)
[2026-05-27 04:06:10] [INFO ] Invariant cache hit.
[2026-05-27 04:06:10] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-27 04:06:10] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2026-05-27 04:06:10] [INFO ] Redundant transitions in 5 ms returned []
Running 116 sub problems to find dead transitions.
[2026-05-27 04:06:10] [INFO ] Flow matrix only has 104 transitions (discarded 14 similar events)
[2026-05-27 04:06:10] [INFO ] Invariant cache hit.
[2026-05-27 04:06:10] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 103/146 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 107 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7465 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 103/146 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 116/222 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 223 constraints, problems are : Problem set: 0 solved, 116 unsolved in 9319 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16912ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 16913ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/126 places, 118/872 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17303 ms. Remains : 43/126 places, 118/872 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 40 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-08 finished in 17373 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(p0))||(F(p1) U X(((p0 U p1) U !p2)))))'
Support contains 18 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 867
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 120 transition count 866
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 120 transition count 866
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 119 transition count 865
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 119 transition count 865
Applied a total of 14 rules in 13 ms. Remains 119 /126 variables (removed 7) and now considering 865/872 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5820762727619502545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13860038975057795562.kers'
[2026-05-27 04:06:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5820762727619502545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13860038975057795562.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 865 rows 119 cols 10176 entries
Finished phase 1 with 100 SingleSign rule and 3 generalized
[2026-05-27 04:06:27] [INFO ] Computed 16 invariants in 7 ms
Computed 16 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13860038975057795562.kers
Total runtime 9 ms.
[2026-05-27 04:06:27] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-27 04:06:27] [INFO ] Invariant cache hit.
[2026-05-27 04:06:28] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2026-05-27 04:06:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/984 variables, and 18 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/119 constraints, PredecessorRefiner: 864/120 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 6 (OVERLAPS) 865/984 variables, 119/138 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/984 variables, 120/258 constraints. Problems are: Problem set: 0 solved, 864 unsolved
SMT process timed out in 61656ms, After SMT, problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 61660ms
Starting structural reductions in LTL mode, iteration 1 : 119/126 places, 865/872 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62309 ms. Remains : 119/126 places, 865/872 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(p0))||(F(p1) U X(((p0 U p1) U !p2)))))'
Stuttering acceptance computed with spot in 443 ms :[(AND (NOT p0) p2), false, (AND (NOT p0) p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) p2), (NOT p1), (AND (NOT p1) p2), p2]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 17 ms. Proved property starting from automaton with 9 states, 13 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 36 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-09 finished in 63171 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&&F(p1)))||(p2 U p3))))'
Support contains 9 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 112 transition count 626
Ensure Unique test removed 5 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 33 place count 107 transition count 626
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 39 place count 101 transition count 203
Iterating global reduction 0 with 6 rules applied. Total rules applied 45 place count 101 transition count 203
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 48 place count 98 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 51 place count 98 transition count 198
Applied a total of 51 rules in 15 ms. Remains 98 /126 variables (removed 28) and now considering 198/872 (removed 674) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7669765062362345930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13754564387718638400.kers'
[2026-05-27 04:07:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7669765062362345930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13754564387718638400.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 98 cols 1033 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-27 04:07:30] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13754564387718638400.kers
Total runtime 4 ms.
[2026-05-27 04:07:30] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-27 04:07:30] [INFO ] Invariant cache hit.
[2026-05-27 04:07:30] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2026-05-27 04:07:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/296 variables, 98/111 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/296 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 111 constraints, problems are : Problem set: 0 solved, 197 unsolved in 15127 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/296 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 197/309 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/296 variables, and 316 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 45260ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 45261ms
Starting structural reductions in LTL mode, iteration 1 : 98/126 places, 198/872 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45587 ms. Remains : 98/126 places, 198/872 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&F(p1)))||(p2 U p3))))'
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-10
Product exploration explored 100000 steps with 798 reset in 237 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-10 finished in 46138 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(X((X(p0) U G(p1))))||(G(X(p0)) U p2)))))'
Support contains 9 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 112 transition count 626
Ensure Unique test removed 5 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 33 place count 107 transition count 626
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 38 place count 102 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 43 place count 102 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 45 place count 100 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 47 place count 100 transition count 200
Applied a total of 47 rules in 14 ms. Remains 100 /126 variables (removed 26) and now considering 200/872 (removed 672) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14506252954196952982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12057045346134628323.kers'
[2026-05-27 04:08:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14506252954196952982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12057045346134628323.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 100 cols 1037 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-27 04:08:16] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12057045346134628323.kers
Total runtime 4 ms.
[2026-05-27 04:08:16] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-27 04:08:16] [INFO ] Invariant cache hit.
[2026-05-27 04:08:17] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-05-27 04:08:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/300 variables, 100/113 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 113 constraints, problems are : Problem set: 0 solved, 199 unsolved in 15285 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/300 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 199/313 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/300 variables, and 319 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45418ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 45419ms
Starting structural reductions in LTL mode, iteration 1 : 100/126 places, 200/872 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45793 ms. Remains : 100/126 places, 200/872 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(X((X(p0) U G(p1))))||(G(X(p0)) U p2)))))'
Stuttering acceptance computed with spot in 511 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-12
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-12 finished in 46405 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 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Graph (trivial) has 82 edges and 126 vertex of which 4 / 126 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 123 transition count 854
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 108 transition count 854
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 108 transition count 843
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 97 transition count 843
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 67 place count 83 transition count 588
Ensure Unique test removed 5 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 86 place count 78 transition count 588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 78 transition count 587
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 78 transition count 586
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 89 place count 77 transition count 586
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 94 place count 72 transition count 164
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 72 transition count 164
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 71 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 71 transition count 162
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 159 place count 42 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 41 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 41 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 41 transition count 125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
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 166 place count 39 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 39 transition count 132
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 174 place count 39 transition count 132
Applied a total of 174 rules in 98 ms. Remains 39 /126 variables (removed 87) and now considering 132/872 (removed 740) transitions.
[2026-05-27 04:09:03] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7456117265700194826.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18119549723939151890.kers'
[2026-05-27 04:09:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7456117265700194826.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18119549723939151890.kers]
Normalized transition count is 116 out of 117 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 39 cols 1056 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-27 04:09:03] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18119549723939151890.kers
Total runtime 2 ms.
[2026-05-27 04:09:03] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-27 04:09:03] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
[2026-05-27 04:09:03] [INFO ] Invariant cache hit.
[2026-05-27 04:09:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-27 04:09:03] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2026-05-27 04:09:03] [INFO ] Redundant transitions in 7 ms returned []
Running 130 sub problems to find dead transitions.
[2026-05-27 04:09:03] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
[2026-05-27 04:09:03] [INFO ] Invariant cache hit.
[2026-05-27 04:09:03] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 116/155 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 42/92 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 1/156 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 93 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9521 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 39/39 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 116/155 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 42/92 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 130/222 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 223 constraints, problems are : Problem set: 0 solved, 130 unsolved in 16607 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 39/39 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26280ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 26281ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/126 places, 132/872 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26664 ms. Remains : 39/126 places, 132/872 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 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 343 ms.
Product exploration explored 100000 steps with 0 reset in 463 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 3 factoid took 47 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1780505 steps, run visited all 1 properties in 1804 ms. (steps per millisecond=986 )
Probabilistic random walk after 1780505 steps, saw 219936 distinct states, run finished after 1810 ms. (steps per millisecond=983 ) properties seen :1
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 2090 ms.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 39 /39 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2026-05-27 04:09:32] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
[2026-05-27 04:09:32] [INFO ] Invariant cache hit.
[2026-05-27 04:09:32] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-27 04:09:32] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
[2026-05-27 04:09:32] [INFO ] Invariant cache hit.
[2026-05-27 04:09:32] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-27 04:09:32] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2026-05-27 04:09:33] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 39/39 places, 132/132 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 3 factoid took 46 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1780505 steps, run visited all 1 properties in 1952 ms. (steps per millisecond=912 )
Probabilistic random walk after 1780505 steps, saw 219936 distinct states, run finished after 1952 ms. (steps per millisecond=912 ) properties seen :1
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 2201 ms.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Product exploration explored 100000 steps with 0 reset in 371 ms.
Built C files in :
/tmp/ltsmin5535095527787367639
[2026-05-27 04:09:35] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2026-05-27 04:09:35] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 04:09:35] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2026-05-27 04:09:35] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 04:09:36] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2026-05-27 04:09:36] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 04:09:36] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5535095527787367639
Running compilation step : cd /tmp/ltsmin5535095527787367639;'/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 743 ms.
Running link step : cd /tmp/ltsmin5535095527787367639;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5535095527787367639;'/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/stateBased1914904353267729093.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 132/132 transitions.
Applied a total of 0 rules in 14 ms. Remains 39 /39 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2026-05-27 04:09:50] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
[2026-05-27 04:09:50] [INFO ] Invariant cache hit.
[2026-05-27 04:09:51] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-27 04:09:51] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
[2026-05-27 04:09:51] [INFO ] Invariant cache hit.
[2026-05-27 04:09:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-27 04:09:51] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2026-05-27 04:09:51] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 39/39 places, 132/132 transitions.
Built C files in :
/tmp/ltsmin703215577523953082
[2026-05-27 04:09:51] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2026-05-27 04:09:51] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 04:09:51] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2026-05-27 04:09:51] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 04:09:51] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2026-05-27 04:09:51] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 04:09:51] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin703215577523953082
Running compilation step : cd /tmp/ltsmin703215577523953082;'/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 789 ms.
Running link step : cd /tmp/ltsmin703215577523953082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin703215577523953082;'/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/stateBased8335283063826022197.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 04:10:06] [INFO ] Flatten gal took : 14 ms
[2026-05-27 04:10:06] [INFO ] Flatten gal took : 13 ms
[2026-05-27 04:10:06] [INFO ] Time to serialize gal into /tmp/LTL1772372588037144569.gal : 3 ms
[2026-05-27 04:10:06] [INFO ] Time to serialize properties into /tmp/LTL2800440316354154264.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/LTL1772372588037144569.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7579388799710572261.hoa' '-atoms' '/tmp/LTL2800440316354154264.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...317
Loading property file /tmp/LTL2800440316354154264.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7579388799710572261.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
17 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.23324,18908,1,0,8,14540,24,0,2861,8338,28
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-13 finished in 63497 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 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Graph (trivial) has 83 edges and 126 vertex of which 4 / 126 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 123 transition count 853
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 107 transition count 853
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 107 transition count 843
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 97 transition count 843
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 66 place count 84 transition count 589
Ensure Unique test removed 5 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 84 place count 79 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 79 transition count 588
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 85 place count 79 transition count 587
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 87 place count 78 transition count 587
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 92 place count 73 transition count 165
Iterating global reduction 3 with 5 rules applied. Total rules applied 97 place count 73 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 72 transition count 163
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 72 transition count 163
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 159 place count 42 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 41 transition count 126
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 41 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 41 transition count 125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
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 166 place count 39 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 39 transition count 132
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 174 place count 39 transition count 132
Applied a total of 174 rules in 83 ms. Remains 39 /126 variables (removed 87) and now considering 132/872 (removed 740) transitions.
[2026-05-27 04:10:06] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17453729780112948522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1934844110995969648.kers'
[2026-05-27 04:10:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17453729780112948522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1934844110995969648.kers]
Normalized transition count is 116 out of 117 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 39 cols 1056 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-27 04:10:06] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1934844110995969648.kers
Total runtime 2 ms.
[2026-05-27 04:10:06] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-27 04:10:06] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
[2026-05-27 04:10:06] [INFO ] Invariant cache hit.
[2026-05-27 04:10:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-27 04:10:06] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2026-05-27 04:10:06] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/126 places, 132/872 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 279 ms. Remains : 39/126 places, 132/872 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 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-14 finished in 388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 872/872 transitions.
Graph (trivial) has 82 edges and 126 vertex of which 4 / 126 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 123 transition count 854
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 108 transition count 854
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 108 transition count 843
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 53 place count 97 transition count 843
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 67 place count 83 transition count 588
Ensure Unique test removed 5 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 86 place count 78 transition count 588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 78 transition count 587
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 78 transition count 586
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 89 place count 77 transition count 586
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 94 place count 72 transition count 164
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 72 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 70 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 70 transition count 160
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 161 place count 41 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 40 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 40 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 40 transition count 123
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 170 place count 37 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 172 place count 37 transition count 132
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 37 transition count 132
Applied a total of 174 rules in 88 ms. Remains 37 /126 variables (removed 89) and now considering 132/872 (removed 740) transitions.
[2026-05-27 04:10:07] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10029675045482842369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14591796655170720567.kers'
[2026-05-27 04:10:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10029675045482842369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14591796655170720567.kers]
Normalized transition count is 116 out of 117 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 37 cols 1068 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-27 04:10:07] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14591796655170720567.kers
Total runtime 2 ms.
[2026-05-27 04:10:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-27 04:10:07] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
[2026-05-27 04:10:07] [INFO ] Invariant cache hit.
[2026-05-27 04:10:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-27 04:10:07] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2026-05-27 04:10:07] [INFO ] Redundant transitions in 2 ms returned []
Running 130 sub problems to find dead transitions.
[2026-05-27 04:10:07] [INFO ] Flow matrix only has 117 transitions (discarded 15 similar events)
[2026-05-27 04:10:07] [INFO ] Invariant cache hit.
[2026-05-27 04:10:07] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 116/153 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 1/154 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 91 constraints, problems are : Problem set: 0 solved, 130 unsolved in 8703 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 37/37 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 116/153 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 130/220 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 1/154 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/154 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 221 constraints, problems are : Problem set: 0 solved, 130 unsolved in 14701 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 37/37 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23596ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 23597ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/126 places, 132/872 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23883 ms. Remains : 37/126 places, 132/872 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-15 finished in 23950 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))))))))'
Spot run failed in 57 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 04:10:31] [INFO ] Flatten gal took : 73 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13293693266483930626
[2026-05-27 04:10:31] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2026-05-27 04:10:31] [INFO ] Applying decomposition
[2026-05-27 04:10:31] [INFO ] Flatten gal took : 63 ms
[2026-05-27 04:10:31] [INFO ] Computation of Complete disable matrix. took 121 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 04:10:31] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2026-05-27 04:10:31] [INFO ] Computation of Complete enable matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph9631540989805544364.txt' '-o' '/tmp/graph9631540989805544364.bin' '-w' '/tmp/graph9631540989805544364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9631540989805544364.bin' '-l' '-1' '-v' '-w' '/tmp/graph9631540989805544364.weights' '-q' '0' '-e' '0.001'
[2026-05-27 04:10:31] [INFO ] Decomposing Gal with order
[2026-05-27 04:10:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 04:10:31] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2026-05-27 04:10:31] [INFO ] Computation of Completed DNA matrix. took 84 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 04:10:31] [INFO ] Built C files in 704ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13293693266483930626
Running compilation step : cd /tmp/ltsmin13293693266483930626;'/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'
[2026-05-27 04:10:31] [INFO ] Removed a total of 2320 redundant transitions.
[2026-05-27 04:10:31] [INFO ] Flatten gal took : 292 ms
[2026-05-27 04:10:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 466 labels/synchronizations in 44 ms.
[2026-05-27 04:10:31] [INFO ] Time to serialize gal into /tmp/LTLFireability16625848433265196864.gal : 12 ms
[2026-05-27 04:10:31] [INFO ] Time to serialize properties into /tmp/LTLFireability16064022896546805069.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/LTLFireability16625848433265196864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16064022896546805069.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...278
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(X(G("((((i5.u4.p16==0)||(i5.u6.p41==0))||((i5.u8.p50==0)||(i5.u11.p79==0)))||(((i5.u12.p88==0)||(i5.u32.p138==0))||(i5.u3...177
Formula 0 simplified : XXXXXXF!"((((i5.u4.p16==0)||(i5.u6.p41==0))||((i5.u8.p50==0)||(i5.u11.p79==0)))||(((i5.u12.p88==0)||(i5.u32.p138==0))||(i5.u33.p197=...161
Compilation finished in 6752 ms.
Running link step : cd /tmp/ltsmin13293693266483930626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin13293693266483930626;'/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(X(X(X(X(X([]((LTLAPp0==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t45, t60, t66, t73, t78, t79, t84, t602, t603, t606, t610, t612, t620, t623, t624, t...945
9 unique states visited
9 strongly connected components in search stack
9 transitions explored
9 items max in DFS search stack
6550 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,65.7203,1273192,1,0,532393,318730,4892,4.64696e+06,6289,1.59117e+07,752219
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 770477 ms.

BK_STOP 1779855111994

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

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