Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967500140.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 CloudReconfiguration-PT-304, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967500140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Mar 6 08:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 08:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 6 08:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 08:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 08:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 6 08:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 08:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-304-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-304-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779500783137

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-304
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 01:46:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 01:46:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 01:46:24] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2026-05-23 01:46:24] [INFO ] Transformed 2584 places.
[2026-05-23 01:46:24] [INFO ] Transformed 3094 transitions.
[2026-05-23 01:46:24] [INFO ] Found NUPN structural information;
[2026-05-23 01:46:24] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-304-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 513 places :
Symmetric choice reduction at 0 with 513 rule applications. Total rules 513 place count 2071 transition count 2581
Iterating global reduction 0 with 513 rules applied. Total rules applied 1026 place count 2071 transition count 2581
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1054 place count 2071 transition count 2553
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1293 place count 1832 transition count 2314
Iterating global reduction 1 with 239 rules applied. Total rules applied 1532 place count 1832 transition count 2314
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 1622 place count 1742 transition count 2224
Iterating global reduction 1 with 90 rules applied. Total rules applied 1712 place count 1742 transition count 2224
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1729 place count 1742 transition count 2207
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1777 place count 1694 transition count 2159
Iterating global reduction 2 with 48 rules applied. Total rules applied 1825 place count 1694 transition count 2159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1833 place count 1694 transition count 2151
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1871 place count 1656 transition count 2109
Iterating global reduction 3 with 38 rules applied. Total rules applied 1909 place count 1656 transition count 2109
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1936 place count 1629 transition count 2082
Iterating global reduction 3 with 27 rules applied. Total rules applied 1963 place count 1629 transition count 2082
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1989 place count 1603 transition count 2056
Iterating global reduction 3 with 26 rules applied. Total rules applied 2015 place count 1603 transition count 2056
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2041 place count 1577 transition count 2030
Iterating global reduction 3 with 26 rules applied. Total rules applied 2067 place count 1577 transition count 2030
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 2090 place count 1554 transition count 1992
Iterating global reduction 3 with 23 rules applied. Total rules applied 2113 place count 1554 transition count 1992
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2119 place count 1548 transition count 1983
Iterating global reduction 3 with 6 rules applied. Total rules applied 2125 place count 1548 transition count 1983
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2131 place count 1542 transition count 1976
Iterating global reduction 3 with 6 rules applied. Total rules applied 2137 place count 1542 transition count 1976
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2139 place count 1542 transition count 1974
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2140 place count 1541 transition count 1973
Iterating global reduction 4 with 1 rules applied. Total rules applied 2141 place count 1541 transition count 1973
Applied a total of 2141 rules in 1557 ms. Remains 1541 /2584 variables (removed 1043) and now considering 1973/3094 (removed 1121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13273803775733186746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5166883820267492848.kers'
[2026-05-23 01:46:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13273803775733186746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5166883820267492848.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1973 rows 1541 cols 4115 entries
Finished phase 1 with 1536 SingleSign rule and 1 generalized
[2026-05-23 01:46:26] [INFO ] Computed 4 invariants in 16 ms
Computed 4 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-5166883820267492848.kers
Total runtime 19 ms.
[2026-05-23 01:46:27] [INFO ] Implicit Places using invariants in 845 ms returned []
[2026-05-23 01:46:27] [INFO ] Invariant cache hit.
[2026-05-23 01:46:28] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 2197 ms to find 0 implicit places.
Running 1972 sub problems to find dead transitions.
[2026-05-23 01:46:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1972 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1540/3514 variables, and 4 constraints, problems are : Problem set: 0 solved, 1972 unsolved in 30064 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1541 constraints, PredecessorRefiner: 1972/1972 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1972 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1540 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1972 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1540/3514 variables, and 4 constraints, problems are : Problem set: 0 solved, 1972 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1541 constraints, PredecessorRefiner: 0/1972 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60694ms problems are : Problem set: 0 solved, 1972 unsolved
Search for dead transitions found 0 dead transitions in 60715ms
Starting structural reductions in LTL mode, iteration 1 : 1541/2584 places, 1973/3094 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64535 ms. Remains : 1541/2584 places, 1973/3094 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Applied a total of 0 rules in 58 ms. Remains 1541 /1541 variables (removed 0) and now considering 1973/1973 (removed 0) transitions.
[2026-05-23 01:47:29] [INFO ] Invariant cache hit.
[2026-05-23 01:47:29] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-23 01:47:29] [INFO ] Invariant cache hit.
[2026-05-23 01:47:30] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1355 ms. Remains : 1541/1541 places, 1973/1973 transitions.
Support contains 32 out of 1541 places after structural reductions.
[2026-05-23 01:47:30] [INFO ] Flatten gal took : 129 ms
[2026-05-23 01:47:31] [INFO ] Flatten gal took : 74 ms
[2026-05-23 01:47:31] [INFO ] Input system was already deterministic with 1973 transitions.
RANDOM walk for 40000 steps (308 resets) in 1613 ms. (24 steps per ms) remains 24/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (9 resets) in 74 ms. (53 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (9 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
[2026-05-23 01:47:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1508/1530 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1530 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1963/3493 variables, 1530/1534 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3493 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 2/3495 variables, 1/1535 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3495 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 2/3497 variables, 1/1536 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3497 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 2/3499 variables, 1/1537 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3499/3514 variables, and 1537 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1533/1541 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1508/1530 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1530 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1963/3493 variables, 1530/1534 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3493 variables, 24/1558 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3493 variables, 0/1558 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 2/3495 variables, 1/1559 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3495/3514 variables, and 1559 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1531/1541 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10038ms problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 1541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Graph (trivial) has 1836 edges and 1541 vertex of which 632 / 1541 are part of one of the 59 SCC in 12 ms
Free SCC test removed 573 places
Drop transitions (Empty/Sink Transition effects.) removed 720 transitions
Reduce isomorphic transitions removed 720 transitions.
Graph (complete) has 1423 edges and 968 vertex of which 959 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 515 transitions
Trivial Post-agglo rules discarded 515 transitions
Performed 515 trivial Post agglomeration. Transition count delta: 515
Iterating post reduction 0 with 522 rules applied. Total rules applied 524 place count 959 transition count 727
Reduce places removed 515 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 569 rules applied. Total rules applied 1093 place count 444 transition count 673
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 37 rules applied. Total rules applied 1130 place count 409 transition count 671
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1133 place count 408 transition count 669
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1137 place count 407 transition count 666
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 7 rules applied. Total rules applied 1144 place count 405 transition count 661
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 1152 place count 400 transition count 658
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 1155 place count 399 transition count 656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1156 place count 398 transition count 656
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 54 Pre rules applied. Total rules applied 1156 place count 398 transition count 602
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 9 with 108 rules applied. Total rules applied 1264 place count 344 transition count 602
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1274 place count 334 transition count 589
Iterating global reduction 9 with 10 rules applied. Total rules applied 1284 place count 334 transition count 589
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 1286 place count 334 transition count 587
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1288 place count 332 transition count 587
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 1294 place count 326 transition count 581
Iterating global reduction 11 with 6 rules applied. Total rules applied 1300 place count 326 transition count 581
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1306 place count 326 transition count 575
Performed 160 Post agglomeration using F-continuation condition with reduction of 101 identical transitions.
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 12 with 320 rules applied. Total rules applied 1626 place count 166 transition count 314
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 12 with 18 rules applied. Total rules applied 1644 place count 166 transition count 296
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 1647 place count 163 transition count 293
Iterating global reduction 13 with 3 rules applied. Total rules applied 1650 place count 163 transition count 293
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 20 rules applied. Total rules applied 1670 place count 153 transition count 281
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 13 with 11 rules applied. Total rules applied 1681 place count 153 transition count 270
Performed 36 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 14 with 72 rules applied. Total rules applied 1753 place count 117 transition count 312
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 14 with 27 rules applied. Total rules applied 1780 place count 117 transition count 285
Discarding 19 places :
Symmetric choice reduction at 15 with 19 rule applications. Total rules 1799 place count 98 transition count 247
Iterating global reduction 15 with 19 rules applied. Total rules applied 1818 place count 98 transition count 247
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 1825 place count 98 transition count 240
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 1829 place count 94 transition count 232
Iterating global reduction 16 with 4 rules applied. Total rules applied 1833 place count 94 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 1837 place count 94 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 17 with 18 rules applied. Total rules applied 1855 place count 94 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 1857 place count 93 transition count 209
Free-agglomeration rule applied 4 times.
Iterating global reduction 17 with 4 rules applied. Total rules applied 1861 place count 93 transition count 205
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 1866 place count 89 transition count 204
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 18 with 10 rules applied. Total rules applied 1876 place count 89 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1877 place count 89 transition count 203
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 18 with 4 rules applied. Total rules applied 1881 place count 89 transition count 203
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 1883 place count 89 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1884 place count 88 transition count 200
Applied a total of 1884 rules in 176 ms. Remains 88 /1541 variables (removed 1453) and now considering 200/1973 (removed 1773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 88/1541 places, 200/1973 transitions.
RANDOM walk for 40000 steps (550 resets) in 716 ms. (55 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40003 steps (136 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
[2026-05-23 01:47:42] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-614504246100549550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16160090837227051871.kers'
[2026-05-23 01:47:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-614504246100549550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16160090837227051871.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 88 cols 559 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-23 01:47:42] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16160090837227051871.kers
Total runtime 1 ms.
[2026-05-23 01:47:42] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/163 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/213 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/226 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/275 variables, 29/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/278 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/278 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/278 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 88/88 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/163 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/213 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/226 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 49/275 variables, 29/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/275 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/278 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/278 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/278 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/278 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 88/88 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 242ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 189 steps, including 21 resets, run visited all 1 properties in 1 ms. (steps per millisecond=189 )
Parikh walk visited 1 properties in 5 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2148 edges and 1541 vertex of which 1532 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.22 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 1 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Graph (trivial) has 1885 edges and 1541 vertex of which 693 / 1541 are part of one of the 62 SCC in 4 ms
Free SCC test removed 631 places
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 1408 edges and 910 vertex of which 901 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 900 transition count 737
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 523 rules applied. Total rules applied 1021 place count 404 transition count 710
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 1036 place count 390 transition count 709
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1037 place count 389 transition count 709
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1037 place count 389 transition count 663
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1129 place count 343 transition count 663
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1145 place count 327 transition count 637
Iterating global reduction 4 with 16 rules applied. Total rules applied 1161 place count 327 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 1165 place count 327 transition count 633
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1168 place count 324 transition count 633
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1177 place count 315 transition count 621
Iterating global reduction 6 with 9 rules applied. Total rules applied 1186 place count 315 transition count 621
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1192 place count 315 transition count 615
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1193 place count 314 transition count 613
Iterating global reduction 7 with 1 rules applied. Total rules applied 1194 place count 314 transition count 613
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1195 place count 313 transition count 611
Iterating global reduction 7 with 1 rules applied. Total rules applied 1196 place count 313 transition count 611
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1197 place count 312 transition count 609
Iterating global reduction 7 with 1 rules applied. Total rules applied 1198 place count 312 transition count 609
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1199 place count 311 transition count 607
Iterating global reduction 7 with 1 rules applied. Total rules applied 1200 place count 311 transition count 607
Performed 146 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 7 with 292 rules applied. Total rules applied 1492 place count 165 transition count 378
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1508 place count 165 transition count 362
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1514 place count 159 transition count 353
Iterating global reduction 8 with 6 rules applied. Total rules applied 1520 place count 159 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1521 place count 159 transition count 352
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1522 place count 158 transition count 350
Iterating global reduction 9 with 1 rules applied. Total rules applied 1523 place count 158 transition count 350
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1524 place count 157 transition count 348
Iterating global reduction 9 with 1 rules applied. Total rules applied 1525 place count 157 transition count 348
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1526 place count 156 transition count 346
Iterating global reduction 9 with 1 rules applied. Total rules applied 1527 place count 156 transition count 346
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1528 place count 155 transition count 344
Iterating global reduction 9 with 1 rules applied. Total rules applied 1529 place count 155 transition count 344
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1553 place count 143 transition count 329
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1565 place count 143 transition count 317
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1566 place count 142 transition count 315
Iterating global reduction 10 with 1 rules applied. Total rules applied 1567 place count 142 transition count 315
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1603 place count 124 transition count 355
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 10 with 25 rules applied. Total rules applied 1628 place count 124 transition count 330
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 1639 place count 113 transition count 302
Iterating global reduction 11 with 11 rules applied. Total rules applied 1650 place count 113 transition count 302
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1656 place count 113 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 12 with 34 rules applied. Total rules applied 1690 place count 113 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1691 place count 112 transition count 261
Applied a total of 1691 rules in 135 ms. Remains 112 /1541 variables (removed 1429) and now considering 261/1973 (removed 1712) transitions.
[2026-05-23 01:47:43] [INFO ] Flow matrix only has 205 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6485556393636954622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2125368266503307605.kers'
[2026-05-23 01:47:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6485556393636954622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2125368266503307605.kers]
Normalized transition count is 204 out of 205 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 112 cols 588 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 01:47:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2125368266503307605.kers
Total runtime 2 ms.
[2026-05-23 01:47:43] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 01:47:43] [INFO ] Flow matrix only has 205 transitions (discarded 56 similar events)
[2026-05-23 01:47:43] [INFO ] Invariant cache hit.
[2026-05-23 01:47:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:47:43] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [8, 41, 74]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 173 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/1541 places, 261/1973 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 106 transition count 258
Applied a total of 3 rules in 16 ms. Remains 106 /109 variables (removed 3) and now considering 258/261 (removed 3) transitions.
[2026-05-23 01:47:43] [INFO ] Flow matrix only has 202 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3545292821964308198.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5348565244231721922.kers'
[2026-05-23 01:47:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3545292821964308198.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5348565244231721922.kers]
Normalized transition count is 201 out of 202 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 106 cols 573 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-23 01:47:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5348565244231721922.kers
Total runtime 1 ms.
[2026-05-23 01:47:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 01:47:43] [INFO ] Flow matrix only has 202 transitions (discarded 56 similar events)
[2026-05-23 01:47:43] [INFO ] Invariant cache hit.
[2026-05-23 01:47:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 01:47:43] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/1541 places, 258/1973 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 447 ms. Remains : 106/1541 places, 258/1973 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 151 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLFireability-00 finished in 665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(G(p1))||G(p2))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Graph (trivial) has 1881 edges and 1541 vertex of which 696 / 1541 are part of one of the 63 SCC in 2 ms
Free SCC test removed 633 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1407 edges and 908 vertex of which 899 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 898 transition count 738
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 521 rules applied. Total rules applied 1017 place count 404 transition count 711
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1031 place count 390 transition count 711
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1031 place count 390 transition count 666
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1121 place count 345 transition count 666
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1137 place count 329 transition count 640
Iterating global reduction 3 with 16 rules applied. Total rules applied 1153 place count 329 transition count 640
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 1157 place count 329 transition count 636
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1160 place count 326 transition count 636
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1169 place count 317 transition count 624
Iterating global reduction 5 with 9 rules applied. Total rules applied 1178 place count 317 transition count 624
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1184 place count 317 transition count 618
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1185 place count 316 transition count 616
Iterating global reduction 6 with 1 rules applied. Total rules applied 1186 place count 316 transition count 616
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1187 place count 315 transition count 614
Iterating global reduction 6 with 1 rules applied. Total rules applied 1188 place count 315 transition count 614
Performed 146 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 6 with 292 rules applied. Total rules applied 1480 place count 169 transition count 386
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1496 place count 169 transition count 370
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1502 place count 163 transition count 361
Iterating global reduction 7 with 6 rules applied. Total rules applied 1508 place count 163 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1509 place count 163 transition count 360
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1510 place count 162 transition count 358
Iterating global reduction 8 with 1 rules applied. Total rules applied 1511 place count 162 transition count 358
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1512 place count 161 transition count 356
Iterating global reduction 8 with 1 rules applied. Total rules applied 1513 place count 161 transition count 356
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1514 place count 160 transition count 354
Iterating global reduction 8 with 1 rules applied. Total rules applied 1515 place count 160 transition count 354
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1539 place count 148 transition count 339
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1551 place count 148 transition count 327
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1552 place count 147 transition count 325
Iterating global reduction 9 with 1 rules applied. Total rules applied 1553 place count 147 transition count 325
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1587 place count 130 transition count 369
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 9 with 24 rules applied. Total rules applied 1611 place count 130 transition count 345
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1620 place count 121 transition count 327
Iterating global reduction 10 with 9 rules applied. Total rules applied 1629 place count 121 transition count 327
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1634 place count 121 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 11 with 43 rules applied. Total rules applied 1677 place count 121 transition count 279
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1679 place count 121 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1680 place count 121 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1681 place count 120 transition count 277
Applied a total of 1681 rules in 104 ms. Remains 120 /1541 variables (removed 1421) and now considering 277/1973 (removed 1696) transitions.
[2026-05-23 01:47:43] [INFO ] Flow matrix only has 220 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11785461170586731346.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2036505492162821002.kers'
[2026-05-23 01:47:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11785461170586731346.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2036505492162821002.kers]
Normalized transition count is 219 out of 220 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 120 cols 619 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-23 01:47:43] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2036505492162821002.kers
Total runtime 1 ms.
[2026-05-23 01:47:44] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 01:47:44] [INFO ] Flow matrix only has 220 transitions (discarded 57 similar events)
[2026-05-23 01:47:44] [INFO ] Invariant cache hit.
[2026-05-23 01:47:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-23 01:47:44] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [15, 48, 81]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 167 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1541 places, 277/1973 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 114 transition count 274
Applied a total of 3 rules in 11 ms. Remains 114 /117 variables (removed 3) and now considering 274/277 (removed 3) transitions.
[2026-05-23 01:47:44] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-353045448475207107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12233995128494929589.kers'
[2026-05-23 01:47:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-353045448475207107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12233995128494929589.kers]
Normalized transition count is 216 out of 217 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 114 cols 604 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 01:47:44] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12233995128494929589.kers
Total runtime 1 ms.
[2026-05-23 01:47:44] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 01:47:44] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
[2026-05-23 01:47:44] [INFO ] Invariant cache hit.
[2026-05-23 01:47:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 01:47:44] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1541 places, 274/1973 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 417 ms. Remains : 114/1541 places, 274/1973 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(G(p1))||G(p2))))'
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLFireability-01 finished in 612 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)&&X(X(X(X(F(p1)))))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1524 transition count 1954
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1524 transition count 1954
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 1524 transition count 1952
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 1518 transition count 1945
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 1518 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 1518 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 1515 transition count 1941
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 1515 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 1514 transition count 1939
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 1513 transition count 1938
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 1512 transition count 1936
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 1511 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 1510 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 1510 transition count 1933
Applied a total of 66 rules in 535 ms. Remains 1510 /1541 variables (removed 31) and now considering 1933/1973 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15905095552810979000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14111822349337392613.kers'
[2026-05-23 01:47:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15905095552810979000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14111822349337392613.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1933 rows 1510 cols 4035 entries
Finished phase 1 with 1505 SingleSign rule and 1 generalized
[2026-05-23 01:47:45] [INFO ] Computed 4 invariants in 12 ms
Computed 4 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-14111822349337392613.kers
Total runtime 14 ms.
[2026-05-23 01:47:45] [INFO ] Implicit Places using invariants in 239 ms returned []
[2026-05-23 01:47:45] [INFO ] Invariant cache hit.
[2026-05-23 01:47:46] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2026-05-23 01:47:46] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60494ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60499ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1541 places, 1933/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62230 ms. Remains : 1510/1541 places, 1933/1973 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)&&X(X(X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-03
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLFireability-03 finished in 62550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&F((G(F(p2))||(F(p2)&&X(!p2)))))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Graph (trivial) has 1878 edges and 1541 vertex of which 680 / 1541 are part of one of the 62 SCC in 5 ms
Free SCC test removed 618 places
Ensure Unique test removed 716 transitions
Reduce isomorphic transitions removed 716 transitions.
Graph (complete) has 1426 edges and 923 vertex of which 914 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 502 transitions
Trivial Post-agglo rules discarded 502 transitions
Performed 502 trivial Post agglomeration. Transition count delta: 502
Iterating post reduction 0 with 502 rules applied. Total rules applied 504 place count 913 transition count 749
Reduce places removed 502 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 529 rules applied. Total rules applied 1033 place count 411 transition count 722
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 1048 place count 397 transition count 721
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1051 place count 396 transition count 719
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1054 place count 395 transition count 717
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1055 place count 394 transition count 717
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 46 Pre rules applied. Total rules applied 1055 place count 394 transition count 671
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 1147 place count 348 transition count 671
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1161 place count 334 transition count 649
Iterating global reduction 6 with 14 rules applied. Total rules applied 1175 place count 334 transition count 649
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 4 rules applied. Total rules applied 1179 place count 334 transition count 645
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1182 place count 331 transition count 645
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1190 place count 323 transition count 635
Iterating global reduction 8 with 8 rules applied. Total rules applied 1198 place count 323 transition count 635
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1204 place count 323 transition count 629
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1205 place count 322 transition count 627
Iterating global reduction 9 with 1 rules applied. Total rules applied 1206 place count 322 transition count 627
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1207 place count 321 transition count 625
Iterating global reduction 9 with 1 rules applied. Total rules applied 1208 place count 321 transition count 625
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1209 place count 320 transition count 623
Iterating global reduction 9 with 1 rules applied. Total rules applied 1210 place count 320 transition count 623
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1211 place count 319 transition count 621
Iterating global reduction 9 with 1 rules applied. Total rules applied 1212 place count 319 transition count 621
Performed 150 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 9 with 300 rules applied. Total rules applied 1512 place count 169 transition count 388
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1531 place count 169 transition count 369
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 1537 place count 163 transition count 360
Iterating global reduction 10 with 6 rules applied. Total rules applied 1543 place count 163 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1544 place count 163 transition count 359
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1546 place count 161 transition count 352
Iterating global reduction 11 with 2 rules applied. Total rules applied 1548 place count 161 transition count 352
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1549 place count 160 transition count 350
Iterating global reduction 11 with 1 rules applied. Total rules applied 1550 place count 160 transition count 350
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1551 place count 159 transition count 348
Iterating global reduction 11 with 1 rules applied. Total rules applied 1552 place count 159 transition count 348
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1553 place count 158 transition count 346
Iterating global reduction 11 with 1 rules applied. Total rules applied 1554 place count 158 transition count 346
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1580 place count 145 transition count 330
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1592 place count 145 transition count 318
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1626 place count 128 transition count 354
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 12 with 18 rules applied. Total rules applied 1644 place count 128 transition count 336
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1653 place count 119 transition count 318
Iterating global reduction 13 with 9 rules applied. Total rules applied 1662 place count 119 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1668 place count 119 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 14 with 38 rules applied. Total rules applied 1706 place count 119 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1707 place count 118 transition count 273
Applied a total of 1707 rules in 89 ms. Remains 118 /1541 variables (removed 1423) and now considering 273/1973 (removed 1700) transitions.
[2026-05-23 01:48:47] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14738217795198406970.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11815518160262304376.kers'
[2026-05-23 01:48:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14738217795198406970.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11815518160262304376.kers]
Normalized transition count is 215 out of 216 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 118 cols 609 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 01:48:47] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11815518160262304376.kers
Total runtime 3 ms.
[2026-05-23 01:48:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-23 01:48:47] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2026-05-23 01:48:47] [INFO ] Invariant cache hit.
[2026-05-23 01:48:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 01:48:47] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [14, 48, 81]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 184 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1541 places, 273/1973 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 112 transition count 270
Applied a total of 3 rules in 11 ms. Remains 112 /115 variables (removed 3) and now considering 270/273 (removed 3) transitions.
[2026-05-23 01:48:47] [INFO ] Flow matrix only has 213 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7072844933276244970.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10081069139145225790.kers'
[2026-05-23 01:48:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7072844933276244970.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10081069139145225790.kers]
Normalized transition count is 212 out of 213 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 112 cols 594 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 01:48:47] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10081069139145225790.kers
Total runtime 1 ms.
[2026-05-23 01:48:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 01:48:47] [INFO ] Flow matrix only has 213 transitions (discarded 57 similar events)
[2026-05-23 01:48:47] [INFO ] Invariant cache hit.
[2026-05-23 01:48:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:48:47] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1541 places, 270/1973 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 422 ms. Remains : 112/1541 places, 270/1973 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&F((G(F(p2))||(F(p2)&&X(!p2)))))))'
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLFireability-04 finished in 605 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 U (p1||G(p2))) U X((p3&&F(p2)))))'
Support contains 4 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1526 transition count 1957
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1526 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1526 transition count 1956
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 1522 transition count 1951
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 1522 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 1519 transition count 1948
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 1519 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 1519 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1518 transition count 1946
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1518 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1517 transition count 1945
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1517 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1516 transition count 1943
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1516 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1515 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1515 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1514 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1514 transition count 1940
Applied a total of 56 rules in 546 ms. Remains 1514 /1541 variables (removed 27) and now considering 1940/1973 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6507288279055761796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17928121219789197588.kers'
[2026-05-23 01:48:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6507288279055761796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17928121219789197588.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1940 rows 1514 cols 4049 entries
Finished phase 1 with 1509 SingleSign rule and 1 generalized
[2026-05-23 01:48:48] [INFO ] Computed 4 invariants in 15 ms
Computed 4 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-17928121219789197588.kers
Total runtime 19 ms.
[2026-05-23 01:48:48] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-23 01:48:48] [INFO ] Invariant cache hit.
[2026-05-23 01:48:49] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2026-05-23 01:48:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3454 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30052 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3454 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60452ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1541 places, 1940/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62213 ms. Remains : 1514/1541 places, 1940/1973 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 (p1||G(p2))) U X((p3&&F(p2)))))'
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-05
Stuttering criterion allowed to conclude after 157 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLFireability-05 finished in 62720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X((p0 U (G(p0)||p1))) U (G(X((p0 U (p1||G(p0)))))||(p2&&X((p0 U (p1||G(p0)))))))))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1524 transition count 1954
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1524 transition count 1954
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 1524 transition count 1952
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 1519 transition count 1946
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 1519 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 1519 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 1516 transition count 1942
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 1516 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 1515 transition count 1940
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 1514 transition count 1938
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 1513 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 1513 transition count 1937
Applied a total of 60 rules in 441 ms. Remains 1513 /1541 variables (removed 28) and now considering 1937/1973 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18438536282376106370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12902627941134613902.kers'
[2026-05-23 01:49:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18438536282376106370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12902627941134613902.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1937 rows 1513 cols 4043 entries
Finished phase 1 with 1508 SingleSign rule and 1 generalized
[2026-05-23 01:49:50] [INFO ] Computed 4 invariants in 17 ms
Computed 4 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-12902627941134613902.kers
Total runtime 22 ms.
[2026-05-23 01:49:51] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-05-23 01:49:51] [INFO ] Invariant cache hit.
[2026-05-23 01:49:52] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2026-05-23 01:49:52] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3450 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1936/1936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3450 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30045 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60482ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60484ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1541 places, 1937/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62180 ms. Remains : 1513/1541 places, 1937/1973 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X((p0 U (G(p0)||p1))) U (G(X((p0 U (p1||G(p0)))))||(p2&&X((p0 U (p1||G(p0)))))))))))'
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-06
Product exploration explored 100000 steps with 20000 reset in 298 ms.
Product exploration explored 100000 steps with 20000 reset in 316 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2112 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (307 resets) in 365 ms. (109 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (79 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (84 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (80 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
[2026-05-23 01:50:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1927/3429 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3447/3450 variables, and 1515 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1513 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1927/3429 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3429 variables, 4/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3437 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3437 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3439 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3439 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3441 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3441 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3443 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3443 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3445 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3445/3450 variables, and 1518 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1510/1513 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10073ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Graph (trivial) has 1842 edges and 1513 vertex of which 687 / 1513 are part of one of the 63 SCC in 2 ms
Free SCC test removed 624 places
Drop transitions (Empty/Sink Transition effects.) removed 788 transitions
Reduce isomorphic transitions removed 788 transitions.
Graph (complete) has 1319 edges and 889 vertex of which 880 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 880 transition count 649
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 550 rules applied. Total rules applied 1048 place count 390 transition count 589
Reduce places removed 39 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 42 rules applied. Total rules applied 1090 place count 351 transition count 586
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1093 place count 348 transition count 586
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1093 place count 348 transition count 536
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1193 place count 298 transition count 536
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1204 place count 287 transition count 520
Iterating global reduction 4 with 11 rules applied. Total rules applied 1215 place count 287 transition count 520
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1218 place count 287 transition count 517
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1221 place count 284 transition count 517
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1229 place count 276 transition count 507
Iterating global reduction 6 with 8 rules applied. Total rules applied 1237 place count 276 transition count 507
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1243 place count 276 transition count 501
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1245 place count 274 transition count 489
Iterating global reduction 7 with 2 rules applied. Total rules applied 1247 place count 274 transition count 489
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1248 place count 274 transition count 488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1249 place count 273 transition count 488
Performed 148 Post agglomeration using F-continuation condition with reduction of 102 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 9 with 296 rules applied. Total rules applied 1545 place count 125 transition count 238
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 12 rules applied. Total rules applied 1557 place count 125 transition count 226
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1559 place count 124 transition count 225
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1562 place count 121 transition count 222
Iterating global reduction 11 with 3 rules applied. Total rules applied 1565 place count 121 transition count 222
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1589 place count 109 transition count 207
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1599 place count 109 transition count 197
Performed 32 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 12 with 64 rules applied. Total rules applied 1663 place count 77 transition count 227
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 12 with 26 rules applied. Total rules applied 1689 place count 77 transition count 201
Discarding 20 places :
Symmetric choice reduction at 13 with 20 rule applications. Total rules 1709 place count 57 transition count 161
Iterating global reduction 13 with 20 rules applied. Total rules applied 1729 place count 57 transition count 161
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 13 with 11 rules applied. Total rules applied 1740 place count 57 transition count 150
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1746 place count 51 transition count 138
Iterating global reduction 14 with 6 rules applied. Total rules applied 1752 place count 51 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1758 place count 51 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1759 place count 51 transition count 131
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 1765 place count 51 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1766 place count 50 transition count 130
Applied a total of 1766 rules in 49 ms. Remains 50 /1513 variables (removed 1463) and now considering 130/1937 (removed 1807) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 50/1513 places, 130/1937 transitions.
RANDOM walk for 11017 steps (1177 resets) in 24 ms. (440 steps per ms) remains 0/4 properties
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Knowledge-based reduction took 10944 ms.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Support contains 3 out of 1513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Applied a total of 0 rules in 62 ms. Remains 1513 /1513 variables (removed 0) and now considering 1937/1937 (removed 0) transitions.
[2026-05-23 01:51:04] [INFO ] Invariant cache hit.
[2026-05-23 01:51:04] [INFO ] Implicit Places using invariants in 231 ms returned []
[2026-05-23 01:51:04] [INFO ] Invariant cache hit.
[2026-05-23 01:51:05] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1242 ms. Remains : 1513/1513 places, 1937/1937 transitions.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2112 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge based reduction with 1 factoid took 49 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (307 resets) in 233 ms. (170 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (48 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (80 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (79 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
[2026-05-23 01:51:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1927/3429 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3449/3450 variables, and 1516 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1512/1513 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1502 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1927/3429 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3429 variables, 4/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3437 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3437 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3439 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3439 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3441 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3441 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3443 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3443 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3445 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3445/3450 variables, and 1518 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5022 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1510/1513 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10045ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Graph (trivial) has 1842 edges and 1513 vertex of which 687 / 1513 are part of one of the 63 SCC in 1 ms
Free SCC test removed 624 places
Drop transitions (Empty/Sink Transition effects.) removed 788 transitions
Reduce isomorphic transitions removed 788 transitions.
Graph (complete) has 1319 edges and 889 vertex of which 880 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 880 transition count 649
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 550 rules applied. Total rules applied 1048 place count 390 transition count 589
Reduce places removed 39 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 42 rules applied. Total rules applied 1090 place count 351 transition count 586
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1093 place count 348 transition count 586
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1093 place count 348 transition count 536
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1193 place count 298 transition count 536
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1204 place count 287 transition count 520
Iterating global reduction 4 with 11 rules applied. Total rules applied 1215 place count 287 transition count 520
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1218 place count 287 transition count 517
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1221 place count 284 transition count 517
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1229 place count 276 transition count 507
Iterating global reduction 6 with 8 rules applied. Total rules applied 1237 place count 276 transition count 507
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1243 place count 276 transition count 501
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1245 place count 274 transition count 489
Iterating global reduction 7 with 2 rules applied. Total rules applied 1247 place count 274 transition count 489
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1248 place count 274 transition count 488
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1249 place count 273 transition count 488
Performed 148 Post agglomeration using F-continuation condition with reduction of 102 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 9 with 296 rules applied. Total rules applied 1545 place count 125 transition count 238
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 12 rules applied. Total rules applied 1557 place count 125 transition count 226
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1559 place count 124 transition count 225
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1562 place count 121 transition count 222
Iterating global reduction 11 with 3 rules applied. Total rules applied 1565 place count 121 transition count 222
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1589 place count 109 transition count 207
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1599 place count 109 transition count 197
Performed 32 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 12 with 64 rules applied. Total rules applied 1663 place count 77 transition count 227
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 12 with 26 rules applied. Total rules applied 1689 place count 77 transition count 201
Discarding 20 places :
Symmetric choice reduction at 13 with 20 rule applications. Total rules 1709 place count 57 transition count 161
Iterating global reduction 13 with 20 rules applied. Total rules applied 1729 place count 57 transition count 161
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 13 with 11 rules applied. Total rules applied 1740 place count 57 transition count 150
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1746 place count 51 transition count 138
Iterating global reduction 14 with 6 rules applied. Total rules applied 1752 place count 51 transition count 138
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1758 place count 51 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1759 place count 51 transition count 131
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 1765 place count 51 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1766 place count 50 transition count 130
Applied a total of 1766 rules in 46 ms. Remains 50 /1513 variables (removed 1463) and now considering 130/1937 (removed 1807) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 50/1513 places, 130/1937 transitions.
RANDOM walk for 6136 steps (661 resets) in 23 ms. (255 steps per ms) remains 0/4 properties
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Knowledge-based reduction took 10835 ms.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 20000 reset in 228 ms.
Product exploration explored 100000 steps with 20000 reset in 307 ms.
Spot run failed in 72 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8799122167274124942
[2026-05-23 01:51:17] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8799122167274124942
Running compilation step : cd /tmp/ltsmin8799122167274124942;'/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/ltsmin8799122167274124942;'/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/ltsmin8799122167274124942;'/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 3 out of 1513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Applied a total of 0 rules in 55 ms. Remains 1513 /1513 variables (removed 0) and now considering 1937/1937 (removed 0) transitions.
[2026-05-23 01:51:20] [INFO ] Invariant cache hit.
[2026-05-23 01:51:21] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-23 01:51:21] [INFO ] Invariant cache hit.
[2026-05-23 01:51:22] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1188 ms. Remains : 1513/1513 places, 1937/1937 transitions.
Built C files in :
/tmp/ltsmin7442314108178362897
[2026-05-23 01:51:22] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7442314108178362897
Running compilation step : cd /tmp/ltsmin7442314108178362897;'/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/ltsmin7442314108178362897;'/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/ltsmin7442314108178362897;'/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-23 01:51:25] [INFO ] Flatten gal took : 72 ms
[2026-05-23 01:51:25] [INFO ] Flatten gal took : 75 ms
[2026-05-23 01:51:25] [INFO ] Time to serialize gal into /tmp/LTL9245405285147787821.gal : 11 ms
[2026-05-23 01:51:25] [INFO ] Time to serialize properties into /tmp/LTL10654195990743537948.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/LTL9245405285147787821.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17268204174819769024.hoa' '-atoms' '/tmp/LTL10654195990743537948.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/LTL10654195990743537948.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17268204174819769024.hoa
Detected timeout of ITS tools.
[2026-05-23 01:51:40] [INFO ] Flatten gal took : 42 ms
[2026-05-23 01:51:40] [INFO ] Flatten gal took : 52 ms
[2026-05-23 01:51:40] [INFO ] Time to serialize gal into /tmp/LTL17667268275554154168.gal : 10 ms
[2026-05-23 01:51:40] [INFO ] Time to serialize properties into /tmp/LTL8839822722264001821.ltl : 4 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/LTL17667268275554154168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8839822722264001821.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((X(("(p1107!=1)")U((G("(p1107!=1)"))||("((p1476!=1)&&(p1107!=1))"))))U((G(X(("(p1107!=1)")U(("((p1476!=1)&&(p1107!=1))")||(G(...267
Formula 0 simplified : XXX(X(!"(p1107!=1)" M !"((p1476!=1)&&(p1107!=1))") R (XF(!"((p1476!=1)&&(p1107!=1))" & !"(p1107!=1)") & (!"(p572!=1)" | X(!"(p1107!=...192
Detected timeout of ITS tools.
[2026-05-23 01:51:55] [INFO ] Flatten gal took : 33 ms
[2026-05-23 01:51:55] [INFO ] Applying decomposition
[2026-05-23 01:51:55] [INFO ] Flatten gal took : 32 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/graph16447223551378916096.txt' '-o' '/tmp/graph16447223551378916096.bin' '-w' '/tmp/graph16447223551378916096.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16447223551378916096.bin' '-l' '-1' '-v' '-w' '/tmp/graph16447223551378916096.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:51:55] [INFO ] Decomposing Gal with order
[2026-05-23 01:51:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:51:56] [INFO ] Removed a total of 528 redundant transitions.
[2026-05-23 01:51:56] [INFO ] Flatten gal took : 180 ms
[2026-05-23 01:51:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 71 ms.
[2026-05-23 01:51:56] [INFO ] Time to serialize gal into /tmp/LTL11760326157961850737.gal : 38 ms
[2026-05-23 01:51:56] [INFO ] Time to serialize properties into /tmp/LTL1408546211152057682.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/LTL11760326157961850737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1408546211152057682.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X((X(("(i17.i2.i1.u250.p1107!=1)")U((G("(i17.i2.i1.u250.p1107!=1)"))||("((i23.i1.i0.u353.p1476!=1)&&(i17.i2.i1.u250.p1107!=1))"...460
Formula 0 simplified : XXX(X(!"(i17.i2.i1.u250.p1107!=1)" M !"((i23.i1.i0.u353.p1476!=1)&&(i17.i2.i1.u250.p1107!=1))") R (XF(!"((i23.i1.i0.u353.p1476!=1)&&...340
Reverse transition relation is NOT exact ! Due to transitions t26, t185, t214, t266, t297, t375, t446, t498, t651, t733, t764, t842, t914, t965, t1161, t12...2073
Computing Next relation with stutter on 91936 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
376 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.04292,146884,1,0,241623,6285,19250,475315,530,41199,1035894
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-304-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudReconfiguration-PT-304-LTLFireability-06 finished in 130784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Graph (trivial) has 1885 edges and 1541 vertex of which 695 / 1541 are part of one of the 63 SCC in 1 ms
Free SCC test removed 632 places
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 1408 edges and 909 vertex of which 900 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 899 transition count 737
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 523 rules applied. Total rules applied 1021 place count 403 transition count 710
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 1036 place count 389 transition count 709
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1037 place count 388 transition count 709
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1037 place count 388 transition count 664
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1127 place count 343 transition count 664
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1143 place count 327 transition count 638
Iterating global reduction 4 with 16 rules applied. Total rules applied 1159 place count 327 transition count 638
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 1163 place count 327 transition count 634
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1166 place count 324 transition count 634
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1175 place count 315 transition count 622
Iterating global reduction 6 with 9 rules applied. Total rules applied 1184 place count 315 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1190 place count 315 transition count 616
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1191 place count 314 transition count 614
Iterating global reduction 7 with 1 rules applied. Total rules applied 1192 place count 314 transition count 614
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1193 place count 313 transition count 612
Iterating global reduction 7 with 1 rules applied. Total rules applied 1194 place count 313 transition count 612
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1195 place count 312 transition count 610
Iterating global reduction 7 with 1 rules applied. Total rules applied 1196 place count 312 transition count 610
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1197 place count 311 transition count 608
Iterating global reduction 7 with 1 rules applied. Total rules applied 1198 place count 311 transition count 608
Performed 146 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 7 with 292 rules applied. Total rules applied 1490 place count 165 transition count 379
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1506 place count 165 transition count 363
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1512 place count 159 transition count 354
Iterating global reduction 8 with 6 rules applied. Total rules applied 1518 place count 159 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1519 place count 159 transition count 353
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1520 place count 158 transition count 351
Iterating global reduction 9 with 1 rules applied. Total rules applied 1521 place count 158 transition count 351
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1522 place count 157 transition count 349
Iterating global reduction 9 with 1 rules applied. Total rules applied 1523 place count 157 transition count 349
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1524 place count 156 transition count 347
Iterating global reduction 9 with 1 rules applied. Total rules applied 1525 place count 156 transition count 347
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1526 place count 155 transition count 345
Iterating global reduction 9 with 1 rules applied. Total rules applied 1527 place count 155 transition count 345
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1551 place count 143 transition count 330
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1563 place count 143 transition count 318
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1564 place count 142 transition count 316
Iterating global reduction 10 with 1 rules applied. Total rules applied 1565 place count 142 transition count 316
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1601 place count 124 transition count 356
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 10 with 25 rules applied. Total rules applied 1626 place count 124 transition count 331
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 1637 place count 113 transition count 303
Iterating global reduction 11 with 11 rules applied. Total rules applied 1648 place count 113 transition count 303
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1654 place count 113 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 12 with 34 rules applied. Total rules applied 1688 place count 113 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1689 place count 112 transition count 262
Applied a total of 1689 rules in 66 ms. Remains 112 /1541 variables (removed 1429) and now considering 262/1973 (removed 1711) transitions.
[2026-05-23 01:52:01] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14397006156424287071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10097005086650981249.kers'
[2026-05-23 01:52:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14397006156424287071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10097005086650981249.kers]
Normalized transition count is 204 out of 205 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 112 cols 588 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 01:52:01] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10097005086650981249.kers
Total runtime 1 ms.
[2026-05-23 01:52:01] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 01:52:01] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2026-05-23 01:52:01] [INFO ] Invariant cache hit.
[2026-05-23 01:52:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:52:01] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [8, 42, 75]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 198 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/1541 places, 262/1973 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 106 transition count 259
Applied a total of 3 rules in 7 ms. Remains 106 /109 variables (removed 3) and now considering 259/262 (removed 3) transitions.
[2026-05-23 01:52:01] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12736877085693519234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11806230596652421312.kers'
[2026-05-23 01:52:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12736877085693519234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11806230596652421312.kers]
Normalized transition count is 201 out of 202 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 106 cols 573 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-23 01:52:01] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11806230596652421312.kers
Total runtime 1 ms.
[2026-05-23 01:52:01] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 01:52:01] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2026-05-23 01:52:01] [INFO ] Invariant cache hit.
[2026-05-23 01:52:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 01:52:01] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/1541 places, 259/1973 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 398 ms. Remains : 106/1541 places, 259/1973 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 30 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLFireability-07 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&G(p1)))&&(X(p2) U ((p3&&X(p2))||X(G(p2))))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1525 transition count 1956
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1525 transition count 1956
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1525 transition count 1954
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 1520 transition count 1949
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 1520 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 1520 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 1517 transition count 1945
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 1517 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 1517 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 1515 transition count 1942
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 1515 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 1513 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 1513 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 1511 transition count 1936
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 1511 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 1510 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 1509 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 1509 transition count 1933
Applied a total of 68 rules in 554 ms. Remains 1509 /1541 variables (removed 32) and now considering 1933/1973 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17923251093509407366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2759735205018818164.kers'
[2026-05-23 01:52:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17923251093509407366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2759735205018818164.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1933 rows 1509 cols 4035 entries
Finished phase 1 with 1504 SingleSign rule and 1 generalized
[2026-05-23 01:52:02] [INFO ] Computed 4 invariants in 15 ms
Computed 4 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-2759735205018818164.kers
Total runtime 18 ms.
[2026-05-23 01:52:02] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-23 01:52:02] [INFO ] Invariant cache hit.
[2026-05-23 01:52:03] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2026-05-23 01:52:03] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60454ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1541 places, 1933/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62140 ms. Remains : 1509/1541 places, 1933/1973 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&G(p1)))&&(X(p2) U ((p3&&X(p2))||X(G(p2))))))'
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-08
Product exploration explored 100000 steps with 1518 reset in 259 ms.
Product exploration explored 100000 steps with 1551 reset in 212 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge based reduction with 15 factoid took 65 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (313 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (82 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 389240 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 389240 steps, saw 96034 distinct states, run finished after 3013 ms. (steps per millisecond=129 ) properties seen :0
[2026-05-23 01:53:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 414/1498 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3421 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3423 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3423 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3425 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3442/3442 variables, and 1513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1231 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 414/1498 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3421 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3441 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3442 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3442 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3442 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3442/3442 variables, and 1514 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2116 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3357ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 209 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=69 )
Parikh walk visited 1 properties in 3 ms.
Negative knowledge disproves property using: (G p1)
Knowledge based reduction with 15 factoid took 35 ms. Proved property starting from automaton with 4 states, 5 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 6590 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property CloudReconfiguration-PT-304-LTLFireability-08 finished in 69517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1524 transition count 1954
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1524 transition count 1954
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 1524 transition count 1952
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 1519 transition count 1946
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 1519 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 1519 transition count 1945
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 1515 transition count 1941
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 1515 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 1515 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 1513 transition count 1938
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 1509 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 1507 transition count 1929
Applied a total of 72 rules in 541 ms. Remains 1507 /1541 variables (removed 34) and now considering 1929/1973 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17560723772471171884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3082420888721095119.kers'
[2026-05-23 01:53:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17560723772471171884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3082420888721095119.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1929 rows 1507 cols 4027 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 01:53:11] [INFO ] Computed 4 invariants in 16 ms
Computed 4 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-3082420888721095119.kers
Total runtime 21 ms.
[2026-05-23 01:53:11] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-23 01:53:11] [INFO ] Invariant cache hit.
[2026-05-23 01:53:12] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 01:53:12] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60461ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60464ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1541 places, 1929/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62230 ms. Remains : 1507/1541 places, 1929/1973 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Stuttering acceptance computed with spot in 161 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLFireability-09 finished in 62440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1525 transition count 1955
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1525 transition count 1955
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1525 transition count 1953
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 1520 transition count 1947
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 1520 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 1520 transition count 1946
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 1516 transition count 1942
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 1516 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 1516 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 1514 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 1512 transition count 1936
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 1510 transition count 1933
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 1509 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 1508 transition count 1930
Applied a total of 70 rules in 529 ms. Remains 1508 /1541 variables (removed 33) and now considering 1930/1973 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8337585635918798208.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13811715743963912502.kers'
[2026-05-23 01:54:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8337585635918798208.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13811715743963912502.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1930 rows 1508 cols 4029 entries
Finished phase 1 with 1503 SingleSign rule and 1 generalized
[2026-05-23 01:54:14] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13811715743963912502.kers
Total runtime 14 ms.
[2026-05-23 01:54:14] [INFO ] Implicit Places using invariants in 247 ms returned []
[2026-05-23 01:54:14] [INFO ] Invariant cache hit.
[2026-05-23 01:54:15] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2026-05-23 01:54:15] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30069 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60464ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1541 places, 1930/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62151 ms. Remains : 1508/1541 places, 1930/1973 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLFireability-10 finished in 62333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (G((!p0 U p1))||F(p2)))))'
Support contains 3 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1526 transition count 1956
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1526 transition count 1956
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1526 transition count 1955
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 1520 transition count 1948
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 1520 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1520 transition count 1947
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 1516 transition count 1943
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 1516 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 1514 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 1514 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 1512 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 1512 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 63 place count 1510 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 1509 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 1508 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 1508 transition count 1931
Applied a total of 69 rules in 528 ms. Remains 1508 /1541 variables (removed 33) and now considering 1931/1973 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17080701879625638170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3349387577306709720.kers'
[2026-05-23 01:55:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17080701879625638170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3349387577306709720.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1931 rows 1508 cols 4031 entries
Finished phase 1 with 1503 SingleSign rule and 1 generalized
[2026-05-23 01:55:16] [INFO ] Computed 4 invariants in 14 ms
Computed 4 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-3349387577306709720.kers
Total runtime 18 ms.
[2026-05-23 01:55:16] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-23 01:55:16] [INFO ] Invariant cache hit.
[2026-05-23 01:55:17] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2026-05-23 01:55:17] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3439 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3439 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30045 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60463ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1541 places, 1931/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62222 ms. Remains : 1508/1541 places, 1931/1973 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (G((!p0 U p1))||F(p2)))))'
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Product exploration explored 100000 steps with 50000 reset in 427 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2106 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 16 factoid took 16 ms. Proved property starting from automaton with 6 states, 14 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-304-LTLFireability-11 finished in 63419 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||(p1&&G(p2))))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Graph (trivial) has 1883 edges and 1541 vertex of which 670 / 1541 are part of one of the 62 SCC in 1 ms
Free SCC test removed 608 places
Ensure Unique test removed 709 transitions
Reduce isomorphic transitions removed 709 transitions.
Graph (complete) has 1435 edges and 933 vertex of which 924 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 508 transitions
Trivial Post-agglo rules discarded 508 transitions
Performed 508 trivial Post agglomeration. Transition count delta: 508
Iterating post reduction 0 with 508 rules applied. Total rules applied 510 place count 923 transition count 750
Reduce places removed 508 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 538 rules applied. Total rules applied 1048 place count 415 transition count 720
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 1065 place count 399 transition count 719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1066 place count 398 transition count 719
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1066 place count 398 transition count 670
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1164 place count 349 transition count 670
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1178 place count 335 transition count 646
Iterating global reduction 4 with 14 rules applied. Total rules applied 1192 place count 335 transition count 646
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 1196 place count 335 transition count 642
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1199 place count 332 transition count 642
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1206 place count 325 transition count 632
Iterating global reduction 6 with 7 rules applied. Total rules applied 1213 place count 325 transition count 632
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1217 place count 325 transition count 628
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1218 place count 324 transition count 626
Iterating global reduction 7 with 1 rules applied. Total rules applied 1219 place count 324 transition count 626
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1220 place count 323 transition count 624
Iterating global reduction 7 with 1 rules applied. Total rules applied 1221 place count 323 transition count 624
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1222 place count 322 transition count 622
Iterating global reduction 7 with 1 rules applied. Total rules applied 1223 place count 322 transition count 622
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1224 place count 321 transition count 620
Iterating global reduction 7 with 1 rules applied. Total rules applied 1225 place count 321 transition count 620
Performed 147 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 7 with 294 rules applied. Total rules applied 1519 place count 174 transition count 390
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1535 place count 174 transition count 374
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1541 place count 168 transition count 365
Iterating global reduction 8 with 6 rules applied. Total rules applied 1547 place count 168 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1548 place count 168 transition count 364
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1549 place count 167 transition count 362
Iterating global reduction 9 with 1 rules applied. Total rules applied 1550 place count 167 transition count 362
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1551 place count 166 transition count 360
Iterating global reduction 9 with 1 rules applied. Total rules applied 1552 place count 166 transition count 360
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1553 place count 165 transition count 358
Iterating global reduction 9 with 1 rules applied. Total rules applied 1554 place count 165 transition count 358
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1555 place count 164 transition count 356
Iterating global reduction 9 with 1 rules applied. Total rules applied 1556 place count 164 transition count 356
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1580 place count 152 transition count 341
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1592 place count 152 transition count 329
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1593 place count 151 transition count 327
Iterating global reduction 10 with 1 rules applied. Total rules applied 1594 place count 151 transition count 327
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 10 with 42 rules applied. Total rules applied 1636 place count 130 transition count 368
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 1662 place count 130 transition count 342
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 1673 place count 119 transition count 314
Iterating global reduction 11 with 11 rules applied. Total rules applied 1684 place count 119 transition count 314
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1690 place count 119 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 12 with 34 rules applied. Total rules applied 1724 place count 119 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1725 place count 118 transition count 273
Applied a total of 1725 rules in 66 ms. Remains 118 /1541 variables (removed 1423) and now considering 273/1973 (removed 1700) transitions.
[2026-05-23 01:56:19] [INFO ] Flow matrix only has 217 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2494111750237463730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15215048321263344895.kers'
[2026-05-23 01:56:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2494111750237463730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15215048321263344895.kers]
Normalized transition count is 216 out of 217 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 118 cols 628 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 01:56:19] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15215048321263344895.kers
Total runtime 2 ms.
[2026-05-23 01:56:19] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-23 01:56:19] [INFO ] Flow matrix only has 217 transitions (discarded 56 similar events)
[2026-05-23 01:56:19] [INFO ] Invariant cache hit.
[2026-05-23 01:56:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:56:19] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [8, 41, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 190 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1541 places, 273/1973 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 112 transition count 270
Applied a total of 3 rules in 7 ms. Remains 112 /115 variables (removed 3) and now considering 270/273 (removed 3) transitions.
[2026-05-23 01:56:19] [INFO ] Flow matrix only has 214 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2394485139248693513.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7832925824798848478.kers'
[2026-05-23 01:56:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2394485139248693513.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7832925824798848478.kers]
Normalized transition count is 213 out of 214 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 112 cols 613 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 01:56:19] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7832925824798848478.kers
Total runtime 1 ms.
[2026-05-23 01:56:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 01:56:19] [INFO ] Flow matrix only has 214 transitions (discarded 56 similar events)
[2026-05-23 01:56:19] [INFO ] Invariant cache hit.
[2026-05-23 01:56:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 01:56:19] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1541 places, 270/1973 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 399 ms. Remains : 112/1541 places, 270/1973 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||(p1&&G(p2))))))'
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLFireability-12 finished in 562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((F(p0)||G(p1)))||F(p2)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1523 transition count 1953
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1523 transition count 1953
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 1523 transition count 1951
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 1517 transition count 1944
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 1517 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 1517 transition count 1943
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 1513 transition count 1939
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 1513 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 1511 transition count 1936
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 1511 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 1509 transition count 1933
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 1507 transition count 1930
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 1506 transition count 1928
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 1506 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 1505 transition count 1927
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 1505 transition count 1927
Applied a total of 76 rules in 546 ms. Remains 1505 /1541 variables (removed 36) and now considering 1927/1973 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14891660266044894471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13496956105533205488.kers'
[2026-05-23 01:56:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14891660266044894471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13496956105533205488.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1927 rows 1505 cols 4023 entries
Finished phase 1 with 1500 SingleSign rule and 1 generalized
[2026-05-23 01:56:20] [INFO ] Computed 4 invariants in 17 ms
Computed 4 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-13496956105533205488.kers
Total runtime 21 ms.
[2026-05-23 01:56:20] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-23 01:56:20] [INFO ] Invariant cache hit.
[2026-05-23 01:56:21] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2026-05-23 01:56:21] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3432 variables, and 4 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3432 variables, and 4 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60416ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1541 places, 1927/1973 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62216 ms. Remains : 1505/1541 places, 1927/1973 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((F(p0)||G(p1)))||F(p2)))))'
Stuttering acceptance computed with spot in 191 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))]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-13
Product exploration explored 100000 steps with 772 reset in 222 ms.
Product exploration explored 100000 steps with 778 reset in 264 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2102 edges and 1505 vertex of which 1496 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge based reduction with 5 factoid took 64 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (303 resets) in 162 ms. (245 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (85 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (79 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (81 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (76 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (82 resets) in 60 ms. (655 steps per ms) remains 3/5 properties
[2026-05-23 01:57:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1492/1494 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1494 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1917/3411 variables, 1494/1498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3411 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/3413 variables, 1/1499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3432/3432 variables, and 1509 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2458 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1505/1505 constraints, PredecessorRefiner: 3/3 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1492/1494 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1494 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1917/3411 variables, 1494/1498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3411 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3411 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/3413 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 1/3432 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3432 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/3432 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3432/3432 variables, and 1512 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1505/1505 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7484ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 185 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=46 )
Parikh walk visited 3 properties in 4 ms.
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 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))]
Knowledge-based reduction took 8077 ms.
Stuttering acceptance computed with spot in 189 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))]
Support contains 2 out of 1505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1505/1505 places, 1927/1927 transitions.
Applied a total of 0 rules in 54 ms. Remains 1505 /1505 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
[2026-05-23 01:57:31] [INFO ] Invariant cache hit.
[2026-05-23 01:57:31] [INFO ] Implicit Places using invariants in 231 ms returned []
[2026-05-23 01:57:31] [INFO ] Invariant cache hit.
[2026-05-23 01:57:32] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1297 ms. Remains : 1505/1505 places, 1927/1927 transitions.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2102 edges and 1505 vertex of which 1496 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge based reduction with 5 factoid took 57 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (298 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (83 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (80 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (83 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (79 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (81 resets) in 33 ms. (1176 steps per ms) remains 1/5 properties
[2026-05-23 01:57:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 677/678 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 816/1494 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1494 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1917/3411 variables, 1494/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3411 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3413 variables, 1/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3432/3432 variables, and 1509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2505 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1505/1505 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 677/678 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/678 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 816/1494 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1494 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1917/3411 variables, 1494/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3411 variables, 1/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3411 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3413 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3413 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3415 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3415 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3417 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3417 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3419 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3419 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3421 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3432 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3432 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3432 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3432/3432 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2153 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1505/1505 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4666ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 164 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=164 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 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))]
Knowledge-based reduction took 5197 ms.
Stuttering acceptance computed with spot in 167 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))]
Stuttering acceptance computed with spot in 176 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))]
Product exploration explored 100000 steps with 775 reset in 191 ms.
Product exploration explored 100000 steps with 776 reset in 169 ms.
Spot run failed in 47 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin6637348390313865809
[2026-05-23 01:57:38] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6637348390313865809
Running compilation step : cd /tmp/ltsmin6637348390313865809;'/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/ltsmin6637348390313865809;'/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/ltsmin6637348390313865809;'/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 2 out of 1505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1505/1505 places, 1927/1927 transitions.
Applied a total of 0 rules in 60 ms. Remains 1505 /1505 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
[2026-05-23 01:57:41] [INFO ] Invariant cache hit.
[2026-05-23 01:57:41] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-23 01:57:41] [INFO ] Invariant cache hit.
[2026-05-23 01:57:42] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1283 ms. Remains : 1505/1505 places, 1927/1927 transitions.
Built C files in :
/tmp/ltsmin15990910870204596397
[2026-05-23 01:57:42] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15990910870204596397
Running compilation step : cd /tmp/ltsmin15990910870204596397;'/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/ltsmin15990910870204596397;'/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/ltsmin15990910870204596397;'/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-23 01:57:45] [INFO ] Flatten gal took : 24 ms
[2026-05-23 01:57:45] [INFO ] Flatten gal took : 29 ms
[2026-05-23 01:57:45] [INFO ] Time to serialize gal into /tmp/LTL2209164040238924396.gal : 6 ms
[2026-05-23 01:57:45] [INFO ] Time to serialize properties into /tmp/LTL4641869990803919223.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2209164040238924396.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1085775711827019765.hoa' '-atoms' '/tmp/LTL4641869990803919223.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4641869990803919223.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1085775711827019765.hoa
Detected timeout of ITS tools.
[2026-05-23 01:58:00] [INFO ] Flatten gal took : 20 ms
[2026-05-23 01:58:00] [INFO ] Flatten gal took : 21 ms
[2026-05-23 01:58:00] [INFO ] Time to serialize gal into /tmp/LTL195224737387891417.gal : 6 ms
[2026-05-23 01:58:00] [INFO ] Time to serialize properties into /tmp/LTL18282476878420478462.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL195224737387891417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18282476878420478462.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((G((F("((p360==0)&&(p2018==0))"))||(G("(p360==0)"))))||(F("(p2018==1)"))))))
Formula 0 simplified : XX(F(G!"((p360==0)&&(p2018==0))" & F!"(p360==0)") & G!"(p2018==1)")
Detected timeout of ITS tools.
[2026-05-23 01:58:15] [INFO ] Flatten gal took : 22 ms
[2026-05-23 01:58:15] [INFO ] Applying decomposition
[2026-05-23 01:58:15] [INFO ] Flatten gal took : 20 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/graph10572559566849214741.txt' '-o' '/tmp/graph10572559566849214741.bin' '-w' '/tmp/graph10572559566849214741.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10572559566849214741.bin' '-l' '-1' '-v' '-w' '/tmp/graph10572559566849214741.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:58:16] [INFO ] Decomposing Gal with order
[2026-05-23 01:58:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:58:16] [INFO ] Removed a total of 500 redundant transitions.
[2026-05-23 01:58:16] [INFO ] Flatten gal took : 63 ms
[2026-05-23 01:58:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 17 ms.
[2026-05-23 01:58:16] [INFO ] Time to serialize gal into /tmp/LTL2854086115335268355.gal : 15 ms
[2026-05-23 01:58:16] [INFO ] Time to serialize properties into /tmp/LTL17975127410179663645.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2854086115335268355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17975127410179663645.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((G((F("((i5.u60.p360==0)&&(i29.i1.i1.u476.p2018==0))"))||(G("(i5.u60.p360==0)"))))||(F("(i29.i1.i1.u476.p2018==1)"))))))
Formula 0 simplified : XX(F(G!"((i5.u60.p360==0)&&(i29.i1.i1.u476.p2018==0))" & F!"(i5.u60.p360==0)") & G!"(i29.i1.i1.u476.p2018==1)")
Reverse transition relation is NOT exact ! Due to transitions t26, t185, t214, t266, t326, t375, t446, t498, t651, t733, t793, t914, t965, t1161, t1214, t1...2034
Computing Next relation with stutter on 91936 deadlock states
39 unique states visited
39 strongly connected components in search stack
40 transitions explored
39 items max in DFS search stack
671 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.88604,222432,1,0,371923,11568,22703,846134,599,78823,1408455
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-304-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-304-LTLFireability-13 finished in 124593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 1541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1541/1541 places, 1973/1973 transitions.
Graph (trivial) has 1883 edges and 1541 vertex of which 695 / 1541 are part of one of the 63 SCC in 1 ms
Free SCC test removed 632 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1409 edges and 909 vertex of which 900 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 899 transition count 738
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 1 with 521 rules applied. Total rules applied 1019 place count 403 transition count 713
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1032 place count 390 transition count 713
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1032 place count 390 transition count 667
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1124 place count 344 transition count 667
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1140 place count 328 transition count 641
Iterating global reduction 3 with 16 rules applied. Total rules applied 1156 place count 328 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 1160 place count 328 transition count 637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1163 place count 325 transition count 637
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1172 place count 316 transition count 625
Iterating global reduction 5 with 9 rules applied. Total rules applied 1181 place count 316 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1187 place count 316 transition count 619
Performed 146 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 6 with 292 rules applied. Total rules applied 1479 place count 170 transition count 390
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1495 place count 170 transition count 374
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1501 place count 164 transition count 365
Iterating global reduction 7 with 6 rules applied. Total rules applied 1507 place count 164 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1508 place count 164 transition count 364
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1509 place count 163 transition count 362
Iterating global reduction 8 with 1 rules applied. Total rules applied 1510 place count 163 transition count 362
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1511 place count 162 transition count 360
Iterating global reduction 8 with 1 rules applied. Total rules applied 1512 place count 162 transition count 360
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1513 place count 161 transition count 358
Iterating global reduction 8 with 1 rules applied. Total rules applied 1514 place count 161 transition count 358
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1515 place count 160 transition count 356
Iterating global reduction 8 with 1 rules applied. Total rules applied 1516 place count 160 transition count 356
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1540 place count 148 transition count 341
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1552 place count 148 transition count 329
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1553 place count 147 transition count 327
Iterating global reduction 9 with 1 rules applied. Total rules applied 1554 place count 147 transition count 327
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1592 place count 128 transition count 368
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 1617 place count 128 transition count 343
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 1627 place count 118 transition count 320
Iterating global reduction 10 with 10 rules applied. Total rules applied 1637 place count 118 transition count 320
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1643 place count 118 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 11 with 42 rules applied. Total rules applied 1685 place count 118 transition count 272
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1687 place count 118 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1688 place count 117 transition count 271
Applied a total of 1688 rules in 54 ms. Remains 117 /1541 variables (removed 1424) and now considering 271/1973 (removed 1702) transitions.
[2026-05-23 01:58:24] [INFO ] Flow matrix only has 213 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13489320100629051393.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8892001099297650199.kers'
[2026-05-23 01:58:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13489320100629051393.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8892001099297650199.kers]
Normalized transition count is 212 out of 213 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 117 cols 603 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-23 01:58:24] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8892001099297650199.kers
Total runtime 1 ms.
[2026-05-23 01:58:24] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-23 01:58:24] [INFO ] Flow matrix only has 213 transitions (discarded 58 similar events)
[2026-05-23 01:58:24] [INFO ] Invariant cache hit.
[2026-05-23 01:58:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 01:58:24] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [12, 47, 80]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 175 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1541 places, 271/1973 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 111 transition count 268
Applied a total of 3 rules in 8 ms. Remains 111 /114 variables (removed 3) and now considering 268/271 (removed 3) transitions.
[2026-05-23 01:58:24] [INFO ] Flow matrix only has 210 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3058532447622930444.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3612667939864365203.kers'
[2026-05-23 01:58:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3058532447622930444.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3612667939864365203.kers]
Normalized transition count is 209 out of 210 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 111 cols 588 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-23 01:58:24] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3612667939864365203.kers
Total runtime 1 ms.
[2026-05-23 01:58:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 01:58:24] [INFO ] Flow matrix only has 210 transitions (discarded 58 similar events)
[2026-05-23 01:58:24] [INFO ] Invariant cache hit.
[2026-05-23 01:58:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:58:24] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1541 places, 268/1973 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 370 ms. Remains : 111/1541 places, 268/1973 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||G(p1)))))'
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLFireability-15
Product exploration explored 100000 steps with 10458 reset in 235 ms.
Product exploration explored 100000 steps with 10509 reset in 201 ms.
Computed a total of 1 stabilizing places and 24 stable transitions
Computed a total of 1 stabilizing places and 24 stable transitions
Knowledge based reduction with 9 factoid took 59 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (5063 resets) in 232 ms. (171 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (59 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
[2026-05-23 01:58:25] [INFO ] Flow matrix only has 210 transitions (discarded 58 similar events)
[2026-05-23 01:58:25] [INFO ] Invariant cache hit.
[2026-05-23 01:58:25] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/130 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 185/315 variables, 95/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/320 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/320 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/321 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 115/130 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 185/315 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/320 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/320 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/321 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 194ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 268/268 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 111 transition count 202
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 73 place count 104 transition count 202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 73 place count 104 transition count 200
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 102 transition count 200
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 119 place count 81 transition count 179
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 128 place count 81 transition count 170
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 137 place count 72 transition count 161
Iterating global reduction 3 with 9 rules applied. Total rules applied 146 place count 72 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 149 place count 72 transition count 158
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 169 place count 62 transition count 148
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 179 place count 62 transition count 138
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 187 place count 54 transition count 128
Iterating global reduction 5 with 8 rules applied. Total rules applied 195 place count 54 transition count 128
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 203 place count 54 transition count 120
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 217 place count 47 transition count 122
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 229 place count 47 transition count 110
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 235 place count 41 transition count 102
Iterating global reduction 7 with 6 rules applied. Total rules applied 241 place count 41 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 247 place count 41 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 258 place count 41 transition count 85
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 260 place count 39 transition count 79
Iterating global reduction 8 with 2 rules applied. Total rules applied 262 place count 39 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 264 place count 39 transition count 77
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 266 place count 37 transition count 75
Iterating global reduction 9 with 2 rules applied. Total rules applied 268 place count 37 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 272 place count 37 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 274 place count 36 transition count 70
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 280 place count 36 transition count 64
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 97 edges and 30 vertex of which 16 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 10 with 8 rules applied. Total rules applied 288 place count 16 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 11 with 24 rules applied. Total rules applied 312 place count 16 transition count 37
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 314 place count 16 transition count 37
Applied a total of 314 rules in 14 ms. Remains 16 /111 variables (removed 95) and now considering 37/268 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 16/111 places, 37/268 transitions.
RANDOM walk for 40000 steps (711 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Probably explored full state space saw : 40 states, properties seen :0
Probabilistic random walk after 126 steps, saw 40 distinct states, run finished after 7 ms. (steps per millisecond=18 ) properties seen :0
Explored full state space saw : 40 states, properties seen :0
Exhaustive walk after 126 steps, saw 40 distinct states, run finished after 1 ms. (steps per millisecond=126 ) properties seen :0
Found 1 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 10 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 427 ms.
FORMULA CloudReconfiguration-PT-304-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-304-LTLFireability-15 finished in 1353 ms.
All properties solved by simple procedures.
Total runtime 721493 ms.

BK_STOP 1779501505816

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-304"
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 CloudReconfiguration-PT-304, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tall-177946967500140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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