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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 26M
-rw-r--r-- 1 mcc users 6.5K Mar 7 04:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 04:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 7 04:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 04:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 04:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 7 04:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 7 04:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 7 04:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:57 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 25M 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-1201-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-1201-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779927059271

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-1201
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-28 00:11: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-28 00:11:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 00:11:03] [INFO ] Load time of PNML (sax parser for PT used): 1584 ms
[2026-05-28 00:11:03] [INFO ] Transformed 277 places.
[2026-05-28 00:11:03] [INFO ] Transformed 18712 transitions.
[2026-05-28 00:11:03] [INFO ] Found NUPN structural information;
[2026-05-28 00:11:03] [INFO ] Parsed PT model containing 277 places and 18712 transitions and 504563 arcs in 2052 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 18712/18712 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 211 transition count 18646
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 211 transition count 18646
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 170 place count 173 transition count 18608
Iterating global reduction 0 with 38 rules applied. Total rules applied 208 place count 173 transition count 18608
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 211 place count 170 transition count 18605
Iterating global reduction 0 with 3 rules applied. Total rules applied 214 place count 170 transition count 18605
Applied a total of 214 rules in 719 ms. Remains 170 /277 variables (removed 107) and now considering 18605/18712 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8288574266699288377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-283869911213292184.kers'
[2026-05-28 00:11:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8288574266699288377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-283869911213292184.kers]
Culled 0 columns in 83 ms.
// Phase 1: matrix 18605 rows 170 cols 504349 entries
Finished phase 1 with 137 SingleSign rule and 3 generalized
[2026-05-28 00:11:05] [INFO ] Computed 30 invariants in 336 ms
Computed 30 P flows in 372 ms.
Exported basis to /tmp/petrispot-output-283869911213292184.kers
Total runtime 438 ms.
[2026-05-28 00:11:05] [INFO ] Implicit Places using invariants in 1013 ms returned []
Implicit Place search using SMT only with invariants took 1069 ms to find 0 implicit places.
Running 18604 sub problems to find dead transitions.
[2026-05-28 00:11:06] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 169/18775 variables, and 12 constraints, problems are : Problem set: 0 solved, 18604 unsolved in 30747 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 18604/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 169/18775 variables, and 12 constraints, problems are : Problem set: 0 solved, 18604 unsolved in 30439 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 18483/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109816ms problems are : Problem set: 0 solved, 18604 unsolved
Search for dead transitions found 0 dead transitions in 110205ms
Starting structural reductions in LTL mode, iteration 1 : 170/277 places, 18605/18712 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112237 ms. Remains : 170/277 places, 18605/18712 transitions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Applied a total of 0 rules in 130 ms. Remains 170 /170 variables (removed 0) and now considering 18605/18605 (removed 0) transitions.
[2026-05-28 00:12:56] [INFO ] Invariant cache hit.
[2026-05-28 00:12:56] [INFO ] Implicit Places using invariants in 118 ms returned []
Implicit Place search using SMT only with invariants took 120 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 170/170 places, 18605/18605 transitions.
Support contains 54 out of 170 places after structural reductions.
[2026-05-28 00:13:00] [INFO ] Flatten gal took : 3490 ms
[2026-05-28 00:13:03] [INFO ] Flatten gal took : 3091 ms
[2026-05-28 00:13:09] [INFO ] Input system was already deterministic with 18605 transitions.
RANDOM walk for 40000 steps (8 resets) in 8443 ms. (4 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 236 ms. (16 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 286 ms. (13 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 144 ms. (27 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 309 ms. (12 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 50370 steps, run timeout after 6001 ms. (steps per millisecond=8 ) properties seen :0 out of 32
Probabilistic random walk after 50370 steps, saw 35059 distinct states, run finished after 6009 ms. (steps per millisecond=8 ) properties seen :0
[2026-05-28 00:13:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 2 (OVERLAPS) 79/133 variables, 14/26 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/18775 variables, and 26 constraints, problems are : Problem set: 1 solved, 31 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 32/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 79/133 variables, 14/26 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/18775 variables, and 26 constraints, problems are : Problem set: 1 solved, 31 unsolved in 5127 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 31/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10672ms problems are : Problem set: 1 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Graph (trivial) has 83 edges and 170 vertex of which 4 / 170 are part of one of the 2 SCC in 16 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 168 transition count 18588
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 155 transition count 18588
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 27 place count 155 transition count 18568
Deduced a syphon composed of 20 places in 23 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 67 place count 135 transition count 18568
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 133 transition count 18551
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 133 transition count 18551
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 133 transition count 18549
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 16 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 143 place count 98 transition count 18514
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 96 transition count 18527
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 96 transition count 18526
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 153 place count 96 transition count 18521
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 3 with 7 rules applied. Total rules applied 160 place count 91 transition count 18519
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 173 place count 91 transition count 18506
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 91 transition count 18506
Partial Post-agglomeration rule applied 12 times.
Drop transitions (Partial Post agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 187 place count 91 transition count 18506
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 199 place count 91 transition count 18494
Applied a total of 199 rules in 124944 ms. Remains 91 /170 variables (removed 79) and now considering 18494/18605 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124944 ms. Remains : 91/170 places, 18494/18605 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 24 stabilizing places and 24 stable transitions
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((G(p0) U (!(G(p1)||p0)||(X(G(p2)) U p3)))))'
Support contains 36 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 16557
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 16557
Applied a total of 2 rules in 308 ms. Remains 169 /170 variables (removed 1) and now considering 16557/18605 (removed 2048) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13791116498409658069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17757819779510147911.kers'
[2026-05-28 00:15:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13791116498409658069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17757819779510147911.kers]
Culled 0 columns in 77 ms.
// Phase 1: matrix 16557 rows 169 cols 451101 entries
Finished phase 1 with 137 SingleSign rule and 2 generalized
[2026-05-28 00:15:35] [INFO ] Computed 30 invariants in 305 ms
Computed 30 P flows in 319 ms.
Exported basis to /tmp/petrispot-output-17757819779510147911.kers
Total runtime 393 ms.
[2026-05-28 00:15:39] [INFO ] Implicit Places using invariants in 4570 ms returned []
Implicit Place search using SMT only with invariants took 4576 ms to find 0 implicit places.
Running 16556 sub problems to find dead transitions.
[2026-05-28 00:15:39] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 168/16726 variables, and 12 constraints, problems are : Problem set: 0 solved, 16556 unsolved in 30519 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/169 constraints, PredecessorRefiner: 16556/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16556 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16556 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 168/16726 variables, and 12 constraints, problems are : Problem set: 0 solved, 16556 unsolved in 30491 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/169 constraints, PredecessorRefiner: 16435/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 100123ms problems are : Problem set: 0 solved, 16556 unsolved
Search for dead transitions found 0 dead transitions in 100259ms
Starting structural reductions in LTL mode, iteration 1 : 169/170 places, 16557/18605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105255 ms. Remains : 169/170 places, 16557/18605 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((G(p0) U (!(G(p1)||p0)||(X(G(p2)) U p3)))))'
Stuttering acceptance computed with spot in 767 ms :[(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (NOT p3) (AND (NOT p0) (NOT p2))), p1, (AND p1 (NOT p2)), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-1201-LTLFireability-00
Product exploration timeout after 83740 steps with 0 reset in 10002 ms.
Product exploration timeout after 90080 steps with 0 reset in 10001 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge based reduction with 32 factoid took 287 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 10 states, 27 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 7031 ms. (5 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 61687 steps, run timeout after 6001 ms. (steps per millisecond=10 ) properties seen :0 out of 19
Probabilistic random walk after 61687 steps, saw 42516 distinct states, run finished after 6001 ms. (steps per millisecond=10 ) properties seen :0
[2026-05-28 00:17:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf14 is UNSAT
Problem apf17 is UNSAT
At refinement iteration 1 (OVERLAPS) 85/121 variables, 14/14 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/15 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 37/158 variables, 4/19 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 11/169 variables, 11/30 constraints. Problems are: Problem set: 7 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/30 constraints. Problems are: Problem set: 7 solved, 12 unsolved
SMT process timed out in 5182ms, After SMT, problems are : Problem set: 7 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 36 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 16557/16557 transitions.
Graph (trivial) has 88 edges and 169 vertex of which 4 / 169 are part of one of the 2 SCC in 2 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 167 transition count 16540
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 154 transition count 16540
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 27 place count 154 transition count 16519
Deduced a syphon composed of 21 places in 40 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 69 place count 133 transition count 16519
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 131 transition count 16502
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 131 transition count 16502
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 131 transition count 16500
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 151 place count 93 transition count 16462
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 91 transition count 16475
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 91 transition count 16474
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 162 place count 91 transition count 16468
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 170 place count 85 transition count 16466
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 186 place count 85 transition count 16450
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 187 place count 85 transition count 16450
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 196 place count 85 transition count 16450
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 205 place count 85 transition count 16441
Applied a total of 205 rules in 109041 ms. Remains 85 /169 variables (removed 84) and now considering 16441/16557 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109041 ms. Remains : 85/169 places, 16441/16557 transitions.
Found 7 invariant AP formulas.
Knowledge based reduction with 39 factoid took 195 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), p1, (OR (NOT p0) (NOT p3)), true, (NOT p0)]
Knowledge-based reduction took 123739 ms.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), p1, (OR (NOT p0) (NOT p3)), true, (NOT p0)]
Support contains 32 out of 169 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 16557/16557 transitions.
Graph (trivial) has 88 edges and 169 vertex of which 4 / 169 are part of one of the 2 SCC in 2 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 166 transition count 16542
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 154 transition count 16542
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 25 place count 154 transition count 16522
Deduced a syphon composed of 20 places in 17 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 65 place count 134 transition count 16522
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 132 transition count 16505
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 132 transition count 16505
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 132 transition count 16503
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 6 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 149 place count 93 transition count 16464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 92 transition count 16475
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 161 place count 92 transition count 16475
Applied a total of 161 rules in 33587 ms. Remains 92 /169 variables (removed 77) and now considering 16475/16557 (removed 82) transitions.
[2026-05-28 00:20:18] [INFO ] Flow matrix only has 16457 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15104792463448503065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15727161940709347523.kers'
[2026-05-28 00:20:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15104792463448503065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15727161940709347523.kers]
Normalized transition count is 16456 out of 16457 initially.
Culled 0 columns in 71 ms.
// Phase 1: matrix 16456 rows 92 cols 438574 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-28 00:20:18] [INFO ] Computed 30 invariants in 258 ms
Computed 30 P flows in 259 ms.
Exported basis to /tmp/petrispot-output-15727161940709347523.kers
Total runtime 314 ms.
[2026-05-28 00:20:24] [INFO ] Implicit Places using invariants in 5659 ms returned []
Implicit Place search using SMT only with invariants took 5661 ms to find 0 implicit places.
Running 16473 sub problems to find dead transitions.
[2026-05-28 00:20:24] [INFO ] Flow matrix only has 16457 transitions (discarded 18 similar events)
[2026-05-28 00:20:24] [INFO ] Invariant cache hit.
[2026-05-28 00:20:24] [INFO ] State equation strengthened by 6155 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 91/16549 variables, and 12 constraints, problems are : Problem set: 0 solved, 16473 unsolved in 30314 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/92 constraints, ReadFeed: 0/6155 constraints, PredecessorRefiner: 16473/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16473 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 91/16549 variables, and 12 constraints, problems are : Problem set: 0 solved, 16473 unsolved in 30463 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/92 constraints, ReadFeed: 0/6155 constraints, PredecessorRefiner: 16435/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 99211ms problems are : Problem set: 0 solved, 16473 unsolved
Search for dead transitions found 0 dead transitions in 99328ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/169 places, 16475/16557 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138646 ms. Remains : 92/169 places, 16475/16557 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 11 factoid took 60 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 5 states, 10 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 10529 ms. (3 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 937 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 841 ms. (47 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 599 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 656 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 672 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 948 ms. (42 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 183736 steps, run timeout after 12001 ms. (steps per millisecond=15 ) properties seen :0 out of 6
Probabilistic random walk after 183736 steps, saw 25407 distinct states, run finished after 12001 ms. (steps per millisecond=15 ) properties seen :0
[2026-05-28 00:22:20] [INFO ] Flow matrix only has 16457 transitions (discarded 18 similar events)
[2026-05-28 00:22:20] [INFO ] Invariant cache hit.
[2026-05-28 00:22:20] [INFO ] State equation strengthened by 6155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/69 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 12/81 variables, 4/19 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 11/92 variables, 11/30 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 16548/16549 variables, and 122 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 92/92 constraints, ReadFeed: 0/6155 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 37/69 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 12/81 variables, 4/19 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 11/92 variables, 11/30 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SMT process timed out in 10225ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 16475/16475 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 16473
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 92 transition count 16471
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 90 transition count 16471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 89 transition count 12375
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 89 transition count 12375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 88 transition count 12378
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 88 transition count 12376
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 88 transition count 12368
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 30 place count 80 transition count 12366
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 56 place count 80 transition count 12340
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 80 transition count 12340
Applied a total of 57 rules in 53707 ms. Remains 80 /92 variables (removed 12) and now considering 12340/16475 (removed 4135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53708 ms. Remains : 80/92 places, 12340/16475 transitions.
RANDOM walk for 40000 steps (8 resets) in 8645 ms. (4 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1714 ms. (23 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 693 ms. (57 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 645 ms. (61 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11372318116969457061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10700264111840109732.kers'
[2026-05-28 00:23:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11372318116969457061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10700264111840109732.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 93 ms.
// Phase 1: matrix 12340 rows 79 cols 327866 entries
Finished phase 1 with 48 SingleSign rule and 2 generalized
[2026-05-28 00:23:27] [INFO ] Computed 30 invariants in 314 ms
Computed 30 P flows in 315 ms.
Exported basis to /tmp/petrispot-output-10700264111840109732.kers
Total runtime 385 ms.
[2026-05-28 00:23:27] [INFO ] State equation strengthened by 4121 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/46 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/53 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/80 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12340/12420 variables, 80/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12420 variables, 4121/4231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/12420 variables, 0/4231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/12420 variables, 0/4231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12420/12420 variables, and 4231 constraints, problems are : Problem set: 0 solved, 3 unsolved in 15577 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 4121/4121 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/46 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/53 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/80 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12340/12420 variables, 80/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12420 variables, 4121/4231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12420 variables, 0/4231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/12420 variables, 0/4231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12420/12420 variables, and 4231 constraints, problems are : Problem set: 0 solved, 3 unsolved in 19596 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 80/80 constraints, ReadFeed: 4121/4121 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35796ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 2206 ms.
Support contains 27 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 12340/12340 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 80 transition count 12339
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 79 transition count 12339
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 79 transition count 12335
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 75 transition count 12335
Applied a total of 10 rules in 24142 ms. Remains 75 /80 variables (removed 5) and now considering 12335/12340 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24142 ms. Remains : 75/80 places, 12335/12340 transitions.
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 99 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR p0 (AND p1 (NOT p3))), p1, true]
Knowledge-based reduction took 146025 ms.
Stuttering acceptance computed with spot in 88 ms :[(OR p0 (AND p1 (NOT p3))), p1, true]
Stuttering acceptance computed with spot in 89 ms :[(OR p0 (AND p1 (NOT p3))), p1, true]
Product exploration timeout after 52040 steps with 0 reset in 10001 ms.
Product exploration timeout after 53760 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin5233784456946973030
[2026-05-28 00:24:49] [INFO ] Too many transitions (16475) to apply POR reductions. Disabling POR matrices.
[2026-05-28 00:24:50] [INFO ] Built C files in 577ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5233784456946973030
Running compilation step : cd /tmp/ltsmin5233784456946973030;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5233784456946973030;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5233784456946973030;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 32 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 16475/16475 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 92 transition count 16473
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 90 transition count 16473
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 89 transition count 12377
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 89 transition count 12377
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 89 transition count 12376
Applied a total of 7 rules in 19195 ms. Remains 89 /92 variables (removed 3) and now considering 12376/16475 (removed 4099) transitions.
[2026-05-28 00:25:12] [INFO ] Flow matrix only has 12358 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12703357885483863485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10313094423903846480.kers'
[2026-05-28 00:25:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12703357885483863485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10313094423903846480.kers]
Normalized transition count is 12357 out of 12358 initially.
Culled 0 columns in 60 ms.
// Phase 1: matrix 12357 rows 89 cols 327972 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-28 00:25:12] [INFO ] Computed 30 invariants in 219 ms
Computed 30 P flows in 219 ms.
Exported basis to /tmp/petrispot-output-10313094423903846480.kers
Total runtime 259 ms.
[2026-05-28 00:25:16] [INFO ] Implicit Places using invariants in 4182 ms returned []
Implicit Place search using SMT only with invariants took 4195 ms to find 0 implicit places.
Running 12374 sub problems to find dead transitions.
[2026-05-28 00:25:16] [INFO ] Flow matrix only has 12358 transitions (discarded 18 similar events)
[2026-05-28 00:25:16] [INFO ] Invariant cache hit.
[2026-05-28 00:25:17] [INFO ] State equation strengthened by 4107 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 88/12447 variables, and 12 constraints, problems are : Problem set: 0 solved, 12374 unsolved in 30361 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/89 constraints, ReadFeed: 0/4107 constraints, PredecessorRefiner: 12374/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12374 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 88/12447 variables, and 12 constraints, problems are : Problem set: 0 solved, 12374 unsolved in 30214 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/89 constraints, ReadFeed: 0/4107 constraints, PredecessorRefiner: 12338/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 87636ms problems are : Problem set: 0 solved, 12374 unsolved
Search for dead transitions found 0 dead transitions in 87704ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/92 places, 12376/16475 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111139 ms. Remains : 89/92 places, 12376/16475 transitions.
Built C files in :
/tmp/ltsmin18402100575280690904
[2026-05-28 00:26:44] [INFO ] Too many transitions (12376) to apply POR reductions. Disabling POR matrices.
[2026-05-28 00:26:44] [INFO ] Built C files in 356ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18402100575280690904
Running compilation step : cd /tmp/ltsmin18402100575280690904;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18402100575280690904;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18402100575280690904;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-28 00:26:53] [INFO ] Flatten gal took : 2487 ms
[2026-05-28 00:26:54] [INFO ] Flatten gal took : 1784 ms
[2026-05-28 00:26:55] [INFO ] Time to serialize gal into /tmp/LTL13112281175455264489.gal : 398 ms
[2026-05-28 00:26:55] [INFO ] Time to serialize properties into /tmp/LTL13050524318334320171.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/LTL13112281175455264489.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2309900379826132685.hoa' '-atoms' '/tmp/LTL13050524318334320171.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13050524318334320171.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2309900379826132685.hoa
Detected timeout of ITS tools.
[2026-05-28 00:27:15] [INFO ] Flatten gal took : 3264 ms
[2026-05-28 00:27:18] [INFO ] Flatten gal took : 2941 ms
[2026-05-28 00:27:18] [INFO ] Time to serialize gal into /tmp/LTL5260659924250781772.gal : 530 ms
[2026-05-28 00:27:18] [INFO ] Time to serialize properties into /tmp/LTL13637810939029868013.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5260659924250781772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13637810939029868013.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
Detected timeout of ITS tools.
[2026-05-28 00:27:36] [INFO ] Flatten gal took : 2902 ms
[2026-05-28 00:27:36] [INFO ] Applying decomposition
[2026-05-28 00:27:39] [INFO ] Flatten gal took : 2876 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/graph4540231028640753844.txt' '-o' '/tmp/graph4540231028640753844.bin' '-w' '/tmp/graph4540231028640753844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4540231028640753844.bin' '-l' '-1' '-v' '-w' '/tmp/graph4540231028640753844.weights' '-q' '0' '-e' '0.001'
[2026-05-28 00:27:47] [INFO ] Decomposing Gal with order
[2026-05-28 00:27:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 00:27:54] [INFO ] Removed a total of 247849 redundant transitions.
[2026-05-28 00:27:55] [INFO ] Flatten gal took : 5151 ms
[2026-05-28 00:28:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 3872 ms.
[2026-05-28 00:28:00] [INFO ] Time to serialize gal into /tmp/LTL1225198093850589079.gal : 166 ms
[2026-05-28 00:28:00] [INFO ] Time to serialize properties into /tmp/LTL16002283204766147798.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/LTL1225198093850589079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16002283204766147798.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((G("(((((i0.u0.p18==1)&&(i0.u2.p31==1))&&((i0.u5.p48==1)&&(i3.u7.p61==1)))&&(((i0.u8.p70==1)&&(i3.u10.p83==1))&&((i0.u12.p96==1)&...1358
Formula 0 simplified : F(F!"(((((i0.u0.p18==1)&&(i0.u2.p31==1))&&((i0.u5.p48==1)&&(i3.u7.p61==1)))&&(((i0.u8.p70==1)&&(i3.u10.p83==1))&&((i0.u12.p96==1)&&(...1614
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1201-LTLFireability-00 finished in 760590 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(G((p0||X(X((p1||G(p2))))))))))'
Support contains 31 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Applied a total of 0 rules in 114 ms. Remains 170 /170 variables (removed 0) and now considering 18605/18605 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16607988981768958994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12344980312798664363.kers'
[2026-05-28 00:28:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16607988981768958994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12344980312798664363.kers]
Culled 0 columns in 148 ms.
// Phase 1: matrix 18605 rows 170 cols 504349 entries
Finished phase 1 with 137 SingleSign rule and 3 generalized
[2026-05-28 00:28:16] [INFO ] Computed 30 invariants in 523 ms
Computed 30 P flows in 523 ms.
Exported basis to /tmp/petrispot-output-12344980312798664363.kers
Total runtime 587 ms.
[2026-05-28 00:28:22] [INFO ] Implicit Places using invariants in 7173 ms returned []
Implicit Place search using SMT only with invariants took 7179 ms to find 0 implicit places.
Running 18604 sub problems to find dead transitions.
[2026-05-28 00:28:22] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 169/18775 variables, and 12 constraints, problems are : Problem set: 0 solved, 18604 unsolved in 30311 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 18604/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 169/18775 variables, and 12 constraints, problems are : Problem set: 0 solved, 18604 unsolved in 30327 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 18483/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106221ms problems are : Problem set: 0 solved, 18604 unsolved
Search for dead transitions found 0 dead transitions in 106329ms
Finished structural reductions in LTL mode , in 1 iterations and 113661 ms. Remains : 170/170 places, 18605/18605 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(G((X(X((p0||G(p1))))||p2))))))'
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1201-LTLFireability-01
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1201-LTLFireability-01 finished in 114064 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) U X(p1))&&(!p1 U (G(!p1)||(!p1&&G(!p2))))))'
Support contains 22 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Applied a total of 0 rules in 162 ms. Remains 170 /170 variables (removed 0) and now considering 18605/18605 (removed 0) transitions.
[2026-05-28 00:30:09] [INFO ] Invariant cache hit.
[2026-05-28 00:30:23] [INFO ] Implicit Places using invariants in 14094 ms returned []
Implicit Place search using SMT only with invariants took 14095 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 14260 ms. Remains : 170/170 places, 18605/18605 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) U X(p1))&&(!p1 U (G(!p1)||(!p1&&G(!p2))))))'
Stuttering acceptance computed with spot in 412 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) (NOT p0) p2), (OR (NOT p1) p2), p2, (OR (NOT p0) p2), true, true]
Running random walk in product with property : ErlangenMainframeV0-PT-1201-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1201-LTLFireability-02 finished in 14811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((p0 U p1))&&F(p2)) U X((G(p1)||p3))))'
Support contains 35 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Applied a total of 0 rules in 176 ms. Remains 170 /170 variables (removed 0) and now considering 18605/18605 (removed 0) transitions.
[2026-05-28 00:30:24] [INFO ] Invariant cache hit.
[2026-05-28 00:30:33] [INFO ] Implicit Places using invariants in 9481 ms returned []
Implicit Place search using SMT only with invariants took 9482 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 9659 ms. Remains : 170/170 places, 18605/18605 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))&&F(p2)) U X((G(p1)||p3))))'
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), true, (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1201-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1201-LTLFireability-04 finished in 10010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 21 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Graph (trivial) has 112 edges and 170 vertex of which 6 / 170 are part of one of the 3 SCC in 2 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 166 transition count 18589
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 154 transition count 18589
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 25 place count 154 transition count 18568
Deduced a syphon composed of 21 places in 17 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 67 place count 133 transition count 18568
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 129 transition count 10355
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 129 transition count 10355
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 129 transition count 10352
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 128 transition count 8304
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 128 transition count 8304
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 127 transition count 8302
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 127 transition count 8302
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 176 place count 80 transition count 8255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 180 place count 78 transition count 8262
Applied a total of 180 rules in 11164 ms. Remains 78 /170 variables (removed 92) and now considering 8262/18605 (removed 10343) transitions.
[2026-05-28 00:30:45] [INFO ] Flow matrix only has 8245 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11797269623981093592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14349041317957325298.kers'
[2026-05-28 00:30:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11797269623981093592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14349041317957325298.kers]
Normalized transition count is 8244 out of 8245 initially.
Culled 0 columns in 35 ms.
// Phase 1: matrix 8244 rows 78 cols 213200 entries
Finished phase 1 with 46 SingleSign rule and 2 generalized
[2026-05-28 00:30:45] [INFO ] Computed 30 invariants in 124 ms
Computed 30 P flows in 125 ms.
Exported basis to /tmp/petrispot-output-14349041317957325298.kers
Total runtime 152 ms.
[2026-05-28 00:30:51] [INFO ] Implicit Places using invariants in 6404 ms returned []
[2026-05-28 00:30:51] [INFO ] Flow matrix only has 8245 transitions (discarded 17 similar events)
[2026-05-28 00:30:51] [INFO ] Invariant cache hit.
[2026-05-28 00:30:56] [INFO ] State equation strengthened by 4118 read => feed constraints.
[2026-05-28 00:31:07] [INFO ] Implicit Places using invariants and state equation in 16212 ms returned []
Implicit Place search using SMT with State Equation took 22621 ms to find 0 implicit places.
[2026-05-28 00:31:10] [INFO ] Redundant transitions in 2529 ms returned []
Running 8260 sub problems to find dead transitions.
[2026-05-28 00:31:10] [INFO ] Flow matrix only has 8245 transitions (discarded 17 similar events)
[2026-05-28 00:31:10] [INFO ] Invariant cache hit.
[2026-05-28 00:31:10] [INFO ] State equation strengthened by 4118 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 8260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77/8323 variables, and 12 constraints, problems are : Problem set: 0 solved, 8260 unsolved in 30236 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/78 constraints, ReadFeed: 0/4118 constraints, PredecessorRefiner: 8260/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 8260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 77/8323 variables, and 12 constraints, problems are : Problem set: 0 solved, 8260 unsolved in 30153 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/78 constraints, ReadFeed: 0/4118 constraints, PredecessorRefiner: 8233/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75377ms problems are : Problem set: 0 solved, 8260 unsolved
Search for dead transitions found 0 dead transitions in 75427ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/170 places, 8262/18605 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111773 ms. Remains : 78/170 places, 8262/18605 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1201-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1201-LTLFireability-05 finished in 111970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0 U (G(!p0)||(!p0&&(!p1 U (p2||G(!p1))))))))))'
Support contains 32 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Applied a total of 0 rules in 137 ms. Remains 170 /170 variables (removed 0) and now considering 18605/18605 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15819483337735508957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12261099201072539123.kers'
[2026-05-28 00:32:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15819483337735508957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12261099201072539123.kers]
Culled 0 columns in 147 ms.
// Phase 1: matrix 18605 rows 170 cols 504349 entries
Finished phase 1 with 137 SingleSign rule and 3 generalized
[2026-05-28 00:32:26] [INFO ] Computed 30 invariants in 553 ms
Computed 30 P flows in 553 ms.
Exported basis to /tmp/petrispot-output-12261099201072539123.kers
Total runtime 628 ms.
[2026-05-28 00:32:34] [INFO ] Implicit Places using invariants in 8094 ms returned []
Implicit Place search using SMT only with invariants took 8096 ms to find 0 implicit places.
Running 18604 sub problems to find dead transitions.
[2026-05-28 00:32:34] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 169/18775 variables, and 12 constraints, problems are : Problem set: 0 solved, 18604 unsolved in 30469 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 18604/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 18604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 169/18775 variables, and 12 constraints, problems are : Problem set: 0 solved, 18604 unsolved in 30481 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 18483/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105902ms problems are : Problem set: 0 solved, 18604 unsolved
Search for dead transitions found 0 dead transitions in 105981ms
Finished structural reductions in LTL mode , in 1 iterations and 114252 ms. Remains : 170/170 places, 18605/18605 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0 U (G(!p0)||(!p0&&(!p1 U (p2||G(!p1))))))))))'
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0, (AND (NOT p2) p1 p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1201-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 1411 ms.
Product exploration explored 100000 steps with 33333 reset in 1420 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 15 ms. Proved property starting from automaton with 4 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 438 ms.
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1201-LTLFireability-06 finished in 117771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 13 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 169 transition count 16557
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 16557
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 168 transition count 12461
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 168 transition count 12461
Applied a total of 4 rules in 516 ms. Remains 168 /170 variables (removed 2) and now considering 12461/18605 (removed 6144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5039575147277791003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1566789425311595717.kers'
[2026-05-28 00:34:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5039575147277791003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1566789425311595717.kers]
Culled 0 columns in 59 ms.
// Phase 1: matrix 12461 rows 168 cols 336413 entries
Finished phase 1 with 136 SingleSign rule and 2 generalized
[2026-05-28 00:34:24] [INFO ] Computed 30 invariants in 264 ms
Computed 30 P flows in 265 ms.
Exported basis to /tmp/petrispot-output-1566789425311595717.kers
Total runtime 312 ms.
[2026-05-28 00:34:33] [INFO ] Implicit Places using invariants in 9383 ms returned []
Implicit Place search using SMT only with invariants took 9385 ms to find 0 implicit places.
Running 12460 sub problems to find dead transitions.
[2026-05-28 00:34:33] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 167/12629 variables, and 12 constraints, problems are : Problem set: 0 solved, 12460 unsolved in 30348 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 12460/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 167/12629 variables, and 12 constraints, problems are : Problem set: 0 solved, 12460 unsolved in 30296 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 12339/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 87503ms problems are : Problem set: 0 solved, 12460 unsolved
Search for dead transitions found 0 dead transitions in 87556ms
Starting structural reductions in LTL mode, iteration 1 : 168/170 places, 12461/18605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97483 ms. Remains : 168/170 places, 12461/18605 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1201-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 7913 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1201-LTLFireability-08 finished in 105587 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 14 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Graph (trivial) has 97 edges and 170 vertex of which 4 / 170 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 167 transition count 18590
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 155 transition count 18590
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 25 place count 155 transition count 18570
Deduced a syphon composed of 20 places in 21 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 65 place count 135 transition count 18570
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 80 place count 120 transition count 12410
Ensure Unique test removed 12 places
Iterating global reduction 2 with 27 rules applied. Total rules applied 107 place count 108 transition count 12410
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 108 transition count 12408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 107 transition count 8312
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 107 transition count 8312
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 106 transition count 8310
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 106 transition count 8310
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 3 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 199 place count 63 transition count 8267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 61 transition count 8278
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 208 place count 61 transition count 8278
Applied a total of 208 rules in 6422 ms. Remains 61 /170 variables (removed 109) and now considering 8278/18605 (removed 10327) transitions.
[2026-05-28 00:36:15] [INFO ] Flow matrix only has 8260 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7249642077982947858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-747201350733133904.kers'
[2026-05-28 00:36:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7249642077982947858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-747201350733133904.kers]
Normalized transition count is 8259 out of 8260 initially.
Culled 0 columns in 44 ms.
// Phase 1: matrix 8259 rows 61 cols 221476 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-28 00:36:16] [INFO ] Computed 18 invariants in 136 ms
Computed 18 P flows in 136 ms.
Exported basis to /tmp/petrispot-output-747201350733133904.kers
Total runtime 172 ms.
[2026-05-28 00:36:19] [INFO ] Implicit Places using invariants in 3992 ms returned []
[2026-05-28 00:36:19] [INFO ] Flow matrix only has 8260 transitions (discarded 18 similar events)
[2026-05-28 00:36:19] [INFO ] Invariant cache hit.
[2026-05-28 00:36:23] [INFO ] State equation strengthened by 4107 read => feed constraints.
[2026-05-28 00:36:27] [INFO ] Implicit Places using invariants and state equation in 8053 ms returned []
Implicit Place search using SMT with State Equation took 12047 ms to find 0 implicit places.
[2026-05-28 00:36:30] [INFO ] Redundant transitions in 2539 ms returned []
Running 8276 sub problems to find dead transitions.
[2026-05-28 00:36:30] [INFO ] Flow matrix only has 8260 transitions (discarded 18 similar events)
[2026-05-28 00:36:30] [INFO ] Invariant cache hit.
[2026-05-28 00:36:30] [INFO ] State equation strengthened by 4107 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 60/8321 variables, and 0 constraints, problems are : Problem set: 0 solved, 8276 unsolved in 30231 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/61 constraints, ReadFeed: 0/4107 constraints, PredecessorRefiner: 8276/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8276 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 60/8321 variables, and 0 constraints, problems are : Problem set: 0 solved, 8276 unsolved in 30243 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/61 constraints, ReadFeed: 0/4107 constraints, PredecessorRefiner: 8243/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75189ms problems are : Problem set: 0 solved, 8276 unsolved
Search for dead transitions found 0 dead transitions in 75223ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/170 places, 8278/18605 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96257 ms. Remains : 61/170 places, 8278/18605 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 59 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1201-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1201-LTLFireability-11 finished in 96391 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' '!(((p0||((p1 U G(p2)) U p3)) U X(p0)))'
Support contains 22 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 157 transition count 12462
Ensure Unique test removed 12 places
Iterating global reduction 0 with 25 rules applied. Total rules applied 38 place count 145 transition count 12462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 144 transition count 8366
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 144 transition count 8366
Applied a total of 40 rules in 1263 ms. Remains 144 /170 variables (removed 26) and now considering 8366/18605 (removed 10239) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-291556137357825718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1699011069110790507.kers'
[2026-05-28 00:37:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-291556137357825718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1699011069110790507.kers]
Culled 0 columns in 21 ms.
// Phase 1: matrix 8366 rows 144 cols 131627 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-05-28 00:37:47] [INFO ] Computed 18 invariants in 94 ms
Computed 18 P flows in 96 ms.
Exported basis to /tmp/petrispot-output-1699011069110790507.kers
Total runtime 112 ms.
[2026-05-28 00:37:49] [INFO ] Implicit Places using invariants in 1929 ms returned []
[2026-05-28 00:37:49] [INFO ] Invariant cache hit.
[2026-05-28 00:37:54] [INFO ] Implicit Places using invariants and state equation in 5170 ms returned []
Implicit Place search using SMT with State Equation took 7110 ms to find 0 implicit places.
Running 8365 sub problems to find dead transitions.
[2026-05-28 00:37:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 143/8510 variables, and 0 constraints, problems are : Problem set: 0 solved, 8365 unsolved in 30238 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/144 constraints, PredecessorRefiner: 8365/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 143/8510 variables, and 0 constraints, problems are : Problem set: 0 solved, 8365 unsolved in 30244 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/144 constraints, PredecessorRefiner: 8231/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77862ms problems are : Problem set: 0 solved, 8365 unsolved
Search for dead transitions found 0 dead transitions in 77898ms
Starting structural reductions in LTL mode, iteration 1 : 144/170 places, 8366/18605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86287 ms. Remains : 144/170 places, 8366/18605 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' '!(((((p0 U G(p1)) U p2)||p3) U X(p3)))'
Stuttering acceptance computed with spot in 540 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) (NOT p3))), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-1201-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1201-LTLFireability-12 finished in 86946 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 13 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Graph (trivial) has 112 edges and 170 vertex of which 6 / 170 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 166 transition count 18589
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 154 transition count 18589
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 25 place count 154 transition count 18568
Deduced a syphon composed of 21 places in 20 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 67 place count 133 transition count 18568
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 129 transition count 10355
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 129 transition count 10355
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 129 transition count 10352
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 128 transition count 8304
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 128 transition count 8304
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 178 place count 79 transition count 8255
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 78 transition count 8262
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 78 transition count 8261
Applied a total of 181 rules in 22615 ms. Remains 78 /170 variables (removed 92) and now considering 8261/18605 (removed 10344) transitions.
[2026-05-28 00:39:35] [INFO ] Flow matrix only has 8244 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8813356625539411048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14599337492197632025.kers'
[2026-05-28 00:39:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8813356625539411048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14599337492197632025.kers]
Normalized transition count is 8243 out of 8244 initially.
Culled 0 columns in 35 ms.
// Phase 1: matrix 8243 rows 78 cols 213196 entries
Finished phase 1 with 46 SingleSign rule and 2 generalized
[2026-05-28 00:39:35] [INFO ] Computed 30 invariants in 130 ms
Computed 30 P flows in 131 ms.
Exported basis to /tmp/petrispot-output-14599337492197632025.kers
Total runtime 161 ms.
[2026-05-28 00:39:42] [INFO ] Implicit Places using invariants in 7147 ms returned []
[2026-05-28 00:39:42] [INFO ] Flow matrix only has 8244 transitions (discarded 17 similar events)
[2026-05-28 00:39:42] [INFO ] Invariant cache hit.
[2026-05-28 00:39:46] [INFO ] State equation strengthened by 4117 read => feed constraints.
[2026-05-28 00:40:01] [INFO ] Implicit Places using invariants and state equation in 18655 ms returned []
Implicit Place search using SMT with State Equation took 25804 ms to find 0 implicit places.
[2026-05-28 00:40:03] [INFO ] Redundant transitions in 2024 ms returned []
Running 8259 sub problems to find dead transitions.
[2026-05-28 00:40:03] [INFO ] Flow matrix only has 8244 transitions (discarded 17 similar events)
[2026-05-28 00:40:03] [INFO ] Invariant cache hit.
[2026-05-28 00:40:03] [INFO ] State equation strengthened by 4117 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 8259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77/8322 variables, and 12 constraints, problems are : Problem set: 0 solved, 8259 unsolved in 30191 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/78 constraints, ReadFeed: 0/4117 constraints, PredecessorRefiner: 8259/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 8259 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 77/8322 variables, and 12 constraints, problems are : Problem set: 0 solved, 8259 unsolved in 30142 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/78 constraints, ReadFeed: 0/4117 constraints, PredecessorRefiner: 8232/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74921ms problems are : Problem set: 0 solved, 8259 unsolved
Search for dead transitions found 0 dead transitions in 74954ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/170 places, 8261/18605 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125421 ms. Remains : 78/170 places, 8261/18605 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 35 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1201-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1201-LTLFireability-14 finished in 125515 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(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 34 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 18605/18605 transitions.
Graph (trivial) has 90 edges and 170 vertex of which 4 / 170 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 167 transition count 18590
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 155 transition count 18590
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 25 place count 155 transition count 18570
Deduced a syphon composed of 20 places in 18 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 65 place count 135 transition count 18570
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 132 transition count 16505
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 132 transition count 16505
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 132 transition count 16503
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 149 place count 94 transition count 16465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 93 transition count 16476
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 162 place count 93 transition count 16476
Applied a total of 162 rules in 30864 ms. Remains 93 /170 variables (removed 77) and now considering 16476/18605 (removed 2129) transitions.
[2026-05-28 00:41:49] [INFO ] Flow matrix only has 16458 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4939591132606393549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7002327356370808586.kers'
[2026-05-28 00:41:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4939591132606393549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7002327356370808586.kers]
Normalized transition count is 16457 out of 16458 initially.
Culled 0 columns in 71 ms.
// Phase 1: matrix 16457 rows 93 cols 438576 entries
Finished phase 1 with 61 SingleSign rule and 2 generalized
[2026-05-28 00:41:49] [INFO ] Computed 30 invariants in 261 ms
Computed 30 P flows in 262 ms.
Exported basis to /tmp/petrispot-output-7002327356370808586.kers
Total runtime 328 ms.
[2026-05-28 00:41:54] [INFO ] Implicit Places using invariants in 5318 ms returned []
Implicit Place search using SMT only with invariants took 5320 ms to find 0 implicit places.
Running 16474 sub problems to find dead transitions.
[2026-05-28 00:41:54] [INFO ] Flow matrix only has 16458 transitions (discarded 18 similar events)
[2026-05-28 00:41:54] [INFO ] Invariant cache hit.
[2026-05-28 00:41:54] [INFO ] State equation strengthened by 6155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 92/16551 variables, and 12 constraints, problems are : Problem set: 0 solved, 16474 unsolved in 30270 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/93 constraints, ReadFeed: 0/6155 constraints, PredecessorRefiner: 16474/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 16474 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 92/16551 variables, and 12 constraints, problems are : Problem set: 0 solved, 16474 unsolved in 30403 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/93 constraints, ReadFeed: 0/6155 constraints, PredecessorRefiner: 16435/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98420ms problems are : Problem set: 0 solved, 16474 unsolved
Search for dead transitions found 0 dead transitions in 98501ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/170 places, 16476/18605 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134719 ms. Remains : 93/170 places, 16476/18605 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(((!p1 U (p2||G(!p1)))&&p0))))'
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-1201-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1201-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1201-LTLFireability-15 finished in 134967 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((G(p0) U (!(G(p1)||p0)||(X(G(p2)) U p3)))))'
Spot run failed in 156 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-28 00:43:36] [INFO ] Flatten gal took : 2768 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15749217231880703884
[2026-05-28 00:43:38] [INFO ] Too many transitions (18605) to apply POR reductions. Disabling POR matrices.
[2026-05-28 00:43:38] [INFO ] Built C files in 425ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15749217231880703884
Running compilation step : cd /tmp/ltsmin15749217231880703884;'/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-28 00:43:39] [INFO ] Applying decomposition
[2026-05-28 00:43:43] [INFO ] Flatten gal took : 3930 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/graph12674697493866551216.txt' '-o' '/tmp/graph12674697493866551216.bin' '-w' '/tmp/graph12674697493866551216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12674697493866551216.bin' '-l' '-1' '-v' '-w' '/tmp/graph12674697493866551216.weights' '-q' '0' '-e' '0.001'
[2026-05-28 00:43:52] [INFO ] Decomposing Gal with order
[2026-05-28 00:43:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 00:43:59] [INFO ] Removed a total of 288900 redundant transitions.
[2026-05-28 00:43:59] [INFO ] Flatten gal took : 4832 ms
[2026-05-28 00:44:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 3973 ms.
[2026-05-28 00:44:03] [INFO ] Time to serialize gal into /tmp/LTLFireability18255313601373156928.gal : 183 ms
[2026-05-28 00:44:03] [INFO ] Time to serialize properties into /tmp/LTLFireability10234604526106703153.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/LTLFireability18255313601373156928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10234604526106703153.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 : !((G((G("(((((i4.u7.p18==1)&&(i4.u11.p31==1))&&((i4.u14.p48==1)&&(i4.u17.p61==1)))&&(((i0.u19.p70==1)&&(i5.u23.p83==1))&&((i5.u25.p96=...1378
Formula 0 simplified : F(F!"(((((i4.u7.p18==1)&&(i4.u11.p31==1))&&((i4.u14.p48==1)&&(i4.u17.p61==1)))&&(((i0.u19.p70==1)&&(i5.u23.p83==1))&&((i5.u25.p96==1...1638
Compilation finished in 715985 ms.
Running link step : cd /tmp/ltsmin15749217231880703884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 298 ms.
Running LTSmin : cd /tmp/ltsmin15749217231880703884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](([]((LTLAPp0==true)) U (!([]((LTLAPp1==true))||(LTLAPp0==true))||(X([]((LTLAPp2==true))) U (LTLAPp3==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV0-PT-1201"
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-1201, 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-177955740600516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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