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-177946967500132.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-303, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967500132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Mar 6 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 6 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 6 08:55 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 4.0K Mar 15 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 9.6K Mar 6 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 6 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 6 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 6 08:55 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-303-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779500003107

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-303
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 01:33: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:33:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 01:33:24] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2026-05-23 01:33:24] [INFO ] Transformed 2584 places.
[2026-05-23 01:33:24] [INFO ] Transformed 3094 transitions.
[2026-05-23 01:33:24] [INFO ] Found NUPN structural information;
[2026-05-23 01:33:24] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudReconfiguration-PT-303-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-303-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-303-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 514 places :
Symmetric choice reduction at 0 with 514 rule applications. Total rules 514 place count 2070 transition count 2580
Iterating global reduction 0 with 514 rules applied. Total rules applied 1028 place count 2070 transition count 2580
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1056 place count 2070 transition count 2552
Discarding 238 places :
Symmetric choice reduction at 1 with 238 rule applications. Total rules 1294 place count 1832 transition count 2314
Iterating global reduction 1 with 238 rules applied. Total rules applied 1532 place count 1832 transition count 2314
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 1621 place count 1743 transition count 2225
Iterating global reduction 1 with 89 rules applied. Total rules applied 1710 place count 1743 transition count 2225
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 1725 place count 1743 transition count 2210
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 1775 place count 1693 transition count 2160
Iterating global reduction 2 with 50 rules applied. Total rules applied 1825 place count 1693 transition count 2160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1834 place count 1693 transition count 2151
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1872 place count 1655 transition count 2109
Iterating global reduction 3 with 38 rules applied. Total rules applied 1910 place count 1655 transition count 2109
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1937 place count 1628 transition count 2082
Iterating global reduction 3 with 27 rules applied. Total rules applied 1964 place count 1628 transition count 2082
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1988 place count 1604 transition count 2058
Iterating global reduction 3 with 24 rules applied. Total rules applied 2012 place count 1604 transition count 2058
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2036 place count 1580 transition count 2034
Iterating global reduction 3 with 24 rules applied. Total rules applied 2060 place count 1580 transition count 2034
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2081 place count 1559 transition count 1998
Iterating global reduction 3 with 21 rules applied. Total rules applied 2102 place count 1559 transition count 1998
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2108 place count 1553 transition count 1987
Iterating global reduction 3 with 6 rules applied. Total rules applied 2114 place count 1553 transition count 1987
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2120 place count 1547 transition count 1979
Iterating global reduction 3 with 6 rules applied. Total rules applied 2126 place count 1547 transition count 1979
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2129 place count 1547 transition count 1976
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2131 place count 1545 transition count 1974
Iterating global reduction 4 with 2 rules applied. Total rules applied 2133 place count 1545 transition count 1974
Applied a total of 2133 rules in 1687 ms. Remains 1545 /2584 variables (removed 1039) and now considering 1974/3094 (removed 1120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15480070929201577454.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13923467239815415382.kers'
[2026-05-23 01:33:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15480070929201577454.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13923467239815415382.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1974 rows 1545 cols 4117 entries
Finished phase 1 with 1540 SingleSign rule and 1 generalized
[2026-05-23 01:33:26] [INFO ] Computed 4 invariants in 13 ms
Computed 4 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-13923467239815415382.kers
Total runtime 15 ms.
[2026-05-23 01:33:26] [INFO ] Implicit Places using invariants in 450 ms returned []
[2026-05-23 01:33:26] [INFO ] Invariant cache hit.
[2026-05-23 01:33:27] [INFO ] Implicit Places using invariants and state equation in 985 ms returned [1534]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1471 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1544/2584 places, 1974/3094 transitions.
Applied a total of 0 rules in 50 ms. Remains 1544 /1544 variables (removed 0) and now considering 1974/1974 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3228 ms. Remains : 1544/2584 places, 1974/3094 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Applied a total of 0 rules in 44 ms. Remains 1544 /1544 variables (removed 0) and now considering 1974/1974 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7431412118171629029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17325865668841630968.kers'
[2026-05-23 01:33:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7431412118171629029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17325865668841630968.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1974 rows 1544 cols 4115 entries
Finished phase 1 with 1540 SingleSign rule and 1 generalized
[2026-05-23 01:33:28] [INFO ] Computed 3 invariants in 10 ms
Computed 3 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-17325865668841630968.kers
Total runtime 16 ms.
[2026-05-23 01:33:28] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-23 01:33:28] [INFO ] Invariant cache hit.
[2026-05-23 01:33:29] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Running 1973 sub problems to find dead transitions.
[2026-05-23 01:33:29] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1543 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1973 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1543/3518 variables, and 3 constraints, problems are : Problem set: 0 solved, 1973 unsolved in 30053 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1544 constraints, PredecessorRefiner: 1973/1973 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1973 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1543 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1973 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1543/3518 variables, and 3 constraints, problems are : Problem set: 0 solved, 1973 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1544 constraints, PredecessorRefiner: 0/1973 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 1973 unsolved
Search for dead transitions found 0 dead transitions in 60642ms
Finished structural reductions in LTL mode , in 1 iterations and 61970 ms. Remains : 1544/1544 places, 1974/1974 transitions.
Support contains 35 out of 1544 places after structural reductions.
[2026-05-23 01:34:30] [INFO ] Flatten gal took : 118 ms
[2026-05-23 01:34:30] [INFO ] Flatten gal took : 65 ms
[2026-05-23 01:34:30] [INFO ] Input system was already deterministic with 1974 transitions.
Support contains 32 out of 1544 places (down from 35) after GAL structural reductions.
RANDOM walk for 40000 steps (427 resets) in 1171 ms. (34 steps per ms) remains 24/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 50 ms. (78 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (19 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (17 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (21 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (14 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (17 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (16 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (15 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (15 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (18 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
[2026-05-23 01:34:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1494/1521 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1521 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1956/3477 variables, 1521/1524 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3477 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 7/3484 variables, 5/1529 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3484 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 6/3490 variables, 3/1532 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3490 variables, 0/1532 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 6/3496 variables, 3/1535 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 3496/3518 variables, and 1535 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1532/1544 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1494/1521 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1521 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1956/3477 variables, 1521/1524 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3477 variables, 24/1548 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3477 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 7/3484 variables, 5/1553 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 Int declared 3484/3518 variables, and 1553 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1526/1544 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10046ms problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Graph (trivial) has 1831 edges and 1544 vertex of which 664 / 1544 are part of one of the 60 SCC in 10 ms
Free SCC test removed 604 places
Drop transitions (Empty/Sink Transition effects.) removed 759 transitions
Reduce isomorphic transitions removed 759 transitions.
Graph (complete) has 1384 edges and 940 vertex of which 932 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 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 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 932 transition count 716
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 535 rules applied. Total rules applied 1032 place count 443 transition count 670
Reduce places removed 30 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 32 rules applied. Total rules applied 1064 place count 413 transition count 668
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 1067 place count 412 transition count 666
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 1071 place count 411 transition count 663
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 5 with 11 rules applied. Total rules applied 1082 place count 409 transition count 654
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1091 place count 400 transition count 654
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 53 Pre rules applied. Total rules applied 1091 place count 400 transition count 601
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 1197 place count 347 transition count 601
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1208 place count 336 transition count 585
Iterating global reduction 7 with 11 rules applied. Total rules applied 1219 place count 336 transition count 585
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 1220 place count 336 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1221 place count 335 transition count 584
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1221 place count 335 transition count 583
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1223 place count 334 transition count 583
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1228 place count 329 transition count 578
Iterating global reduction 9 with 5 rules applied. Total rules applied 1233 place count 329 transition count 578
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1238 place count 329 transition count 573
Performed 155 Post agglomeration using F-continuation condition with reduction of 85 identical transitions.
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 10 with 310 rules applied. Total rules applied 1548 place count 174 transition count 333
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 1570 place count 174 transition count 311
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1573 place count 171 transition count 308
Iterating global reduction 11 with 3 rules applied. Total rules applied 1576 place count 171 transition count 308
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 11 with 18 rules applied. Total rules applied 1594 place count 162 transition count 299
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1607 place count 162 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1611 place count 160 transition count 284
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1616 place count 160 transition count 279
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 13 with 2 rules applied. Total rules applied 1618 place count 159 transition count 278
Performed 35 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 13 with 70 rules applied. Total rules applied 1688 place count 124 transition count 313
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 13 with 26 rules applied. Total rules applied 1714 place count 124 transition count 287
Discarding 17 places :
Symmetric choice reduction at 14 with 17 rule applications. Total rules 1731 place count 107 transition count 253
Iterating global reduction 14 with 17 rules applied. Total rules applied 1748 place count 107 transition count 253
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 1755 place count 107 transition count 246
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1758 place count 104 transition count 240
Iterating global reduction 15 with 3 rules applied. Total rules applied 1761 place count 104 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1763 place count 104 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 16 with 23 rules applied. Total rules applied 1786 place count 104 transition count 215
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 1788 place count 102 transition count 213
Iterating global reduction 16 with 2 rules applied. Total rules applied 1790 place count 102 transition count 213
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 16 with 2 rules applied. Total rules applied 1792 place count 101 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1793 place count 101 transition count 211
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 1795 place count 101 transition count 209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 1797 place count 99 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1798 place count 99 transition count 208
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 17 with 10 rules applied. Total rules applied 1808 place count 99 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1809 place count 99 transition count 207
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 1813 place count 99 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1814 place count 99 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1815 place count 98 transition count 205
Applied a total of 1815 rules in 178 ms. Remains 98 /1544 variables (removed 1446) and now considering 205/1974 (removed 1769) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 98/1544 places, 205/1974 transitions.
RANDOM walk for 40000 steps (6023 resets) in 723 ms. (55 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40003 steps (152 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1441 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
[2026-05-23 01:34:41] [INFO ] Flow matrix only has 195 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-14620493028416501395.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15635461395115195022.kers'
[2026-05-23 01:34:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14620493028416501395.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15635461395115195022.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 98 cols 615 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-23 01:34:41] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15635461395115195022.kers
Total runtime 1 ms.
[2026-05-23 01:34:41] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 118/174 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/237 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/284 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/290 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/293 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/293 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/293 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 118/174 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 63/237 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 47/284 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/290 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/290 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/290 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/293 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/293 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/293 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 107 constraints, problems are : Problem set: 0 solved, 2 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 318ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 205/205 transitions.
Graph (trivial) has 69 edges and 98 vertex of which 14 / 98 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 91 transition count 179
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 80 transition count 179
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 23 place count 80 transition count 176
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 77 transition count 176
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 75 transition count 172
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 75 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 75 transition count 171
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 56 place count 64 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 62 place count 64 transition count 154
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 65 place count 61 transition count 147
Iterating global reduction 4 with 3 rules applied. Total rules applied 68 place count 61 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 70 place count 61 transition count 145
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 71 place count 60 transition count 144
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 60 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 74 place count 60 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 80 place count 57 transition count 141
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 84 place count 57 transition count 137
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 87 place count 54 transition count 133
Iterating global reduction 7 with 3 rules applied. Total rules applied 90 place count 54 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 92 place count 54 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 94 place count 53 transition count 130
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 99 place count 53 transition count 125
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 100 place count 52 transition count 124
Iterating global reduction 9 with 1 rules applied. Total rules applied 101 place count 52 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 102 place count 52 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 10 with 17 rules applied. Total rules applied 119 place count 52 transition count 106
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 120 place count 51 transition count 103
Iterating global reduction 10 with 1 rules applied. Total rules applied 121 place count 51 transition count 103
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 122 place count 50 transition count 102
Iterating global reduction 10 with 1 rules applied. Total rules applied 123 place count 50 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 124 place count 50 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 128 place count 48 transition count 99
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 129 place count 48 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 131 place count 48 transition count 96
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 132 place count 47 transition count 95
Iterating global reduction 12 with 1 rules applied. Total rules applied 133 place count 47 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 134 place count 47 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 135 place count 47 transition count 93
Free-agglomeration rule applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 138 place count 47 transition count 90
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 143 place count 44 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 144 place count 44 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 145 place count 44 transition count 87
Applied a total of 145 rules in 50 ms. Remains 44 /98 variables (removed 54) and now considering 87/205 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 44/98 places, 87/205 transitions.
RANDOM walk for 9512 steps (258 resets) in 29 ms. (317 steps per ms) remains 0/2 properties
FORMULA CloudReconfiguration-PT-303-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2147 edges and 1544 vertex of which 1536 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.25 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&(p1||G(p0)||(p2 U (G(p2)||(p2&&G(!p3)))))))))'
Support contains 5 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1525 transition count 1954
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1525 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 40 place count 1525 transition count 1952
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 1518 transition count 1945
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 1518 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 1515 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 1515 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 1512 transition count 1938
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 1512 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 1509 transition count 1934
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 1509 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 1507 transition count 1932
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 1507 transition count 1932
Applied a total of 76 rules in 564 ms. Remains 1507 /1544 variables (removed 37) and now considering 1932/1974 (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-15354853072982661782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11903305721577815830.kers'
[2026-05-23 01:34:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15354853072982661782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11903305721577815830.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1932 rows 1507 cols 4031 entries
Finished phase 1 with 1503 SingleSign rule and 1 generalized
[2026-05-23 01:34:43] [INFO ] Computed 3 invariants in 15 ms
Computed 3 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-11903305721577815830.kers
Total runtime 17 ms.
[2026-05-23 01:34:43] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-23 01:34:43] [INFO ] Invariant cache hit.
[2026-05-23 01:34:44] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2026-05-23 01:34:44] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3439 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3439 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60435ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1544 places, 1932/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62159 ms. Remains : 1507/1544 places, 1932/1974 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&(p1||G(p0)||(p2 U (G(p2)||(p2&&G(!p3)))))))))'
Stuttering acceptance computed with spot in 575 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), p3, (AND (NOT p0) p3)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 342 ms.
Product exploration explored 100000 steps with 25000 reset in 315 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2105 edges and 1507 vertex of which 1499 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge based reduction with 12 factoid took 100 ms. Reduced automaton from 12 states, 40 edges and 4 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (426 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (151 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 533405 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 533405 steps, saw 125080 distinct states, run finished after 3005 ms. (steps per millisecond=177 ) properties seen :0
[2026-05-23 01:35:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 681/682 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 802/1484 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3398 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3398 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/3405 variables, 5/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3405 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3411 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3411 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3417 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3417 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/3423 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3426 variables, 2/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/3438 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3438 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/3439 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3439 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/3439 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3439/3439 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1236 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 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) 681/682 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 802/1484 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3398 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3398 variables, 1/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3398 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/3405 variables, 5/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3405 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3411 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3411 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3417 variables, 3/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3417 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/3423 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3426 variables, 2/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3439/3439 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2046 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3293ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2987 steps, including 61 resets, run visited all 1 properties in 8 ms. (steps per millisecond=373 )
Parikh walk visited 1 properties in 13 ms.
Knowledge based reduction with 12 factoid took 59 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 6778 ms.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 1507 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1932/1932 transitions.
Applied a total of 0 rules in 53 ms. Remains 1507 /1507 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
[2026-05-23 01:35:52] [INFO ] Invariant cache hit.
[2026-05-23 01:35:53] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-23 01:35:53] [INFO ] Invariant cache hit.
[2026-05-23 01:35:53] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1134 ms. Remains : 1507/1507 places, 1932/1932 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2105 edges and 1507 vertex of which 1499 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge based reduction with 1 factoid took 49 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (444 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (146 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 540642 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 540642 steps, saw 126223 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2026-05-23 01:35:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 681/682 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 802/1484 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3398 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3398 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/3405 variables, 5/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3405 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3411 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3411 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3417 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3417 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/3423 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3426 variables, 2/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/3438 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3438 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/3439 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3439 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/3439 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3439/3439 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1221 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 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) 681/682 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 802/1484 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3398 variables, 1484/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3398 variables, 1/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3398 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/3405 variables, 5/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3405 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3411 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3411 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3417 variables, 3/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3417 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/3423 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3426 variables, 2/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3439/3439 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1991 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3221ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4902 steps, including 100 resets, run visited all 1 properties in 12 ms. (steps per millisecond=408 )
Parikh walk visited 1 properties in 12 ms.
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 6593 ms.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 240 ms.
Product exploration explored 100000 steps with 25000 reset in 249 ms.
Spot run failed in 122 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/ltsmin143030814251588740
[2026-05-23 01:36:01] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin143030814251588740
Running compilation step : cd /tmp/ltsmin143030814251588740;'/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/ltsmin143030814251588740;'/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/ltsmin143030814251588740;'/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 1 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1932/1932 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1506 transition count 1931
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1506 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1505 transition count 1930
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1505 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 1505 transition count 1929
Applied a total of 5 rules in 168 ms. Remains 1505 /1507 variables (removed 2) and now considering 1929/1932 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6055242128049795366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8845153530273615502.kers'
[2026-05-23 01:36:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6055242128049795366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8845153530273615502.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1929 rows 1505 cols 4025 entries
Finished phase 1 with 1501 SingleSign rule and 1 generalized
[2026-05-23 01:36:04] [INFO ] Computed 3 invariants in 16 ms
Computed 3 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-8845153530273615502.kers
Total runtime 21 ms.
[2026-05-23 01:36:05] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-23 01:36:05] [INFO ] Invariant cache hit.
[2026-05-23 01:36:06] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 01:36:06] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3434 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 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/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3434 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1507 places, 1929/1932 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61800 ms. Remains : 1505/1507 places, 1929/1932 transitions.
Built C files in :
/tmp/ltsmin2122867089113447738
[2026-05-23 01:37:06] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2122867089113447738
Running compilation step : cd /tmp/ltsmin2122867089113447738;'/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/ltsmin2122867089113447738;'/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/ltsmin2122867089113447738;'/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:37:09] [INFO ] Flatten gal took : 49 ms
[2026-05-23 01:37:09] [INFO ] Flatten gal took : 44 ms
[2026-05-23 01:37:09] [INFO ] Time to serialize gal into /tmp/LTL6881624956219573698.gal : 14 ms
[2026-05-23 01:37:09] [INFO ] Time to serialize properties into /tmp/LTL17487650686848732180.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/LTL6881624956219573698.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8702904887749904864.hoa' '-atoms' '/tmp/LTL17487650686848732180.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17487650686848732180.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8702904887749904864.hoa
Detected timeout of ITS tools.
[2026-05-23 01:37:24] [INFO ] Flatten gal took : 38 ms
[2026-05-23 01:37:24] [INFO ] Flatten gal took : 34 ms
[2026-05-23 01:37:24] [INFO ] Time to serialize gal into /tmp/LTL10355235246051565353.gal : 8 ms
[2026-05-23 01:37:24] [INFO ] Time to serialize properties into /tmp/LTL10478946478811187211.ltl : 3 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/LTL10355235246051565353.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10478946478811187211.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((X("(p1099==0)"))&&((("(p2550==0)")||(G("(p1099==0)")))||(("(p292!=1)")U((G("(p292!=1)"))||(("(p292!=1)")&&(G(!("((p572==1)&&(p...176
Formula 0 simplified : XX(X!"(p1099==0)" | (!"(p2550==0)" & F!"(p1099==0)" & (F"((p572==1)&&(p1459==1))" U !"(p292!=1)")))
Detected timeout of ITS tools.
[2026-05-23 01:37:39] [INFO ] Flatten gal took : 28 ms
[2026-05-23 01:37:39] [INFO ] Applying decomposition
[2026-05-23 01:37:39] [INFO ] Flatten gal took : 28 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/graph545567750835611402.txt' '-o' '/tmp/graph545567750835611402.bin' '-w' '/tmp/graph545567750835611402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph545567750835611402.bin' '-l' '-1' '-v' '-w' '/tmp/graph545567750835611402.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:37:40] [INFO ] Decomposing Gal with order
[2026-05-23 01:37:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:37:40] [INFO ] Removed a total of 517 redundant transitions.
[2026-05-23 01:37:40] [INFO ] Flatten gal took : 122 ms
[2026-05-23 01:37:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 34 ms.
[2026-05-23 01:37:40] [INFO ] Time to serialize gal into /tmp/LTL18380250813196841158.gal : 20 ms
[2026-05-23 01:37:40] [INFO ] Time to serialize properties into /tmp/LTL12796868536053993532.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/LTL18380250813196841158.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12796868536053993532.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X((X("(i8.u126.p1099==0)"))&&((("(i36.i0.i2.u606.p2550==0)")||(G("(i8.u126.p1099==0)")))||(("(i5.u53.p292!=1)")U((G("(i5.u53.p292...258
Formula 0 simplified : XX(X!"(i8.u126.p1099==0)" | (!"(i36.i0.i2.u606.p2550==0)" & F!"(i8.u126.p1099==0)" & (F"((i18.i0.i0.u106.p572==1)&&(i23.i1.i0.u343.p...190
Reverse transition relation is NOT exact ! Due to transitions t26, t181, t210, t262, t293, t322, t372, t444, t496, t687, t739, t770, t849, t1141, t1226, t1...2036
Computing Next relation with stutter on 32080 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
228 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,2.45024,107104,1,0,137143,6763,18775,229354,513,35205,827093
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-303-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-303-LTLFireability-02 finished in 180837 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((p1&&G(p2)))))'
Support contains 3 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1526 transition count 1956
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1526 transition count 1956
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 1526 transition count 1953
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 1520 transition count 1947
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 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 52 place count 1520 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 1517 transition count 1943
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 1517 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 1514 transition count 1939
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 1514 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 1511 transition count 1935
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 1509 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 1509 transition count 1933
Applied a total of 74 rules in 400 ms. Remains 1509 /1544 variables (removed 35) and now considering 1933/1974 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4259903388651712936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5434940835169131821.kers'
[2026-05-23 01:37:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4259903388651712936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5434940835169131821.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1933 rows 1509 cols 4033 entries
Finished phase 1 with 1505 SingleSign rule and 1 generalized
[2026-05-23 01:37:43] [INFO ] Computed 3 invariants in 14 ms
Computed 3 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-5434940835169131821.kers
Total runtime 16 ms.
[2026-05-23 01:37:43] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-23 01:37:43] [INFO ] Invariant cache hit.
[2026-05-23 01:37:44] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2026-05-23 01:37:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 3/3 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 3 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 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, 3/3 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 3 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3/3 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 60445ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60449ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1544 places, 1933/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61993 ms. Remains : 1509/1544 places, 1933/1974 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((p1&&G(p2)))))'
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (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-303-LTLFireability-03
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-03 finished in 62222 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(((F(p0) U p1)&&X(p2))))'
Support contains 3 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1525 transition count 1954
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1525 transition count 1954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 1525 transition count 1951
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 1519 transition count 1945
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 1519 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 54 place count 1519 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 1517 transition count 1942
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 1517 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 1515 transition count 1940
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 1515 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 1513 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1512 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1512 transition count 1937
Applied a total of 68 rules in 409 ms. Remains 1512 /1544 variables (removed 32) and now considering 1937/1974 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7456065296834971025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17874327808753187375.kers'
[2026-05-23 01:38:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7456065296834971025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17874327808753187375.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1937 rows 1512 cols 4041 entries
Finished phase 1 with 1508 SingleSign rule and 1 generalized
[2026-05-23 01:38:45] [INFO ] Computed 3 invariants in 15 ms
Computed 3 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-17874327808753187375.kers
Total runtime 19 ms.
[2026-05-23 01:38:46] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-23 01:38:46] [INFO ] Invariant cache hit.
[2026-05-23 01:38:47] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2026-05-23 01:38:47] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3449 variables, and 3 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 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/1511 variables, 3/3 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 1511/3449 variables, and 3 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60441ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60445ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1544 places, 1937/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62058 ms. Remains : 1512/1544 places, 1937/1974 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(((F(p0) U p1)&&X(p2))))'
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-04
Stuttering criterion allowed to conclude after 208 steps with 2 reset in 1 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-04 finished in 62343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Graph (trivial) has 1886 edges and 1544 vertex of which 702 / 1544 are part of one of the 63 SCC in 4 ms
Free SCC test removed 639 places
Ensure Unique test removed 744 transitions
Reduce isomorphic transitions removed 744 transitions.
Graph (complete) has 1398 edges and 905 vertex of which 897 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 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 498 transitions
Trivial Post-agglo rules discarded 498 transitions
Performed 498 trivial Post agglomeration. Transition count delta: 498
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 896 transition count 726
Reduce places removed 498 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 523 rules applied. Total rules applied 1023 place count 398 transition count 701
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1035 place count 386 transition count 701
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1035 place count 386 transition count 655
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 1127 place count 340 transition count 655
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1142 place count 325 transition count 631
Iterating global reduction 3 with 15 rules applied. Total rules applied 1157 place count 325 transition count 631
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 1 rules applied. Total rules applied 1158 place count 325 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1159 place count 324 transition count 630
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1159 place count 324 transition count 629
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1161 place count 323 transition count 629
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1170 place count 314 transition count 616
Iterating global reduction 5 with 9 rules applied. Total rules applied 1179 place count 314 transition count 616
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1184 place count 314 transition count 611
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1186 place count 312 transition count 607
Iterating global reduction 6 with 2 rules applied. Total rules applied 1188 place count 312 transition count 607
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1190 place count 310 transition count 603
Iterating global reduction 6 with 2 rules applied. Total rules applied 1192 place count 310 transition count 603
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1194 place count 308 transition count 599
Iterating global reduction 6 with 2 rules applied. Total rules applied 1196 place count 308 transition count 599
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1198 place count 306 transition count 595
Iterating global reduction 6 with 2 rules applied. Total rules applied 1200 place count 306 transition count 595
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1202 place count 304 transition count 591
Iterating global reduction 6 with 2 rules applied. Total rules applied 1204 place count 304 transition count 591
Performed 146 Post agglomeration using F-continuation condition with reduction of 90 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 1496 place count 158 transition count 355
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1507 place count 158 transition count 344
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1514 place count 151 transition count 328
Iterating global reduction 7 with 7 rules applied. Total rules applied 1521 place count 151 transition count 328
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1522 place count 150 transition count 327
Iterating global reduction 7 with 1 rules applied. Total rules applied 1523 place count 150 transition count 327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1524 place count 150 transition count 326
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1546 place count 139 transition count 314
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1557 place count 139 transition count 303
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
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 1591 place count 122 transition count 337
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1608 place count 122 transition count 320
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1617 place count 113 transition count 302
Iterating global reduction 10 with 9 rules applied. Total rules applied 1626 place count 113 transition count 302
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1632 place count 113 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 11 with 35 rules applied. Total rules applied 1667 place count 113 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1668 place count 112 transition count 260
Applied a total of 1668 rules in 118 ms. Remains 112 /1544 variables (removed 1432) and now considering 260/1974 (removed 1714) transitions.
[2026-05-23 01:39:47] [INFO ] Flow matrix only has 203 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-12875342019782392013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11920901606892265976.kers'
[2026-05-23 01:39:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12875342019782392013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11920901606892265976.kers]
Normalized transition count is 202 out of 203 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 112 cols 596 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-23 01:39:47] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11920901606892265976.kers
Total runtime 4 ms.
[2026-05-23 01:39:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 01:39:47] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2026-05-23 01:39:47] [INFO ] Invariant cache hit.
[2026-05-23 01:39:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:39:48] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [8, 41, 75]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 161 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/1544 places, 260/1974 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 257
Applied a total of 4 rules in 7 ms. Remains 106 /109 variables (removed 3) and now considering 257/260 (removed 3) transitions.
[2026-05-23 01:39:48] [INFO ] Flow matrix only has 200 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-11221420608677894022.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14781693666768950373.kers'
[2026-05-23 01:39:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11221420608677894022.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14781693666768950373.kers]
Normalized transition count is 199 out of 200 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 106 cols 595 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-23 01:39:48] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14781693666768950373.kers
Total runtime 1 ms.
[2026-05-23 01:39:48] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-23 01:39:48] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2026-05-23 01:39:48] [INFO ] Invariant cache hit.
[2026-05-23 01:39:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 01:39:48] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/1544 places, 257/1974 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 402 ms. Remains : 106/1544 places, 257/1974 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-05 finished in 482 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(((G(p0) U p1) U (F(p2) U p3)))))'
Support contains 4 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1525 transition count 1954
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1525 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 40 place count 1525 transition count 1952
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 1517 transition count 1944
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 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 57 place count 1517 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 1514 transition count 1940
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 1514 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 1511 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 1511 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 1508 transition count 1932
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 1508 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 1506 transition count 1930
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 1506 transition count 1930
Applied a total of 79 rules in 424 ms. Remains 1506 /1544 variables (removed 38) and now considering 1930/1974 (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-16704939626940310047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3708996690687594936.kers'
[2026-05-23 01:39:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16704939626940310047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3708996690687594936.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1930 rows 1506 cols 4027 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 01:39:48] [INFO ] Computed 3 invariants in 8 ms
Computed 3 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-3708996690687594936.kers
Total runtime 11 ms.
[2026-05-23 01:39:48] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-23 01:39:48] [INFO ] Invariant cache hit.
[2026-05-23 01:39:49] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2026-05-23 01:39:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3436 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 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/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3436 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60419ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1544 places, 1930/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61973 ms. Remains : 1506/1544 places, 1930/1974 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(((G(p0) U p1) U (F(p2) U p3)))))'
Stuttering acceptance computed with spot in 273 ms :[(NOT p3), (NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p3)), (NOT p3)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-06
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-06 finished in 62314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1))))'
Support contains 3 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1525 transition count 1954
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1525 transition count 1954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 1525 transition count 1951
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 1517 transition count 1943
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 1517 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 1517 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 1514 transition count 1939
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 1514 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 1511 transition count 1935
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 1511 transition count 1935
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 1508 transition count 1931
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 1508 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 1506 transition count 1929
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 1506 transition count 1929
Applied a total of 80 rules in 404 ms. Remains 1506 /1544 variables (removed 38) and now considering 1929/1974 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11975649851813007674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2917106257639951138.kers'
[2026-05-23 01:40:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11975649851813007674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2917106257639951138.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1929 rows 1506 cols 4025 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 01:40:51] [INFO ] Computed 3 invariants in 14 ms
Computed 3 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-2917106257639951138.kers
Total runtime 18 ms.
[2026-05-23 01:40:51] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-23 01:40:51] [INFO ] Invariant cache hit.
[2026-05-23 01:40:52] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 01:40:52] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 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/1505 variables, 3/3 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 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1544 places, 1929/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61948 ms. Remains : 1506/1544 places, 1929/1974 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1))))'
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-07
Product exploration explored 100000 steps with 1094 reset in 188 ms.
Product exploration explored 100000 steps with 1091 reset in 199 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2102 edges and 1506 vertex of which 1498 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge based reduction with 6 factoid took 49 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (429 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (144 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 542274 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 542274 steps, saw 126372 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2026-05-23 01:41:56] [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) 1079/1081 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1081 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 402/1483 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1483 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1911/3394 variables, 1483/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3394 variables, 0/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/3401 variables, 5/1491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3401 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3407 variables, 3/1494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3407 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3413 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3413 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/3419 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3419 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3422 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3424 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3424 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3426 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3435/3435 variables, and 1509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1206 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1506 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) 1079/1081 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1081 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 402/1483 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1483 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1911/3394 variables, 1483/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3394 variables, 1/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3394 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/3401 variables, 5/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3401 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3407 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3407 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3413 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3413 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/3419 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3419 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3422 variables, 2/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3435/3435 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2267 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3481ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 1929/1929 transitions.
Graph (trivial) has 1839 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1301 edges and 876 vertex of which 868 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 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 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 868 transition count 635
Reduce places removed 487 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 547 rules applied. Total rules applied 1043 place count 381 transition count 575
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1083 place count 342 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1084 place count 341 transition count 574
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1084 place count 341 transition count 526
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1180 place count 293 transition count 526
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1191 place count 282 transition count 510
Iterating global reduction 4 with 11 rules applied. Total rules applied 1202 place count 282 transition count 510
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 1205 place count 282 transition count 507
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1208 place count 279 transition count 507
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1216 place count 271 transition count 497
Iterating global reduction 6 with 8 rules applied. Total rules applied 1224 place count 271 transition count 497
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1230 place count 271 transition count 491
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1232 place count 269 transition count 479
Iterating global reduction 7 with 2 rules applied. Total rules applied 1234 place count 269 transition count 479
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 1235 place count 269 transition count 478
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1236 place count 268 transition count 478
Performed 142 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 9 with 284 rules applied. Total rules applied 1520 place count 126 transition count 241
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 13 rules applied. Total rules applied 1533 place count 126 transition count 228
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 1535 place count 125 transition count 227
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1538 place count 122 transition count 224
Iterating global reduction 11 with 3 rules applied. Total rules applied 1541 place count 122 transition count 224
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 1567 place count 109 transition count 208
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 1582 place count 109 transition count 193
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1648 place count 76 transition count 223
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 12 with 56 rules applied. Total rules applied 1704 place count 76 transition count 167
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 1728 place count 52 transition count 143
Iterating global reduction 13 with 24 rules applied. Total rules applied 1752 place count 52 transition count 143
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 1765 place count 52 transition count 130
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1771 place count 46 transition count 118
Iterating global reduction 14 with 6 rules applied. Total rules applied 1777 place count 46 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1782 place count 46 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 15 with 32 rules applied. Total rules applied 1814 place count 46 transition count 81
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1817 place count 43 transition count 72
Iterating global reduction 15 with 3 rules applied. Total rules applied 1820 place count 43 transition count 72
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1823 place count 40 transition count 69
Iterating global reduction 15 with 3 rules applied. Total rules applied 1826 place count 40 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1829 place count 40 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1832 place count 40 transition count 63
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 1836 place count 40 transition count 59
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 1840 place count 36 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1841 place count 36 transition count 58
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1842 place count 36 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1843 place count 35 transition count 57
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 1844 place count 35 transition count 56
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1845 place count 35 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1846 place count 34 transition count 55
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1455.t1456.t1457.t1458.t1459.t1460.t1461.t1462.t1463.t1925.t1701.t1702.t1703.t1704.t1705.t1781.t1782.t1783.t1784.t1786.t1830 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 30 edges and 32 vertex of which 19 / 32 are part of one of the 7 SCC in 0 ms
Free SCC test removed 12 places
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 18 with 4 rules applied. Total rules applied 1850 place count 20 transition count 52
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 19 with 28 rules applied. Total rules applied 1878 place count 19 transition count 25
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 1880 place count 17 transition count 23
Iterating global reduction 20 with 2 rules applied. Total rules applied 1882 place count 17 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 20 with 6 rules applied. Total rules applied 1888 place count 14 transition count 20
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 1893 place count 14 transition count 15
Free-agglomeration rule applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 1895 place count 14 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 1897 place count 12 transition count 13
Applied a total of 1897 rules in 55 ms. Remains 12 /1506 variables (removed 1494) and now considering 13/1929 (removed 1916) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 12/1506 places, 13/1929 transitions.
RANDOM walk for 37 steps (5 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G p1)
Knowledge based reduction with 6 factoid took 36 ms. Proved property starting from automaton with 5 states, 6 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 6747 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-07 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property CloudReconfiguration-PT-303-LTLFireability-07 finished in 69339 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(F(p0)))))'
Support contains 1 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1523 transition count 1952
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1523 transition count 1952
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 1523 transition count 1949
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 1515 transition count 1941
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 1515 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 1515 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 1512 transition count 1937
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 1512 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 1509 transition count 1933
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 1509 transition count 1933
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 1506 transition count 1929
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 1506 transition count 1929
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 1504 transition count 1927
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 1504 transition count 1927
Applied a total of 84 rules in 400 ms. Remains 1504 /1544 variables (removed 40) and now considering 1927/1974 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17512975328053920409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16565014107509947290.kers'
[2026-05-23 01:42:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17512975328053920409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16565014107509947290.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1927 rows 1504 cols 4021 entries
Finished phase 1 with 1500 SingleSign rule and 1 generalized
[2026-05-23 01:42:00] [INFO ] Computed 3 invariants in 15 ms
Computed 3 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-16565014107509947290.kers
Total runtime 18 ms.
[2026-05-23 01:42:00] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-23 01:42:00] [INFO ] Invariant cache hit.
[2026-05-23 01:42:01] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2026-05-23 01:42:01] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 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/1503 variables, 3/3 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 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1544 places, 1927/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61939 ms. Remains : 1504/1544 places, 1927/1974 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(F(p0)))))'
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-08
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-08 finished in 62125 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||X(X(X(X(F(p1)))))))))'
Support contains 2 out of 1544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Graph (trivial) has 1884 edges and 1544 vertex of which 702 / 1544 are part of one of the 63 SCC in 1 ms
Free SCC test removed 639 places
Ensure Unique test removed 744 transitions
Reduce isomorphic transitions removed 744 transitions.
Graph (complete) has 1398 edges and 905 vertex of which 897 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 896 transition count 728
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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 521 rules applied. Total rules applied 1019 place count 400 transition count 703
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1031 place count 388 transition count 703
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1031 place count 388 transition count 657
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 1123 place count 342 transition count 657
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1138 place count 327 transition count 633
Iterating global reduction 3 with 15 rules applied. Total rules applied 1153 place count 327 transition count 633
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 1 rules applied. Total rules applied 1154 place count 327 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1155 place count 326 transition count 632
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1155 place count 326 transition count 631
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1157 place count 325 transition count 631
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1166 place count 316 transition count 618
Iterating global reduction 5 with 9 rules applied. Total rules applied 1175 place count 316 transition count 618
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1180 place count 316 transition count 613
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1182 place count 314 transition count 609
Iterating global reduction 6 with 2 rules applied. Total rules applied 1184 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1186 place count 312 transition count 605
Iterating global reduction 6 with 2 rules applied. Total rules applied 1188 place count 312 transition count 605
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1190 place count 310 transition count 601
Iterating global reduction 6 with 2 rules applied. Total rules applied 1192 place count 310 transition count 601
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1194 place count 308 transition count 597
Iterating global reduction 6 with 2 rules applied. Total rules applied 1196 place count 308 transition count 597
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1198 place count 306 transition count 593
Iterating global reduction 6 with 2 rules applied. Total rules applied 1200 place count 306 transition count 593
Performed 146 Post agglomeration using F-continuation condition with reduction of 89 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 1492 place count 160 transition count 358
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1503 place count 160 transition count 347
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1510 place count 153 transition count 331
Iterating global reduction 7 with 7 rules applied. Total rules applied 1517 place count 153 transition count 331
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1518 place count 152 transition count 330
Iterating global reduction 7 with 1 rules applied. Total rules applied 1519 place count 152 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1520 place count 152 transition count 329
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1542 place count 141 transition count 317
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1553 place count 141 transition count 306
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
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 124 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1604 place count 124 transition count 323
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1613 place count 115 transition count 305
Iterating global reduction 10 with 9 rules applied. Total rules applied 1622 place count 115 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1628 place count 115 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 11 with 36 rules applied. Total rules applied 1664 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1665 place count 114 transition count 262
Applied a total of 1665 rules in 66 ms. Remains 114 /1544 variables (removed 1430) and now considering 262/1974 (removed 1712) transitions.
[2026-05-23 01:43:02] [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-9099367701959820226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13864496336590018007.kers'
[2026-05-23 01:43:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9099367701959820226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13864496336590018007.kers]
Normalized transition count is 204 out of 205 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 114 cols 602 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 01:43:02] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13864496336590018007.kers
Total runtime 2 ms.
[2026-05-23 01:43:02] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 01:43:02] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2026-05-23 01:43:02] [INFO ] Invariant cache hit.
[2026-05-23 01:43:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:43:02] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [8, 41, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 168 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/1544 places, 262/1974 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 259
Applied a total of 4 rules in 5 ms. Remains 108 /111 variables (removed 3) and now considering 259/262 (removed 3) transitions.
[2026-05-23 01:43:02] [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-6450966172597152905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5698068532589252144.kers'
[2026-05-23 01:43:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6450966172597152905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5698068532589252144.kers]
Normalized transition count is 201 out of 202 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 108 cols 601 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-23 01:43:02] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5698068532589252144.kers
Total runtime 1 ms.
[2026-05-23 01:43:02] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 01:43:02] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2026-05-23 01:43:02] [INFO ] Invariant cache hit.
[2026-05-23 01:43:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 01:43:02] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/1544 places, 259/1974 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 378 ms. Remains : 108/1544 places, 259/1974 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||X(X(X(X(F(p1)))))))))'
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-10 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||(X(X(X(p1))) U G(p2))))))'
Support contains 3 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1525 transition count 1954
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1525 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 40 place count 1525 transition count 1952
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 1517 transition count 1944
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 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 57 place count 1517 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 1514 transition count 1940
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 1514 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 1511 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 1511 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 1508 transition count 1932
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 1508 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 1506 transition count 1930
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 1506 transition count 1930
Applied a total of 79 rules in 412 ms. Remains 1506 /1544 variables (removed 38) and now considering 1930/1974 (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-10885980629878713890.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6536739644663499299.kers'
[2026-05-23 01:43:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10885980629878713890.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6536739644663499299.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1930 rows 1506 cols 4027 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 01:43:03] [INFO ] Computed 3 invariants in 15 ms
Computed 3 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-6536739644663499299.kers
Total runtime 19 ms.
[2026-05-23 01:43:03] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-23 01:43:03] [INFO ] Invariant cache hit.
[2026-05-23 01:43:04] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2026-05-23 01:43:04] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3436 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 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/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3436 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60453ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60455ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1544 places, 1930/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62040 ms. Remains : 1506/1544 places, 1930/1974 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||(X(X(X(p1))) U G(p2))))))'
Stuttering acceptance computed with spot in 452 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-11
Product exploration explored 100000 steps with 14267 reset in 249 ms.
Product exploration explored 100000 steps with 14292 reset in 259 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2103 edges and 1506 vertex of which 1498 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge based reduction with 17 factoid took 98 ms. Reduced automaton from 11 states, 22 edges and 3 AP (stutter sensitive) to 11 states, 19 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (427 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (147 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (142 resets) in 131 ms. (303 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40000 steps (144 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (153 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
[2026-05-23 01:44:05] [INFO ] Invariant cache hit.
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) 1481/1483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1483 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1912/3395 variables, 1483/1486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3395 variables, 0/1486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/3402 variables, 5/1491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3402 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/3408 variables, 3/1494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3408 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/3414 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3414 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/3420 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3420 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/3423 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 1509 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4065 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1506 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) 1481/1483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1483 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1912/3395 variables, 1483/1486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3395 variables, 3/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3395 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/3402 variables, 5/1494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3402 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/3408 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3408 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/3414 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3414 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/3420 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/3423 variables, 2/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/3436 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3436 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/3436 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3436/3436 variables, and 1512 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9090ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 231 ms.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 1930/1930 transitions.
Graph (trivial) has 1840 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 0 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1302 edges and 876 vertex of which 868 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 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 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 868 transition count 635
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 545 rules applied. Total rules applied 1042 place count 380 transition count 578
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1079 place count 343 transition count 578
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1079 place count 343 transition count 529
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1177 place count 294 transition count 529
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1188 place count 283 transition count 513
Iterating global reduction 3 with 11 rules applied. Total rules applied 1199 place count 283 transition count 513
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 3 rules applied. Total rules applied 1202 place count 283 transition count 510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1205 place count 280 transition count 510
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1212 place count 273 transition count 502
Iterating global reduction 5 with 7 rules applied. Total rules applied 1219 place count 273 transition count 502
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1225 place count 273 transition count 496
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1226 place count 272 transition count 490
Iterating global reduction 6 with 1 rules applied. Total rules applied 1227 place count 272 transition count 490
Performed 144 Post agglomeration using F-continuation condition with reduction of 93 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 6 with 288 rules applied. Total rules applied 1515 place count 128 transition count 253
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1530 place count 128 transition count 238
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1533 place count 125 transition count 235
Iterating global reduction 7 with 3 rules applied. Total rules applied 1536 place count 125 transition count 235
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 7 with 26 rules applied. Total rules applied 1562 place count 112 transition count 219
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1577 place count 112 transition count 204
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 8 with 2 rules applied. Total rules applied 1579 place count 111 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1581 place count 111 transition count 201
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 9 with 2 rules applied. Total rules applied 1583 place count 110 transition count 200
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1585 place count 110 transition count 198
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1651 place count 77 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 10 with 47 rules applied. Total rules applied 1698 place count 77 transition count 181
Discarding 23 places :
Symmetric choice reduction at 11 with 23 rule applications. Total rules 1721 place count 54 transition count 151
Iterating global reduction 11 with 23 rules applied. Total rules applied 1744 place count 54 transition count 151
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1758 place count 54 transition count 137
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1764 place count 48 transition count 125
Iterating global reduction 12 with 6 rules applied. Total rules applied 1770 place count 48 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1776 place count 48 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 13 with 22 rules applied. Total rules applied 1798 place count 48 transition count 97
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1800 place count 46 transition count 91
Iterating global reduction 13 with 2 rules applied. Total rules applied 1802 place count 46 transition count 91
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1804 place count 44 transition count 89
Iterating global reduction 13 with 2 rules applied. Total rules applied 1806 place count 44 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1808 place count 44 transition count 87
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 14 with 2 rules applied. Total rules applied 1810 place count 43 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1812 place count 43 transition count 84
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 1815 place count 43 transition count 81
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1819 place count 40 transition count 80
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1821 place count 40 transition count 80
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 1822 place count 40 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1823 place count 39 transition count 78
Applied a total of 1823 rules in 47 ms. Remains 39 /1506 variables (removed 1467) and now considering 78/1930 (removed 1852) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 39/1506 places, 78/1930 transitions.
RANDOM walk for 4656 steps (147 resets) in 10 ms. (423 steps per ms) remains 0/3 properties
Knowledge based reduction with 17 factoid took 125 ms. Reduced automaton from 11 states, 19 edges and 2 AP (stutter sensitive) to 11 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Knowledge-based reduction took 10157 ms.
Stuttering acceptance computed with spot in 433 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Support contains 2 out of 1506 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1930/1930 transitions.
Applied a total of 0 rules in 60 ms. Remains 1506 /1506 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2026-05-23 01:44:16] [INFO ] Invariant cache hit.
[2026-05-23 01:44:16] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-23 01:44:16] [INFO ] Invariant cache hit.
[2026-05-23 01:44:17] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1095 ms. Remains : 1506/1506 places, 1930/1930 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2103 edges and 1506 vertex of which 1498 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 11 states, 19 edges and 2 AP (stutter sensitive) to 11 states, 19 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (420 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (155 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (135 resets) in 49 ms. (800 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (137 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (136 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
[2026-05-23 01:44:17] [INFO ] Invariant cache hit.
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) 1481/1483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1483 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1912/3395 variables, 1483/1486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3395 variables, 0/1486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/3402 variables, 5/1491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3402 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/3408 variables, 3/1494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3408 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/3414 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3414 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/3420 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3420 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/3423 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 1509 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4135 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1506 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) 1481/1483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1483 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1912/3395 variables, 1483/1486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3395 variables, 3/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3395 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/3402 variables, 5/1494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3402 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/3408 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3408 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/3414 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3414 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/3420 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/3423 variables, 2/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/3436 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3436 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/3436 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3436/3436 variables, and 1512 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4864 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9008ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 278 ms.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 1930/1930 transitions.
Graph (trivial) has 1840 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 0 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1302 edges and 876 vertex of which 868 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 868 transition count 635
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 545 rules applied. Total rules applied 1042 place count 380 transition count 578
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1079 place count 343 transition count 578
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1079 place count 343 transition count 529
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1177 place count 294 transition count 529
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1188 place count 283 transition count 513
Iterating global reduction 3 with 11 rules applied. Total rules applied 1199 place count 283 transition count 513
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 3 rules applied. Total rules applied 1202 place count 283 transition count 510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1205 place count 280 transition count 510
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1212 place count 273 transition count 502
Iterating global reduction 5 with 7 rules applied. Total rules applied 1219 place count 273 transition count 502
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1225 place count 273 transition count 496
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1226 place count 272 transition count 490
Iterating global reduction 6 with 1 rules applied. Total rules applied 1227 place count 272 transition count 490
Performed 144 Post agglomeration using F-continuation condition with reduction of 93 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 6 with 288 rules applied. Total rules applied 1515 place count 128 transition count 253
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1530 place count 128 transition count 238
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1533 place count 125 transition count 235
Iterating global reduction 7 with 3 rules applied. Total rules applied 1536 place count 125 transition count 235
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 7 with 26 rules applied. Total rules applied 1562 place count 112 transition count 219
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1577 place count 112 transition count 204
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 8 with 2 rules applied. Total rules applied 1579 place count 111 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1581 place count 111 transition count 201
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 9 with 2 rules applied. Total rules applied 1583 place count 110 transition count 200
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1585 place count 110 transition count 198
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1651 place count 77 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 10 with 47 rules applied. Total rules applied 1698 place count 77 transition count 181
Discarding 23 places :
Symmetric choice reduction at 11 with 23 rule applications. Total rules 1721 place count 54 transition count 151
Iterating global reduction 11 with 23 rules applied. Total rules applied 1744 place count 54 transition count 151
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1758 place count 54 transition count 137
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1764 place count 48 transition count 125
Iterating global reduction 12 with 6 rules applied. Total rules applied 1770 place count 48 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1776 place count 48 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 13 with 22 rules applied. Total rules applied 1798 place count 48 transition count 97
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1800 place count 46 transition count 91
Iterating global reduction 13 with 2 rules applied. Total rules applied 1802 place count 46 transition count 91
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1804 place count 44 transition count 89
Iterating global reduction 13 with 2 rules applied. Total rules applied 1806 place count 44 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1808 place count 44 transition count 87
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 14 with 2 rules applied. Total rules applied 1810 place count 43 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1812 place count 43 transition count 84
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 1815 place count 43 transition count 81
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1819 place count 40 transition count 80
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1821 place count 40 transition count 80
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 1822 place count 40 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1823 place count 39 transition count 78
Applied a total of 1823 rules in 41 ms. Remains 39 /1506 variables (removed 1467) and now considering 78/1930 (removed 1852) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 39/1506 places, 78/1930 transitions.
RANDOM walk for 4104 steps (137 resets) in 8 ms. (456 steps per ms) remains 0/3 properties
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 11 states, 19 edges and 2 AP (stutter sensitive) to 11 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Knowledge-based reduction took 9997 ms.
Stuttering acceptance computed with spot in 360 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 421 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 14325 reset in 193 ms.
Product exploration explored 100000 steps with 14243 reset in 194 ms.
Spot run failed in 46 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/ltsmin14533570788492233812
[2026-05-23 01:44:28] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14533570788492233812
Running compilation step : cd /tmp/ltsmin14533570788492233812;'/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/ltsmin14533570788492233812;'/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/ltsmin14533570788492233812;'/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 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1930/1930 transitions.
Applied a total of 0 rules in 52 ms. Remains 1506 /1506 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2026-05-23 01:44:31] [INFO ] Invariant cache hit.
[2026-05-23 01:44:31] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-23 01:44:31] [INFO ] Invariant cache hit.
[2026-05-23 01:44:32] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1151 ms. Remains : 1506/1506 places, 1930/1930 transitions.
Built C files in :
/tmp/ltsmin18307811153888540800
[2026-05-23 01:44:32] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18307811153888540800
Running compilation step : cd /tmp/ltsmin18307811153888540800;'/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/ltsmin18307811153888540800;'/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/ltsmin18307811153888540800;'/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:44:35] [INFO ] Flatten gal took : 23 ms
[2026-05-23 01:44:35] [INFO ] Flatten gal took : 26 ms
[2026-05-23 01:44:35] [INFO ] Time to serialize gal into /tmp/LTL14746111799921766069.gal : 9 ms
[2026-05-23 01:44:35] [INFO ] Time to serialize properties into /tmp/LTL13004559433923816906.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/LTL14746111799921766069.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15628551797752579896.hoa' '-atoms' '/tmp/LTL13004559433923816906.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...320
Loading property file /tmp/LTL13004559433923816906.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15628551797752579896.hoa
Detected timeout of ITS tools.
[2026-05-23 01:44:50] [INFO ] Flatten gal took : 21 ms
[2026-05-23 01:44:51] [INFO ] Flatten gal took : 23 ms
[2026-05-23 01:44:51] [INFO ] Time to serialize gal into /tmp/LTL573448072245169521.gal : 8 ms
[2026-05-23 01:44:51] [INFO ] Time to serialize properties into /tmp/LTL4887494908901224126.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/LTL573448072245169521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4887494908901224126.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...274
Read 1 LTL properties
Checking formula 0 : !((X(("(p2095==1)")U(("(p2320==1)")||((X(X(X("(p2320==1)"))))U(G("(p313!=1)")))))))
Formula 0 simplified : X(!"(p2095==1)" R (!"(p2320==1)" & (XXX!"(p2320==1)" R F!"(p313!=1)")))
Detected timeout of ITS tools.
[2026-05-23 01:45:06] [INFO ] Flatten gal took : 21 ms
[2026-05-23 01:45:06] [INFO ] Applying decomposition
[2026-05-23 01:45:06] [INFO ] Flatten gal took : 21 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/graph3481637511520670968.txt' '-o' '/tmp/graph3481637511520670968.bin' '-w' '/tmp/graph3481637511520670968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3481637511520670968.bin' '-l' '-1' '-v' '-w' '/tmp/graph3481637511520670968.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:45:06] [INFO ] Decomposing Gal with order
[2026-05-23 01:45:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:45:06] [INFO ] Removed a total of 512 redundant transitions.
[2026-05-23 01:45:06] [INFO ] Flatten gal took : 57 ms
[2026-05-23 01:45:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 22 ms.
[2026-05-23 01:45:06] [INFO ] Time to serialize gal into /tmp/LTL6704969830872953358.gal : 15 ms
[2026-05-23 01:45:06] [INFO ] Time to serialize properties into /tmp/LTL13702008449521492300.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/LTL6704969830872953358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13702008449521492300.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(("(i31.u506.p2095==1)")U(("(i38.i1.i3.u465.p2320==1)")||((X(X(X("(i38.i1.i3.u465.p2320==1)"))))U(G("(i4.u54.p313!=1)")))))))
Formula 0 simplified : X(!"(i31.u506.p2095==1)" R (!"(i38.i1.i3.u465.p2320==1)" & (XXX!"(i38.i1.i3.u465.p2320==1)" R F!"(i4.u54.p313!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t26, t181, t210, t262, t293, t322, t372, t444, t496, t658, t739, t800, t849, t1141, t1226, t1...2035
Computing Next relation with stutter on 32080 deadlock states
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
313 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,3.33402,123548,1,0,184859,5413,21631,307665,691,23016,945879
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-303-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-303-LTLFireability-11 finished in 127624 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 1544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Graph (trivial) has 1886 edges and 1544 vertex of which 688 / 1544 are part of one of the 62 SCC in 2 ms
Free SCC test removed 626 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1415 edges and 918 vertex of which 910 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 506 place count 909 transition count 737
Reduce places removed 504 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 531 rules applied. Total rules applied 1037 place count 405 transition count 710
Reduce places removed 13 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 15 rules applied. Total rules applied 1052 place count 392 transition count 708
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 1055 place count 391 transition count 706
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 1059 place count 390 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1061 place count 388 transition count 703
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 47 Pre rules applied. Total rules applied 1061 place count 388 transition count 656
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 1155 place count 341 transition count 656
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1170 place count 326 transition count 632
Iterating global reduction 6 with 15 rules applied. Total rules applied 1185 place count 326 transition count 632
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 6 with 1 rules applied. Total rules applied 1186 place count 326 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1187 place count 325 transition count 631
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1187 place count 325 transition count 630
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1189 place count 324 transition count 630
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1197 place count 316 transition count 619
Iterating global reduction 8 with 8 rules applied. Total rules applied 1205 place count 316 transition count 619
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1210 place count 316 transition count 614
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1211 place count 315 transition count 612
Iterating global reduction 9 with 1 rules applied. Total rules applied 1212 place count 315 transition count 612
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1213 place count 314 transition count 610
Iterating global reduction 9 with 1 rules applied. Total rules applied 1214 place count 314 transition count 610
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1215 place count 313 transition count 608
Iterating global reduction 9 with 1 rules applied. Total rules applied 1216 place count 313 transition count 608
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1217 place count 312 transition count 606
Iterating global reduction 9 with 1 rules applied. Total rules applied 1218 place count 312 transition count 606
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1219 place count 311 transition count 604
Iterating global reduction 9 with 1 rules applied. Total rules applied 1220 place count 311 transition count 604
Performed 147 Post agglomeration using F-continuation condition with reduction of 90 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 9 with 294 rules applied. Total rules applied 1514 place count 164 transition count 367
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1525 place count 164 transition count 356
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 1531 place count 158 transition count 345
Iterating global reduction 10 with 6 rules applied. Total rules applied 1537 place count 158 transition count 345
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1538 place count 157 transition count 344
Iterating global reduction 10 with 1 rules applied. Total rules applied 1539 place count 157 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1540 place count 157 transition count 343
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 22 rules applied. Total rules applied 1562 place count 146 transition count 331
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1572 place count 146 transition count 321
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1573 place count 145 transition count 319
Iterating global reduction 12 with 1 rules applied. Total rules applied 1574 place count 145 transition count 319
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 38 rules applied. Total rules applied 1612 place count 126 transition count 357
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 12 with 22 rules applied. Total rules applied 1634 place count 126 transition count 335
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1643 place count 117 transition count 317
Iterating global reduction 13 with 9 rules applied. Total rules applied 1652 place count 117 transition count 317
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1658 place count 117 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 14 with 40 rules applied. Total rules applied 1698 place count 117 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1699 place count 116 transition count 270
Applied a total of 1699 rules in 81 ms. Remains 116 /1544 variables (removed 1428) and now considering 270/1974 (removed 1704) transitions.
[2026-05-23 01:45:10] [INFO ] Flow matrix only has 212 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-16106393084984314748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6699079621670765469.kers'
[2026-05-23 01:45:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16106393084984314748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6699079621670765469.kers]
Normalized transition count is 211 out of 212 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 116 cols 613 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-23 01:45:10] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6699079621670765469.kers
Total runtime 2 ms.
[2026-05-23 01:45:10] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-23 01:45:10] [INFO ] Flow matrix only has 212 transitions (discarded 58 similar events)
[2026-05-23 01:45:10] [INFO ] Invariant cache hit.
[2026-05-23 01:45:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 01:45:10] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [13, 46, 79]
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 : 113/1544 places, 270/1974 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 110 transition count 267
Applied a total of 4 rules in 5 ms. Remains 110 /113 variables (removed 3) and now considering 267/270 (removed 3) transitions.
[2026-05-23 01:45:10] [INFO ] Flow matrix only has 209 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-1096560185754851544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11282759238161318434.kers'
[2026-05-23 01:45:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1096560185754851544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11282759238161318434.kers]
Normalized transition count is 208 out of 209 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 110 cols 612 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-23 01:45:10] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11282759238161318434.kers
Total runtime 1 ms.
[2026-05-23 01:45:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 01:45:10] [INFO ] Flow matrix only has 209 transitions (discarded 58 similar events)
[2026-05-23 01:45:10] [INFO ] Invariant cache hit.
[2026-05-23 01:45:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:45:10] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1544 places, 267/1974 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 400 ms. Remains : 110/1544 places, 267/1974 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 31 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-13
Stuttering criterion allowed to conclude after 41608 steps with 6084 reset in 83 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-13 finished in 547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 2 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1525 transition count 1954
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1525 transition count 1954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 1525 transition count 1951
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 1518 transition count 1944
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 1518 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 56 place count 1518 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 1516 transition count 1941
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 1516 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 1514 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1514 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1512 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 1511 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 1511 transition count 1934
Applied a total of 70 rules in 406 ms. Remains 1511 /1544 variables (removed 33) and now considering 1934/1974 (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-7373690905516563378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-763205678804559847.kers'
[2026-05-23 01:45:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7373690905516563378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-763205678804559847.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1934 rows 1511 cols 4035 entries
Finished phase 1 with 1507 SingleSign rule and 1 generalized
[2026-05-23 01:45:11] [INFO ] Computed 3 invariants in 16 ms
Computed 3 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-763205678804559847.kers
Total runtime 20 ms.
[2026-05-23 01:45:11] [INFO ] Implicit Places using invariants in 221 ms returned []
[2026-05-23 01:45:11] [INFO ] Invariant cache hit.
[2026-05-23 01:45:12] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2026-05-23 01:45:12] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3445 variables, and 3 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3445 variables, and 3 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60408ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60411ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1544 places, 1934/1974 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61930 ms. Remains : 1511/1544 places, 1934/1974 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-14
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-14 finished in 62109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 1544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1544/1544 places, 1974/1974 transitions.
Graph (trivial) has 1884 edges and 1544 vertex of which 696 / 1544 are part of one of the 62 SCC in 1 ms
Free SCC test removed 634 places
Ensure Unique test removed 739 transitions
Reduce isomorphic transitions removed 739 transitions.
Graph (complete) has 1403 edges and 910 vertex of which 902 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 498 transitions
Trivial Post-agglo rules discarded 498 transitions
Performed 498 trivial Post agglomeration. Transition count delta: 498
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 901 transition count 731
Reduce places removed 498 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 523 rules applied. Total rules applied 1023 place count 403 transition count 706
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 1037 place count 391 transition count 704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1039 place count 389 transition count 704
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1039 place count 389 transition count 657
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1133 place count 342 transition count 657
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1148 place count 327 transition count 633
Iterating global reduction 4 with 15 rules applied. Total rules applied 1163 place count 327 transition count 633
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 4 with 1 rules applied. Total rules applied 1164 place count 327 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1165 place count 326 transition count 632
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1165 place count 326 transition count 631
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1167 place count 325 transition count 631
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1176 place count 316 transition count 618
Iterating global reduction 6 with 9 rules applied. Total rules applied 1185 place count 316 transition count 618
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1190 place count 316 transition count 613
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1192 place count 314 transition count 609
Iterating global reduction 7 with 2 rules applied. Total rules applied 1194 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1196 place count 312 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1198 place count 312 transition count 605
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1200 place count 310 transition count 601
Iterating global reduction 7 with 2 rules applied. Total rules applied 1202 place count 310 transition count 601
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1204 place count 308 transition count 597
Iterating global reduction 7 with 2 rules applied. Total rules applied 1206 place count 308 transition count 597
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1208 place count 306 transition count 593
Iterating global reduction 7 with 2 rules applied. Total rules applied 1210 place count 306 transition count 593
Performed 147 Post agglomeration using F-continuation condition with reduction of 90 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 1504 place count 159 transition count 356
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1515 place count 159 transition count 345
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1522 place count 152 transition count 329
Iterating global reduction 8 with 7 rules applied. Total rules applied 1529 place count 152 transition count 329
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1530 place count 151 transition count 328
Iterating global reduction 8 with 1 rules applied. Total rules applied 1531 place count 151 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1532 place count 151 transition count 327
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1554 place count 140 transition count 315
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1565 place count 140 transition count 304
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1599 place count 123 transition count 338
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 1616 place count 123 transition count 321
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1625 place count 114 transition count 303
Iterating global reduction 11 with 9 rules applied. Total rules applied 1634 place count 114 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 1640 place count 114 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 12 with 36 rules applied. Total rules applied 1676 place count 114 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1677 place count 113 transition count 260
Applied a total of 1677 rules in 67 ms. Remains 113 /1544 variables (removed 1431) and now considering 260/1974 (removed 1714) transitions.
[2026-05-23 01:46:12] [INFO ] Flow matrix only has 204 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-6126864087529154275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6909233756038666845.kers'
[2026-05-23 01:46:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6126864087529154275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6909233756038666845.kers]
Normalized transition count is 203 out of 204 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 113 cols 598 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 01:46:12] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6909233756038666845.kers
Total runtime 2 ms.
[2026-05-23 01:46:12] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 01:46:12] [INFO ] Flow matrix only has 204 transitions (discarded 56 similar events)
[2026-05-23 01:46:12] [INFO ] Invariant cache hit.
[2026-05-23 01:46:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 01:46:13] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [8, 41, 75]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 170 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/1544 places, 260/1974 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 257
Applied a total of 4 rules in 4 ms. Remains 107 /110 variables (removed 3) and now considering 257/260 (removed 3) transitions.
[2026-05-23 01:46:13] [INFO ] Flow matrix only has 201 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-11020420964440604690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-325994237915691849.kers'
[2026-05-23 01:46:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11020420964440604690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-325994237915691849.kers]
Normalized transition count is 200 out of 201 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 107 cols 597 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-23 01:46:13] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-325994237915691849.kers
Total runtime 1 ms.
[2026-05-23 01:46:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 01:46:13] [INFO ] Flow matrix only has 201 transitions (discarded 56 similar events)
[2026-05-23 01:46:13] [INFO ] Invariant cache hit.
[2026-05-23 01:46:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 01:46:13] [INFO ] Implicit Places using invariants and state equation in 88 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 : 107/1544 places, 257/1974 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 374 ms. Remains : 107/1544 places, 257/1974 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-15 finished in 512 ms.
All properties solved by simple procedures.
Total runtime 769098 ms.

BK_STOP 1779500773403

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

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