fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r066-tall-177946967500156
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for CloudReconfiguration-PT-306

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1463.823 588610.00 741184.00 1439.20 FFFFTTFFTFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.3K Mar 6 08:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 6 08:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 6 08:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 08:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 08:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 6 08:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 08:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:23 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-306-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779502502332

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-306
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 02:15:03] [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 02:15:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 02:15:03] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2026-05-23 02:15:03] [INFO ] Transformed 2584 places.
[2026-05-23 02:15:03] [INFO ] Transformed 3094 transitions.
[2026-05-23 02:15:03] [INFO ] Found NUPN structural information;
[2026-05-23 02:15:03] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-306-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 516 places :
Symmetric choice reduction at 0 with 516 rule applications. Total rules 516 place count 2068 transition count 2578
Iterating global reduction 0 with 516 rules applied. Total rules applied 1032 place count 2068 transition count 2578
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1061 place count 2068 transition count 2549
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1300 place count 1829 transition count 2310
Iterating global reduction 1 with 239 rules applied. Total rules applied 1539 place count 1829 transition count 2310
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 1627 place count 1741 transition count 2222
Iterating global reduction 1 with 88 rules applied. Total rules applied 1715 place count 1741 transition count 2222
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1731 place count 1741 transition count 2206
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1779 place count 1693 transition count 2158
Iterating global reduction 2 with 48 rules applied. Total rules applied 1827 place count 1693 transition count 2158
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1834 place count 1693 transition count 2151
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1873 place count 1654 transition count 2108
Iterating global reduction 3 with 39 rules applied. Total rules applied 1912 place count 1654 transition count 2108
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1940 place count 1626 transition count 2080
Iterating global reduction 3 with 28 rules applied. Total rules applied 1968 place count 1626 transition count 2080
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1993 place count 1601 transition count 2055
Iterating global reduction 3 with 25 rules applied. Total rules applied 2018 place count 1601 transition count 2055
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2042 place count 1577 transition count 2031
Iterating global reduction 3 with 24 rules applied. Total rules applied 2066 place count 1577 transition count 2031
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2087 place count 1556 transition count 1998
Iterating global reduction 3 with 21 rules applied. Total rules applied 2108 place count 1556 transition count 1998
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2116 place count 1548 transition count 1985
Iterating global reduction 3 with 8 rules applied. Total rules applied 2124 place count 1548 transition count 1985
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2132 place count 1540 transition count 1974
Iterating global reduction 3 with 8 rules applied. Total rules applied 2140 place count 1540 transition count 1974
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2142 place count 1540 transition count 1972
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2145 place count 1537 transition count 1969
Iterating global reduction 4 with 3 rules applied. Total rules applied 2148 place count 1537 transition count 1969
Applied a total of 2148 rules in 1521 ms. Remains 1537 /2584 variables (removed 1047) and now considering 1969/3094 (removed 1125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16139309469003861206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4715994726064003424.kers'
[2026-05-23 02:15:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16139309469003861206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4715994726064003424.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1969 rows 1537 cols 4107 entries
Finished phase 1 with 1532 SingleSign rule and 1 generalized
[2026-05-23 02:15:05] [INFO ] Computed 4 invariants in 12 ms
Computed 4 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-4715994726064003424.kers
Total runtime 14 ms.
[2026-05-23 02:15:05] [INFO ] Implicit Places using invariants in 448 ms returned []
[2026-05-23 02:15:06] [INFO ] Invariant cache hit.
[2026-05-23 02:15:07] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned [1526]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1503 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1536/2584 places, 1969/3094 transitions.
Applied a total of 0 rules in 52 ms. Remains 1536 /1536 variables (removed 0) and now considering 1969/1969 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3090 ms. Remains : 1536/2584 places, 1969/3094 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Applied a total of 0 rules in 41 ms. Remains 1536 /1536 variables (removed 0) and now considering 1969/1969 (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-1956690075837028005.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7390993680173678480.kers'
[2026-05-23 02:15:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1956690075837028005.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7390993680173678480.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1969 rows 1536 cols 4105 entries
Finished phase 1 with 1532 SingleSign rule and 1 generalized
[2026-05-23 02:15:07] [INFO ] Computed 3 invariants in 9 ms
Computed 3 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7390993680173678480.kers
Total runtime 11 ms.
[2026-05-23 02:15:07] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-23 02:15:07] [INFO ] Invariant cache hit.
[2026-05-23 02:15:08] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Running 1968 sub problems to find dead transitions.
[2026-05-23 02:15:08] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1535 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1968 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1535/3505 variables, and 3 constraints, problems are : Problem set: 0 solved, 1968 unsolved in 30062 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1536 constraints, PredecessorRefiner: 1968/1968 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1968 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1535 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1968 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1535/3505 variables, and 3 constraints, problems are : Problem set: 0 solved, 1968 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1536 constraints, PredecessorRefiner: 0/1968 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60655ms problems are : Problem set: 0 solved, 1968 unsolved
Search for dead transitions found 0 dead transitions in 60676ms
Finished structural reductions in LTL mode , in 1 iterations and 62005 ms. Remains : 1536/1536 places, 1969/1969 transitions.
Support contains 38 out of 1536 places after structural reductions.
[2026-05-23 02:16:09] [INFO ] Flatten gal took : 148 ms
[2026-05-23 02:16:09] [INFO ] Flatten gal took : 64 ms
[2026-05-23 02:16:09] [INFO ] Input system was already deterministic with 1969 transitions.
Support contains 37 out of 1536 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (430 resets) in 1548 ms. (25 steps per ms) remains 25/35 properties
BEST_FIRST walk for 4002 steps (18 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (12 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (16 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (12 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (14 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (14 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (15 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (17 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (13 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (12 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
[2026-05-23 02:16:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1487/1513 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1513 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1951/3464 variables, 1513/1516 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3464 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 7/3471 variables, 5/1521 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3471 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 6/3477 variables, 3/1524 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3477 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 6/3483 variables, 3/1527 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 3483/3505 variables, and 1527 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1524/1536 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1487/1513 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1513 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1951/3464 variables, 1513/1516 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3464 variables, 24/1540 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3464 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 7/3471 variables, 5/1545 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3471/3505 variables, and 1545 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1518/1536 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10061ms problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 1536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Graph (trivial) has 1821 edges and 1536 vertex of which 654 / 1536 are part of one of the 61 SCC in 10 ms
Free SCC test removed 593 places
Drop transitions (Empty/Sink Transition effects.) removed 750 transitions
Reduce isomorphic transitions removed 750 transitions.
Graph (complete) has 1387 edges and 943 vertex of which 935 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 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 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 935 transition count 719
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 542 rules applied. Total rules applied 1040 place count 446 transition count 666
Reduce places removed 34 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 44 rules applied. Total rules applied 1084 place count 412 transition count 656
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1094 place count 402 transition count 656
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1094 place count 402 transition count 606
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1194 place count 352 transition count 606
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1205 place count 341 transition count 591
Iterating global reduction 4 with 11 rules applied. Total rules applied 1216 place count 341 transition count 591
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 1219 place count 341 transition count 588
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1222 place count 338 transition count 588
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1228 place count 332 transition count 582
Iterating global reduction 6 with 6 rules applied. Total rules applied 1234 place count 332 transition count 582
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1240 place count 332 transition count 576
Performed 153 Post agglomeration using F-continuation condition with reduction of 75 identical transitions.
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 7 with 306 rules applied. Total rules applied 1546 place count 179 transition count 348
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 1573 place count 179 transition count 321
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1576 place count 176 transition count 318
Iterating global reduction 8 with 3 rules applied. Total rules applied 1579 place count 176 transition count 318
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1599 place count 166 transition count 306
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1611 place count 166 transition count 294
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 9 with 4 rules applied. Total rules applied 1615 place count 164 transition count 292
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1618 place count 164 transition count 289
Performed 37 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 10 with 74 rules applied. Total rules applied 1692 place count 127 transition count 332
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 10 with 34 rules applied. Total rules applied 1726 place count 127 transition count 298
Discarding 17 places :
Symmetric choice reduction at 11 with 17 rule applications. Total rules 1743 place count 110 transition count 264
Iterating global reduction 11 with 17 rules applied. Total rules applied 1760 place count 110 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1762 place count 110 transition count 262
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1766 place count 106 transition count 254
Iterating global reduction 12 with 4 rules applied. Total rules applied 1770 place count 106 transition count 254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1773 place count 106 transition count 251
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 13 with 17 rules applied. Total rules applied 1790 place count 106 transition count 234
Free-agglomeration rule applied 9 times.
Iterating global reduction 13 with 9 rules applied. Total rules applied 1799 place count 106 transition count 225
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 1808 place count 97 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 1813 place count 97 transition count 220
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 1817 place count 97 transition count 220
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 1820 place count 97 transition count 220
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1821 place count 96 transition count 219
Applied a total of 1821 rules in 160 ms. Remains 96 /1536 variables (removed 1440) and now considering 219/1969 (removed 1750) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 96/1536 places, 219/1969 transitions.
RANDOM walk for 40000 steps (875 resets) in 325 ms. (122 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40003 steps (268 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (247 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (289 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (278 resets) in 59 ms. (666 steps per ms) remains 3/4 properties
[2026-05-23 02:16:20] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2726744110391377656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11812240286427568312.kers'
[2026-05-23 02:16:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2726744110391377656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11812240286427568312.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 96 cols 620 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-23 02:16:20] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11812240286427568312.kers
Total runtime 1 ms.
[2026-05-23 02:16:20] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 50/54 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 126/180 variables, 54/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/233 variables, 6/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 2/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/242 variables, 1/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 3/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/287 variables, 22/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 2/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 11/298 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/298 variables, 1/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/298 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/306 variables, 10/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/306 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 104 constraints, problems are : Problem set: 1 solved, 2 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 96/96 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 126/180 variables, 54/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 53/233 variables, 6/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 2/66 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/242 variables, 1/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 3/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 45/287 variables, 22/92 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 2/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp31 is UNSAT
After SMT solving in domain Int declared 287/306 variables, and 96 constraints, problems are : Problem set: 3 solved, 0 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 3/4 constraints, State Equation: 85/96 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CloudReconfiguration-PT-306-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA CloudReconfiguration-PT-306-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-306-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2142 edges and 1536 vertex of which 1528 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)))&&F((!p0 U (p1||G(!p0))))))'
Support contains 2 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1521 transition count 1954
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1521 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1521 transition count 1953
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 1513 transition count 1944
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 1513 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 48 place count 1513 transition count 1943
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 1509 transition count 1937
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 1509 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 1509 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 1508 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 1508 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 1507 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 1507 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 1506 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 1506 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 1506 transition count 1930
Applied a total of 64 rules in 334 ms. Remains 1506 /1536 variables (removed 30) and now considering 1930/1969 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9589272757657589161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8236901868511877902.kers'
[2026-05-23 02:16:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9589272757657589161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8236901868511877902.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 02:16:22] [INFO ] Computed 3 invariants in 9 ms
Computed 3 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-8236901868511877902.kers
Total runtime 10 ms.
[2026-05-23 02:16:22] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-23 02:16:22] [INFO ] Invariant cache hit.
[2026-05-23 02:16:23] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2026-05-23 02:16:23] [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 30035 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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30033 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 60422ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1536 places, 1930/1969 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61905 ms. Remains : 1506/1536 places, 1930/1969 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)))&&F((!p0 U (p1||G(!p0))))))'
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-00 finished in 62367 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))&&((p1 U p2)||X(p3))))'
Support contains 3 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1521 transition count 1954
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1521 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1521 transition count 1953
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 1512 transition count 1943
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 1512 transition count 1943
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 1512 transition count 1941
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 1508 transition count 1935
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 1508 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 1507 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 1507 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 1506 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 1506 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 1505 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 1505 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 1505 transition count 1928
Applied a total of 67 rules in 388 ms. Remains 1505 /1536 variables (removed 31) and now considering 1928/1969 (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-5922981889995727375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1523186623789886100.kers'
[2026-05-23 02:17:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5922981889995727375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1523186623789886100.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1928 rows 1505 cols 4023 entries
Finished phase 1 with 1501 SingleSign rule and 1 generalized
[2026-05-23 02:17:24] [INFO ] Computed 3 invariants in 8 ms
Computed 3 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-1523186623789886100.kers
Total runtime 11 ms.
[2026-05-23 02:17:24] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-23 02:17:24] [INFO ] Invariant cache hit.
[2026-05-23 02:17:25] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2026-05-23 02:17:25] [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, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1536 places, 1928/1969 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61879 ms. Remains : 1505/1536 places, 1928/1969 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))&&((p1 U p2)||X(p3))))'
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), true, (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-01
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-01 finished in 62140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 1 out of 1536 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Graph (trivial) has 1881 edges and 1536 vertex of which 691 / 1536 are part of one of the 63 SCC in 5 ms
Free SCC test removed 628 places
Ensure Unique test removed 729 transitions
Reduce isomorphic transitions removed 729 transitions.
Graph (complete) has 1407 edges and 908 vertex of which 900 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 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 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 899 transition count 739
Reduce places removed 495 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 523 rules applied. Total rules applied 1020 place count 404 transition count 711
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1033 place count 391 transition count 711
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1033 place count 391 transition count 665
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1125 place count 345 transition count 665
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1142 place count 328 transition count 637
Iterating global reduction 3 with 17 rules applied. Total rules applied 1159 place count 328 transition count 637
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 1162 place count 328 transition count 634
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1165 place count 325 transition count 634
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1175 place count 315 transition count 620
Iterating global reduction 5 with 10 rules applied. Total rules applied 1185 place count 315 transition count 620
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1191 place count 315 transition count 614
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1193 place count 313 transition count 610
Iterating global reduction 6 with 2 rules applied. Total rules applied 1195 place count 313 transition count 610
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1197 place count 311 transition count 606
Iterating global reduction 6 with 2 rules applied. Total rules applied 1199 place count 311 transition count 606
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1201 place count 309 transition count 602
Iterating global reduction 6 with 2 rules applied. Total rules applied 1203 place count 309 transition count 602
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1205 place count 307 transition count 598
Iterating global reduction 6 with 2 rules applied. Total rules applied 1207 place count 307 transition count 598
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1209 place count 305 transition count 594
Iterating global reduction 6 with 2 rules applied. Total rules applied 1211 place count 305 transition count 594
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1212 place count 304 transition count 587
Iterating global reduction 6 with 1 rules applied. Total rules applied 1213 place count 304 transition count 587
Performed 145 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 6 with 290 rules applied. Total rules applied 1503 place count 159 transition count 359
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1515 place count 159 transition count 347
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1520 place count 154 transition count 337
Iterating global reduction 7 with 5 rules applied. Total rules applied 1525 place count 154 transition count 337
Performed 14 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1553 place count 140 transition count 320
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1568 place count 140 transition count 305
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 8 with 34 rules applied. Total rules applied 1602 place count 123 transition count 339
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 1619 place count 123 transition count 322
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1628 place count 114 transition count 304
Iterating global reduction 9 with 9 rules applied. Total rules applied 1637 place count 114 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1643 place count 114 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 10 with 36 rules applied. Total rules applied 1679 place count 114 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1680 place count 113 transition count 261
Applied a total of 1680 rules in 128 ms. Remains 113 /1536 variables (removed 1423) and now considering 261/1969 (removed 1708) transitions.
[2026-05-23 02:18:26] [INFO ] Flow matrix only has 205 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17962845740877561562.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14604402188078005379.kers'
[2026-05-23 02:18:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17962845740877561562.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14604402188078005379.kers]
Normalized transition count is 204 out of 205 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 113 cols 602 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 02:18:26] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14604402188078005379.kers
Total runtime 1 ms.
[2026-05-23 02:18:26] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 02:18:26] [INFO ] Flow matrix only has 205 transitions (discarded 56 similar events)
[2026-05-23 02:18:26] [INFO ] Invariant cache hit.
[2026-05-23 02:18:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 02:18:26] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [8, 41, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 178 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/1536 places, 261/1969 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 107 transition count 258
Applied a total of 4 rules in 8 ms. Remains 107 /110 variables (removed 3) and now considering 258/261 (removed 3) transitions.
[2026-05-23 02:18:26] [INFO ] Flow matrix only has 202 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-498566280482720613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5445637325410541693.kers'
[2026-05-23 02:18:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-498566280482720613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5445637325410541693.kers]
Normalized transition count is 201 out of 202 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 107 cols 602 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-23 02:18:26] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5445637325410541693.kers
Total runtime 1 ms.
[2026-05-23 02:18:26] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 02:18:26] [INFO ] Flow matrix only has 202 transitions (discarded 56 similar events)
[2026-05-23 02:18:26] [INFO ] Invariant cache hit.
[2026-05-23 02:18:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 02:18:26] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/1536 places, 258/1969 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 440 ms. Remains : 107/1536 places, 258/1969 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Stuttering acceptance computed with spot in 82 ms :[p0, true, p0]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-02 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' '!(F(!p0))'
Support contains 1 out of 1536 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Graph (trivial) has 1881 edges and 1536 vertex of which 696 / 1536 are part of one of the 63 SCC in 3 ms
Free SCC test removed 633 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1400 edges and 903 vertex of which 895 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 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 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 894 transition count 735
Reduce places removed 492 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 517 rules applied. Total rules applied 1011 place count 402 transition count 710
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1023 place count 390 transition count 710
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1023 place count 390 transition count 664
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 1115 place count 344 transition count 664
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1131 place count 328 transition count 638
Iterating global reduction 3 with 16 rules applied. Total rules applied 1147 place count 328 transition count 638
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 1150 place count 328 transition count 635
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1153 place count 325 transition count 635
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1162 place count 316 transition count 623
Iterating global reduction 5 with 9 rules applied. Total rules applied 1171 place count 316 transition count 623
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1177 place count 316 transition count 617
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1179 place count 314 transition count 613
Iterating global reduction 6 with 2 rules applied. Total rules applied 1181 place count 314 transition count 613
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1183 place count 312 transition count 609
Iterating global reduction 6 with 2 rules applied. Total rules applied 1185 place count 312 transition count 609
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1187 place count 310 transition count 605
Iterating global reduction 6 with 2 rules applied. Total rules applied 1189 place count 310 transition count 605
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1191 place count 308 transition count 601
Iterating global reduction 6 with 2 rules applied. Total rules applied 1193 place count 308 transition count 601
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1194 place count 307 transition count 599
Iterating global reduction 6 with 1 rules applied. Total rules applied 1195 place count 307 transition count 599
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1196 place count 306 transition count 592
Iterating global reduction 6 with 1 rules applied. Total rules applied 1197 place count 306 transition count 592
Performed 147 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 6 with 294 rules applied. Total rules applied 1491 place count 159 transition count 361
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1507 place count 159 transition count 345
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1511 place count 155 transition count 340
Iterating global reduction 7 with 4 rules applied. Total rules applied 1515 place count 155 transition count 340
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 1541 place count 142 transition count 324
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1555 place count 142 transition count 310
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1591 place count 124 transition count 346
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 1610 place count 124 transition count 327
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1619 place count 115 transition count 309
Iterating global reduction 9 with 9 rules applied. Total rules applied 1628 place count 115 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1634 place count 115 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 10 with 37 rules applied. Total rules applied 1671 place count 115 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1672 place count 114 transition count 265
Applied a total of 1672 rules in 98 ms. Remains 114 /1536 variables (removed 1422) and now considering 265/1969 (removed 1704) transitions.
[2026-05-23 02:18:26] [INFO ] Flow matrix only has 209 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-1122417308529895454.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2751365297630020595.kers'
[2026-05-23 02:18:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1122417308529895454.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2751365297630020595.kers]
Normalized transition count is 208 out of 209 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 114 cols 607 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 02:18:26] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2751365297630020595.kers
Total runtime 1 ms.
[2026-05-23 02:18:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 02:18:26] [INFO ] Flow matrix only has 209 transitions (discarded 56 similar events)
[2026-05-23 02:18:26] [INFO ] Invariant cache hit.
[2026-05-23 02:18:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 02:18:27] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [11, 44, 77]
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 : 111/1536 places, 265/1969 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 262
Applied a total of 4 rules in 10 ms. Remains 108 /111 variables (removed 3) and now considering 262/265 (removed 3) transitions.
[2026-05-23 02:18:27] [INFO ] Flow matrix only has 206 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-15263116674801326233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13033813521719197730.kers'
[2026-05-23 02:18:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15263116674801326233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13033813521719197730.kers]
Normalized transition count is 205 out of 206 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 108 cols 606 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-23 02:18:27] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13033813521719197730.kers
Total runtime 1 ms.
[2026-05-23 02:18:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 02:18:27] [INFO ] Flow matrix only has 206 transitions (discarded 56 similar events)
[2026-05-23 02:18:27] [INFO ] Invariant cache hit.
[2026-05-23 02:18:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 02:18:27] [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 : 108/1536 places, 262/1969 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 386 ms. Remains : 108/1536 places, 262/1969 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-03 finished in 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (p2||X((G(F(p3)) U p4)))))'
Support contains 5 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1524 transition count 1957
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1524 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1524 transition count 1956
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 1516 transition count 1948
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 1516 transition count 1948
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 1516 transition count 1946
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 47 place count 1512 transition count 1940
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 1512 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 1512 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 1511 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1937
Applied a total of 54 rules in 206 ms. Remains 1511 /1536 variables (removed 25) and now considering 1937/1969 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16338500009352187183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6648614367395342571.kers'
[2026-05-23 02:18:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16338500009352187183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6648614367395342571.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1937 rows 1511 cols 4041 entries
Finished phase 1 with 1507 SingleSign rule and 1 generalized
[2026-05-23 02:18:27] [INFO ] Computed 3 invariants in 13 ms
Computed 3 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-6648614367395342571.kers
Total runtime 15 ms.
[2026-05-23 02:18:27] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-23 02:18:27] [INFO ] Invariant cache hit.
[2026-05-23 02:18:28] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2026-05-23 02:18:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3448 variables, and 3 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 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/1510 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 1510/3448 variables, and 3 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60410ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1536 places, 1937/1969 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61686 ms. Remains : 1511/1536 places, 1937/1969 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (p2||X((G(F(p3)) U p4)))))'
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p2) (NOT p4)), (NOT p4), (AND (NOT p1) (NOT p4)), (AND (NOT p2) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 457 ms.
Product exploration explored 100000 steps with 50000 reset in 419 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2110 edges and 1511 vertex of which 1503 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 31 factoid took 14 ms. Proved property starting from automaton with 8 states, 24 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 36 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-306-LTLFireability-04 finished in 63005 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||X(G((p1||G(p2)))))))))'
Support contains 2 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1520 transition count 1953
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1520 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1520 transition count 1952
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 1511 transition count 1942
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 1511 transition count 1942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 1511 transition count 1940
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 1507 transition count 1934
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 1507 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 1507 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 1506 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 1506 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 1505 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 1505 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 1504 transition count 1928
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 1504 transition count 1928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 1504 transition count 1927
Applied a total of 69 rules in 299 ms. Remains 1504 /1536 variables (removed 32) and now considering 1927/1969 (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-17288207945515400449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8168195259501110478.kers'
[2026-05-23 02:19:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17288207945515400449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8168195259501110478.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1927 rows 1504 cols 4021 entries
Finished phase 1 with 1500 SingleSign rule and 1 generalized
[2026-05-23 02:19:30] [INFO ] Computed 3 invariants in 12 ms
Computed 3 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-8168195259501110478.kers
Total runtime 14 ms.
[2026-05-23 02:19:30] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-23 02:19:30] [INFO ] Invariant cache hit.
[2026-05-23 02:19:31] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2026-05-23 02:19:31] [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 30033 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
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 30033 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 60398ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1536 places, 1927/1969 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61791 ms. Remains : 1504/1536 places, 1927/1969 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||X(G((p1||G(p2)))))))))'
Stuttering acceptance computed with spot in 232 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-08
Product exploration explored 100000 steps with 25000 reset in 232 ms.
Product exploration explored 100000 steps with 25000 reset in 245 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2100 edges and 1504 vertex of which 1496 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.10 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge based reduction with 1 factoid took 52 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (431 resets) in 143 ms. (277 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (157 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (146 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
[2026-05-23 02:20:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1078/1080 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1481 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1909/3390 variables, 1481/1484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3390 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/3397 variables, 5/1489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3397 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/3403 variables, 3/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3403 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/3409 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3409 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/3415 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3415 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/3418 variables, 2/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3418 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3420 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3420 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3422 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3424 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3424 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3426 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 1/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3431/3431 variables, and 1507 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4425 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1504/1504 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1078/1080 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1481 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1909/3390 variables, 1481/1484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3390 variables, 2/1486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3390 variables, 0/1486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/3397 variables, 5/1491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3397 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3403 variables, 3/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3403 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/3409 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3409 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/3415 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/3418 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3418 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3420 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3422 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 1/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3431/3431 variables, and 1509 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3504 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1504/1504 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7941ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 113 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=28 )
Parikh walk visited 2 properties in 9 ms.
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Knowledge-based reduction took 8468 ms.
Stuttering acceptance computed with spot in 224 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 2 out of 1504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1504/1504 places, 1927/1927 transitions.
Applied a total of 0 rules in 61 ms. Remains 1504 /1504 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
[2026-05-23 02:20:41] [INFO ] Invariant cache hit.
[2026-05-23 02:20:41] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-23 02:20:41] [INFO ] Invariant cache hit.
[2026-05-23 02:20:42] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1109 ms. Remains : 1504/1504 places, 1927/1927 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2100 edges and 1504 vertex of which 1496 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 42 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (418 resets) in 208 ms. (191 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40001 steps (141 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (144 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
[2026-05-23 02:20:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1078/1080 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1481 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1909/3390 variables, 1481/1484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3390 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/3397 variables, 5/1489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3397 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/3403 variables, 3/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3403 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/3409 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3409 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/3415 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3415 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/3418 variables, 2/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3418 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3420 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3420 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3422 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3424 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3424 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3426 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 1/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3431/3431 variables, and 1507 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4228 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1504/1504 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1078/1080 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1481 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1481 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1909/3390 variables, 1481/1484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3390 variables, 2/1486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3390 variables, 0/1486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/3397 variables, 5/1491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3397 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3403 variables, 3/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3403 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/3409 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3409 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/3415 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/3418 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3418 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3420 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3422 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 1/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3431/3431 variables, and 1509 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3588 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1504/1504 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7825ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 164 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=41 )
Parikh walk visited 2 properties in 4 ms.
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Knowledge-based reduction took 8354 ms.
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 244 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 263 ms.
Product exploration explored 100000 steps with 25000 reset in 290 ms.
Spot run failed in 128 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/ltsmin10492226018466868119
[2026-05-23 02:20:52] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10492226018466868119
Running compilation step : cd /tmp/ltsmin10492226018466868119;'/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/ltsmin10492226018466868119;'/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/ltsmin10492226018466868119;'/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 1504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1504/1504 places, 1927/1927 transitions.
Applied a total of 0 rules in 57 ms. Remains 1504 /1504 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
[2026-05-23 02:20:55] [INFO ] Invariant cache hit.
[2026-05-23 02:20:55] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-23 02:20:55] [INFO ] Invariant cache hit.
[2026-05-23 02:20:56] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1098 ms. Remains : 1504/1504 places, 1927/1927 transitions.
Built C files in :
/tmp/ltsmin6199180447200684949
[2026-05-23 02:20:56] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6199180447200684949
Running compilation step : cd /tmp/ltsmin6199180447200684949;'/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/ltsmin6199180447200684949;'/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/ltsmin6199180447200684949;'/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 02:20:59] [INFO ] Flatten gal took : 46 ms
[2026-05-23 02:20:59] [INFO ] Flatten gal took : 42 ms
[2026-05-23 02:20:59] [INFO ] Time to serialize gal into /tmp/LTL8421764599035751258.gal : 9 ms
[2026-05-23 02:20:59] [INFO ] Time to serialize properties into /tmp/LTL14608020041874789533.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8421764599035751258.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2965091105488771558.hoa' '-atoms' '/tmp/LTL14608020041874789533.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/LTL14608020041874789533.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2965091105488771558.hoa
Detected timeout of ITS tools.
[2026-05-23 02:21:14] [INFO ] Flatten gal took : 33 ms
[2026-05-23 02:21:14] [INFO ] Flatten gal took : 33 ms
[2026-05-23 02:21:14] [INFO ] Time to serialize gal into /tmp/LTL15141427647227668130.gal : 9 ms
[2026-05-23 02:21:14] [INFO ] Time to serialize properties into /tmp/LTL14257223456972157609.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15141427647227668130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14257223456972157609.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(("(p987==0)")||(X(G(("(p987==1)")||(G("(p2370==1)"))))))))))
Formula 0 simplified : XXX(!"(p987==0)" & XF(!"(p987==1)" & F!"(p2370==1)"))
Detected timeout of ITS tools.
[2026-05-23 02:21:29] [INFO ] Flatten gal took : 34 ms
[2026-05-23 02:21:29] [INFO ] Applying decomposition
[2026-05-23 02:21:29] [INFO ] Flatten gal took : 27 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/graph15907078338654181626.txt' '-o' '/tmp/graph15907078338654181626.bin' '-w' '/tmp/graph15907078338654181626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15907078338654181626.bin' '-l' '-1' '-v' '-w' '/tmp/graph15907078338654181626.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:21:30] [INFO ] Decomposing Gal with order
[2026-05-23 02:21:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:21:30] [INFO ] Removed a total of 507 redundant transitions.
[2026-05-23 02:21:30] [INFO ] Flatten gal took : 137 ms
[2026-05-23 02:21:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 37 ms.
[2026-05-23 02:21:30] [INFO ] Time to serialize gal into /tmp/LTL15258486347152737988.gal : 37 ms
[2026-05-23 02:21:30] [INFO ] Time to serialize properties into /tmp/LTL12723200511995851256.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/LTL15258486347152737988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12723200511995851256.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(("(i7.i0.i3.u229.p987==0)")||(X(G(("(i7.i0.i3.u229.p987==1)")||(G("(i35.i0.i1.u565.p2370==1)"))))))))))
Formula 0 simplified : XXX(!"(i7.i0.i3.u229.p987==0)" & XF(!"(i7.i0.i3.u229.p987==1)" & F!"(i35.i0.i1.u565.p2370==1)"))
Reverse transition relation is NOT exact ! Due to transitions t193, t274, t305, t334, t383, t503, t660, t744, t775, t853, t975, t1133, t1162, t1214, t1247,...1998
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.44928,107572,1,0,172599,3346,18945,283999,475,15647,778787
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-306-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-306-LTLFireability-08 finished in 123028 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 1536 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Graph (trivial) has 1881 edges and 1536 vertex of which 696 / 1536 are part of one of the 63 SCC in 1 ms
Free SCC test removed 633 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1400 edges and 903 vertex of which 895 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 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 894 transition count 735
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 518 rules applied. Total rules applied 1012 place count 402 transition count 709
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1024 place count 390 transition count 709
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1024 place count 390 transition count 662
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1118 place count 343 transition count 662
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1135 place count 326 transition count 634
Iterating global reduction 3 with 17 rules applied. Total rules applied 1152 place count 326 transition count 634
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 1155 place count 326 transition count 631
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1158 place count 323 transition count 631
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1168 place count 313 transition count 617
Iterating global reduction 5 with 10 rules applied. Total rules applied 1178 place count 313 transition count 617
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1184 place count 313 transition count 611
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1186 place count 311 transition count 607
Iterating global reduction 6 with 2 rules applied. Total rules applied 1188 place count 311 transition count 607
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1190 place count 309 transition count 603
Iterating global reduction 6 with 2 rules applied. Total rules applied 1192 place count 309 transition count 603
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1194 place count 307 transition count 599
Iterating global reduction 6 with 2 rules applied. Total rules applied 1196 place count 307 transition count 599
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1198 place count 305 transition count 595
Iterating global reduction 6 with 2 rules applied. Total rules applied 1200 place count 305 transition count 595
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1202 place count 303 transition count 591
Iterating global reduction 6 with 2 rules applied. Total rules applied 1204 place count 303 transition count 591
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1205 place count 302 transition count 584
Iterating global reduction 6 with 1 rules applied. Total rules applied 1206 place count 302 transition count 584
Performed 143 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 6 with 286 rules applied. Total rules applied 1492 place count 159 transition count 358
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1504 place count 159 transition count 346
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1509 place count 154 transition count 336
Iterating global reduction 7 with 5 rules applied. Total rules applied 1514 place count 154 transition count 336
Performed 14 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1542 place count 140 transition count 319
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1557 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 8 with 34 rules applied. Total rules applied 1591 place count 123 transition count 338
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 1608 place count 123 transition count 321
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1617 place count 114 transition count 303
Iterating global reduction 9 with 9 rules applied. Total rules applied 1626 place count 114 transition count 303
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1632 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 10 with 36 rules applied. Total rules applied 1668 place count 114 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1669 place count 113 transition count 260
Applied a total of 1669 rules in 71 ms. Remains 113 /1536 variables (removed 1423) and now considering 260/1969 (removed 1709) transitions.
[2026-05-23 02:21:33] [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-11394915484686825139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12614310308565789838.kers'
[2026-05-23 02:21:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11394915484686825139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12614310308565789838.kers]
Normalized transition count is 202 out of 203 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 113 cols 596 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 02:21:33] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12614310308565789838.kers
Total runtime 1 ms.
[2026-05-23 02:21:33] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-23 02:21:33] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2026-05-23 02:21:33] [INFO ] Invariant cache hit.
[2026-05-23 02:21:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 02:21:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [8, 41, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 281 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/1536 places, 260/1969 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 107 transition count 257
Applied a total of 4 rules in 5 ms. Remains 107 /110 variables (removed 3) and now considering 257/260 (removed 3) transitions.
[2026-05-23 02:21:33] [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-12044579031562730313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14726833161551062492.kers'
[2026-05-23 02:21:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12044579031562730313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14726833161551062492.kers]
Normalized transition count is 199 out of 200 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 107 cols 595 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-23 02:21:33] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14726833161551062492.kers
Total runtime 1 ms.
[2026-05-23 02:21:33] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-23 02:21:33] [INFO ] Flow matrix only has 200 transitions (discarded 57 similar events)
[2026-05-23 02:21:33] [INFO ] Invariant cache hit.
[2026-05-23 02:21:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 02:21:33] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/1536 places, 257/1969 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 500 ms. Remains : 107/1536 places, 257/1969 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-306-LTLFireability-09
Stuttering criterion allowed to conclude after 16350 steps with 2354 reset in 40 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-09 finished in 598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(p1)||(p1&&F((p2&&G(p3)))))))'
Support contains 3 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1521 transition count 1954
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1521 transition count 1954
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 1512 transition count 1944
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 1512 transition count 1944
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 1512 transition count 1942
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 1508 transition count 1936
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 1508 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 1508 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1507 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1507 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1506 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1506 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1505 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1505 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 1505 transition count 1929
Applied a total of 66 rules in 413 ms. Remains 1505 /1536 variables (removed 31) and now considering 1929/1969 (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-18192709004392396440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14089099571540414096.kers'
[2026-05-23 02:21:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18192709004392396440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14089099571540414096.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1929 rows 1505 cols 4025 entries
Finished phase 1 with 1501 SingleSign rule and 1 generalized
[2026-05-23 02:21:34] [INFO ] Computed 3 invariants in 15 ms
Computed 3 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-14089099571540414096.kers
Total runtime 18 ms.
[2026-05-23 02:21:34] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-23 02:21:34] [INFO ] Invariant cache hit.
[2026-05-23 02:21:35] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 02:21:35] [INFO ] Invariant cache hit.
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 30036 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
Error getting values : (error "Timeout of Z3 solver reached")
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 30032 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 60395ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60398ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1536 places, 1929/1969 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61903 ms. Remains : 1505/1536 places, 1929/1969 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(p1)||(p1&&F((p2&&G(p3)))))))'
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-10
Stuttering criterion allowed to conclude after 62545 steps with 653 reset in 99 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-10 finished in 62284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&F(G(p2)))))))'
Support contains 3 out of 1536 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Graph (trivial) has 1873 edges and 1536 vertex of which 691 / 1536 are part of one of the 63 SCC in 1 ms
Free SCC test removed 628 places
Ensure Unique test removed 730 transitions
Reduce isomorphic transitions removed 730 transitions.
Graph (complete) has 1406 edges and 908 vertex of which 900 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 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 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 899 transition count 741
Reduce places removed 492 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 517 rules applied. Total rules applied 1011 place count 407 transition count 716
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 1026 place count 395 transition count 713
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1029 place count 392 transition count 713
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1029 place count 392 transition count 667
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1121 place count 346 transition count 667
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1137 place count 330 transition count 641
Iterating global reduction 4 with 16 rules applied. Total rules applied 1153 place count 330 transition count 641
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 1156 place count 330 transition count 638
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1159 place count 327 transition count 638
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1168 place count 318 transition count 626
Iterating global reduction 6 with 9 rules applied. Total rules applied 1177 place count 318 transition count 626
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1183 place count 318 transition count 620
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1185 place count 316 transition count 616
Iterating global reduction 7 with 2 rules applied. Total rules applied 1187 place count 316 transition count 616
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1189 place count 314 transition count 612
Iterating global reduction 7 with 2 rules applied. Total rules applied 1191 place count 314 transition count 612
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1193 place count 312 transition count 608
Iterating global reduction 7 with 2 rules applied. Total rules applied 1195 place count 312 transition count 608
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1197 place count 310 transition count 604
Iterating global reduction 7 with 2 rules applied. Total rules applied 1199 place count 310 transition count 604
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1200 place count 309 transition count 602
Iterating global reduction 7 with 1 rules applied. Total rules applied 1201 place count 309 transition count 602
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1202 place count 308 transition count 595
Iterating global reduction 7 with 1 rules applied. Total rules applied 1203 place count 308 transition count 595
Performed 144 Post agglomeration using F-continuation condition with reduction of 72 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 7 with 288 rules applied. Total rules applied 1491 place count 164 transition count 379
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1512 place count 164 transition count 358
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1516 place count 160 transition count 353
Iterating global reduction 8 with 4 rules applied. Total rules applied 1520 place count 160 transition count 353
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1544 place count 148 transition count 338
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1556 place count 148 transition count 326
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1594 place count 129 transition count 362
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 1617 place count 129 transition count 339
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1626 place count 120 transition count 321
Iterating global reduction 10 with 9 rules applied. Total rules applied 1635 place count 120 transition count 321
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1640 place count 120 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 11 with 38 rules applied. Total rules applied 1678 place count 120 transition count 278
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1681 place count 120 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1682 place count 120 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1683 place count 119 transition count 276
Applied a total of 1683 rules in 79 ms. Remains 119 /1536 variables (removed 1417) and now considering 276/1969 (removed 1693) transitions.
[2026-05-23 02:22:36] [INFO ] Flow matrix only has 219 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-6091239158513276893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7609583615096020458.kers'
[2026-05-23 02:22:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6091239158513276893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7609583615096020458.kers]
Normalized transition count is 218 out of 219 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 119 cols 627 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 02:22:36] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-7609583615096020458.kers
Total runtime 16 ms.
[2026-05-23 02:22:36] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-23 02:22:36] [INFO ] Flow matrix only has 219 transitions (discarded 57 similar events)
[2026-05-23 02:22:36] [INFO ] Invariant cache hit.
[2026-05-23 02:22:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 02:22:36] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [14, 47, 80]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 258 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1536 places, 276/1969 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 113 transition count 273
Applied a total of 4 rules in 4 ms. Remains 113 /116 variables (removed 3) and now considering 273/276 (removed 3) transitions.
[2026-05-23 02:22:36] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16820943510100860920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2324011234004860748.kers'
[2026-05-23 02:22:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16820943510100860920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2324011234004860748.kers]
Normalized transition count is 215 out of 216 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 113 cols 626 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 02:22:36] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2324011234004860748.kers
Total runtime 1 ms.
[2026-05-23 02:22:36] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 02:22:36] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2026-05-23 02:22:36] [INFO ] Invariant cache hit.
[2026-05-23 02:22:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 02:22:36] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1536 places, 273/1969 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 499 ms. Remains : 113/1536 places, 273/1969 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&F(G(p2)))))))'
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-11 finished in 653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 1536 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Graph (trivial) has 1871 edges and 1536 vertex of which 683 / 1536 are part of one of the 62 SCC in 1 ms
Free SCC test removed 621 places
Ensure Unique test removed 721 transitions
Reduce isomorphic transitions removed 721 transitions.
Graph (complete) has 1415 edges and 915 vertex of which 907 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 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 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 906 transition count 750
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 1 with 517 rules applied. Total rules applied 1011 place count 414 transition count 725
Reduce places removed 11 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 15 rules applied. Total rules applied 1026 place count 403 transition count 721
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1030 place count 399 transition count 721
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1030 place count 399 transition count 672
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1128 place count 350 transition count 672
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1145 place count 333 transition count 644
Iterating global reduction 4 with 17 rules applied. Total rules applied 1162 place count 333 transition count 644
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 1165 place count 333 transition count 641
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1168 place count 330 transition count 641
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1178 place count 320 transition count 627
Iterating global reduction 6 with 10 rules applied. Total rules applied 1188 place count 320 transition count 627
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1194 place count 320 transition count 621
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1196 place count 318 transition count 617
Iterating global reduction 7 with 2 rules applied. Total rules applied 1198 place count 318 transition count 617
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1200 place count 316 transition count 613
Iterating global reduction 7 with 2 rules applied. Total rules applied 1202 place count 316 transition count 613
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1204 place count 314 transition count 609
Iterating global reduction 7 with 2 rules applied. Total rules applied 1206 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1208 place count 312 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1210 place count 312 transition count 605
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1212 place count 310 transition count 601
Iterating global reduction 7 with 2 rules applied. Total rules applied 1214 place count 310 transition count 601
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1215 place count 309 transition count 594
Iterating global reduction 7 with 1 rules applied. Total rules applied 1216 place count 309 transition count 594
Performed 144 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 7 with 288 rules applied. Total rules applied 1504 place count 165 transition count 367
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1517 place count 165 transition count 354
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1522 place count 160 transition count 344
Iterating global reduction 8 with 5 rules applied. Total rules applied 1527 place count 160 transition count 344
Performed 14 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 1555 place count 146 transition count 327
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1570 place count 146 transition count 312
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1608 place count 127 transition count 342
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1625 place count 127 transition count 325
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1634 place count 118 transition count 307
Iterating global reduction 10 with 9 rules applied. Total rules applied 1643 place count 118 transition count 307
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1649 place count 118 transition count 301
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 1685 place count 118 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1686 place count 117 transition count 264
Applied a total of 1686 rules in 75 ms. Remains 117 /1536 variables (removed 1419) and now considering 264/1969 (removed 1705) transitions.
[2026-05-23 02:22:36] [INFO ] Flow matrix only has 209 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-76031041696844091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16766664499318363314.kers'
[2026-05-23 02:22:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-76031041696844091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16766664499318363314.kers]
Normalized transition count is 208 out of 209 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 117 cols 608 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-23 02:22:36] [INFO ] Computed 0 invariants in 3 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16766664499318363314.kers
Total runtime 4 ms.
[2026-05-23 02:22:36] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-23 02:22:36] [INFO ] Flow matrix only has 209 transitions (discarded 55 similar events)
[2026-05-23 02:22:36] [INFO ] Invariant cache hit.
[2026-05-23 02:22:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 02:22:37] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [9, 46, 80]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 196 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1536 places, 264/1969 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 111 transition count 261
Applied a total of 4 rules in 5 ms. Remains 111 /114 variables (removed 3) and now considering 261/264 (removed 3) transitions.
[2026-05-23 02:22:37] [INFO ] Flow matrix only has 206 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17328518992679612651.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3169357605343020102.kers'
[2026-05-23 02:22:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17328518992679612651.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3169357605343020102.kers]
Normalized transition count is 205 out of 206 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 111 cols 606 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-23 02:22:37] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3169357605343020102.kers
Total runtime 1 ms.
[2026-05-23 02:22:37] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-23 02:22:37] [INFO ] Flow matrix only has 206 transitions (discarded 55 similar events)
[2026-05-23 02:22:37] [INFO ] Invariant cache hit.
[2026-05-23 02:22:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 02:22:37] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1536 places, 261/1969 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 397 ms. Remains : 111/1536 places, 261/1969 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-12 finished in 465 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)&&X(p1))) U X(p2)))'
Support contains 3 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1521 transition count 1954
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1521 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1521 transition count 1953
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 1512 transition count 1943
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 1512 transition count 1943
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 1512 transition count 1941
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 1508 transition count 1935
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 1508 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 1507 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 1507 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 1506 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 1506 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 1505 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 1505 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 1505 transition count 1928
Applied a total of 67 rules in 407 ms. Remains 1505 /1536 variables (removed 31) and now considering 1928/1969 (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-11055467551105085828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16958932571938390895.kers'
[2026-05-23 02:22:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11055467551105085828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16958932571938390895.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1928 rows 1505 cols 4023 entries
Finished phase 1 with 1501 SingleSign rule and 1 generalized
[2026-05-23 02:22:37] [INFO ] Computed 3 invariants in 16 ms
Computed 3 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-16958932571938390895.kers
Total runtime 20 ms.
[2026-05-23 02:22:37] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-23 02:22:37] [INFO ] Invariant cache hit.
[2026-05-23 02:22:38] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2026-05-23 02:22:38] [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, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60414ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1536 places, 1928/1969 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61913 ms. Remains : 1505/1536 places, 1928/1969 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)&&X(p1))) U X(p2)))'
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (NOT p1), p0]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-13
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-13 finished in 62188 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((F(G(p0))&&F(p1)))||(F(p1)&&X(X((!p2&&F(G(p0)))))))))'
Support contains 4 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 1969/1969 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1522 transition count 1955
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1522 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1522 transition count 1954
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 1515 transition count 1946
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 1515 transition count 1946
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 1515 transition count 1944
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 1511 transition count 1938
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 1511 transition count 1938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 1511 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 1510 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 1510 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 1509 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 1508 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 1508 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 1508 transition count 1931
Applied a total of 61 rules in 417 ms. Remains 1508 /1536 variables (removed 28) and now considering 1931/1969 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4470269472260352934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12366814654551691129.kers'
[2026-05-23 02:23:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4470269472260352934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12366814654551691129.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1931 rows 1508 cols 4029 entries
Finished phase 1 with 1504 SingleSign rule and 1 generalized
[2026-05-23 02:23:39] [INFO ] Computed 3 invariants in 16 ms
Computed 3 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-12366814654551691129.kers
Total runtime 21 ms.
[2026-05-23 02:23:40] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-23 02:23:40] [INFO ] Invariant cache hit.
[2026-05-23 02:23:41] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2026-05-23 02:23:41] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3439 variables, and 3 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3439 variables, and 3 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60455ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1536 places, 1931/1969 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62078 ms. Remains : 1508/1536 places, 1931/1969 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((F(G(p0))&&F(p1)))||(F(p1)&&X(X((p2&&F(G(p0)))))))))'
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-15
Product exploration explored 100000 steps with 1073 reset in 128 ms.
Product exploration explored 100000 steps with 1079 reset in 250 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2104 edges and 1508 vertex of which 1500 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 9 factoid took 57 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (431 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (142 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 512908 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 512908 steps, saw 114789 distinct states, run finished after 3007 ms. (steps per millisecond=170 ) properties seen :0
[2026-05-23 02:24:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 680/681 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/681 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 804/1485 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1913/3398 variables, 1485/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3398 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/3405 variables, 5/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3405 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3411 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3411 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3417 variables, 3/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3417 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/3423 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3426 variables, 2/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3439/3439 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2413 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1508/1508 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) 680/681 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/681 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 804/1485 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1913/3398 variables, 1485/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3398 variables, 1/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3398 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/3405 variables, 5/1494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3405 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3411 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3411 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3417 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3417 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/3423 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3426 variables, 2/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3439/3439 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2092 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4514ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 9 factoid took 49 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Knowledge-based reduction took 7744 ms.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 1508 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1508/1508 places, 1931/1931 transitions.
Graph (trivial) has 1836 edges and 1508 vertex of which 684 / 1508 are part of one of the 63 SCC in 1 ms
Free SCC test removed 621 places
Ensure Unique test removed 721 transitions
Reduce isomorphic transitions removed 721 transitions.
Graph (complete) has 1377 edges and 887 vertex of which 879 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 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 477 place count 878 transition count 729
Reduce places removed 475 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 499 rules applied. Total rules applied 976 place count 403 transition count 705
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 990 place count 391 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 992 place count 389 transition count 703
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 992 place count 389 transition count 657
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1084 place count 343 transition count 657
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1100 place count 327 transition count 631
Iterating global reduction 4 with 16 rules applied. Total rules applied 1116 place count 327 transition count 631
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 1119 place count 327 transition count 628
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1122 place count 324 transition count 628
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1132 place count 314 transition count 614
Iterating global reduction 6 with 10 rules applied. Total rules applied 1142 place count 314 transition count 614
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1148 place count 314 transition count 608
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1150 place count 312 transition count 604
Iterating global reduction 7 with 2 rules applied. Total rules applied 1152 place count 312 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1154 place count 310 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1156 place count 310 transition count 600
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1158 place count 308 transition count 596
Iterating global reduction 7 with 2 rules applied. Total rules applied 1160 place count 308 transition count 596
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1162 place count 306 transition count 592
Iterating global reduction 7 with 2 rules applied. Total rules applied 1164 place count 306 transition count 592
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1166 place count 304 transition count 588
Iterating global reduction 7 with 2 rules applied. Total rules applied 1168 place count 304 transition count 588
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1170 place count 302 transition count 574
Iterating global reduction 7 with 2 rules applied. Total rules applied 1172 place count 302 transition count 574
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 1173 place count 302 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1174 place count 301 transition count 573
Performed 138 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 9 with 276 rules applied. Total rules applied 1450 place count 163 transition count 357
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 12 rules applied. Total rules applied 1462 place count 163 transition count 345
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 1464 place count 162 transition count 344
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1468 place count 158 transition count 339
Iterating global reduction 11 with 4 rules applied. Total rules applied 1472 place count 158 transition count 339
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1496 place count 146 transition count 324
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1508 place count 146 transition count 312
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 12 with 34 rules applied. Total rules applied 1542 place count 129 transition count 346
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 12 with 16 rules applied. Total rules applied 1558 place count 129 transition count 330
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1567 place count 120 transition count 312
Iterating global reduction 13 with 9 rules applied. Total rules applied 1576 place count 120 transition count 312
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1581 place count 120 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 1617 place count 120 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1618 place count 119 transition count 270
Applied a total of 1618 rules in 72 ms. Remains 119 /1508 variables (removed 1389) and now considering 270/1931 (removed 1661) transitions.
[2026-05-23 02:24:50] [INFO ] Flow matrix only has 213 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6976713933461186765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6447003836362911322.kers'
[2026-05-23 02:24:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6976713933461186765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6447003836362911322.kers]
Normalized transition count is 212 out of 213 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 119 cols 618 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-23 02:24:50] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6447003836362911322.kers
Total runtime 1 ms.
[2026-05-23 02:24:50] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-23 02:24:50] [INFO ] Flow matrix only has 213 transitions (discarded 57 similar events)
[2026-05-23 02:24:50] [INFO ] Invariant cache hit.
[2026-05-23 02:24:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 02:24:50] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [8, 45, 80]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 283 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1508 places, 270/1931 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 113 transition count 267
Applied a total of 4 rules in 5 ms. Remains 113 /116 variables (removed 3) and now considering 267/270 (removed 3) transitions.
[2026-05-23 02:24:50] [INFO ] Flow matrix only has 210 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-5636169207787497685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8154082704592287555.kers'
[2026-05-23 02:24:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5636169207787497685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8154082704592287555.kers]
Normalized transition count is 209 out of 210 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 113 cols 617 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 02:24:50] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8154082704592287555.kers
Total runtime 1 ms.
[2026-05-23 02:24:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-23 02:24:50] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2026-05-23 02:24:50] [INFO ] Invariant cache hit.
[2026-05-23 02:24:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 02:24:50] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1508 places, 267/1931 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 482 ms. Remains : 113/1508 places, 267/1931 transitions.
Computed a total of 1 stabilizing places and 15 stable transitions
Computed a total of 1 stabilizing places and 15 stable transitions
Knowledge based reduction with 3 factoid took 40 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 8078 steps (1469 resets) in 82 ms. (97 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 43 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Knowledge-based reduction took 162 ms.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14367 reset in 107 ms.
Stack based approach found an accepted trace after 6380 steps with 887 reset with depth 14 and stack size 13 in 15 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-15 finished in 71447 ms.
All properties solved by simple procedures.
Total runtime 587401 ms.

BK_STOP 1779503090942

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

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