Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028200307.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CloudReconfiguration-PT-313, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028200307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 660K May 29 14:32 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-313-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-313-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748594187673

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-313
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 08:36:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 08:36:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 08:36:29] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2025-05-30 08:36:29] [INFO ] Transformed 2585 places.
[2025-05-30 08:36:29] [INFO ] Transformed 3095 transitions.
[2025-05-30 08:36:29] [INFO ] Found NUPN structural information;
[2025-05-30 08:36:29] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-313-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-313-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 515 places :
Symmetric choice reduction at 0 with 515 rule applications. Total rules 515 place count 2070 transition count 2580
Iterating global reduction 0 with 515 rules applied. Total rules applied 1030 place count 2070 transition count 2580
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1058 place count 2070 transition count 2552
Discarding 241 places :
Symmetric choice reduction at 1 with 241 rule applications. Total rules 1299 place count 1829 transition count 2311
Iterating global reduction 1 with 241 rules applied. Total rules applied 1540 place count 1829 transition count 2311
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 1629 place count 1740 transition count 2222
Iterating global reduction 1 with 89 rules applied. Total rules applied 1718 place count 1740 transition count 2222
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1735 place count 1740 transition count 2205
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1783 place count 1692 transition count 2157
Iterating global reduction 2 with 48 rules applied. Total rules applied 1831 place count 1692 transition count 2157
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1840 place count 1692 transition count 2148
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1876 place count 1656 transition count 2107
Iterating global reduction 3 with 36 rules applied. Total rules applied 1912 place count 1656 transition count 2107
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1937 place count 1631 transition count 2082
Iterating global reduction 3 with 25 rules applied. Total rules applied 1962 place count 1631 transition count 2082
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1985 place count 1608 transition count 2059
Iterating global reduction 3 with 23 rules applied. Total rules applied 2008 place count 1608 transition count 2059
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 2030 place count 1586 transition count 2037
Iterating global reduction 3 with 22 rules applied. Total rules applied 2052 place count 1586 transition count 2037
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 2071 place count 1567 transition count 2005
Iterating global reduction 3 with 19 rules applied. Total rules applied 2090 place count 1567 transition count 2005
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2094 place count 1563 transition count 1999
Iterating global reduction 3 with 4 rules applied. Total rules applied 2098 place count 1563 transition count 1999
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2102 place count 1559 transition count 1995
Iterating global reduction 3 with 4 rules applied. Total rules applied 2106 place count 1559 transition count 1995
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2108 place count 1559 transition count 1993
Applied a total of 2108 rules in 1606 ms. Remains 1559 /2585 variables (removed 1026) and now considering 1993/3095 (removed 1102) transitions.
// Phase 1: matrix 1993 rows 1559 cols
[2025-05-30 08:36:31] [INFO ] Computed 4 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:36:31] [INFO ] Implicit Places using invariants in 518 ms returned []
[2025-05-30 08:36:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:36:33] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
Running 1992 sub problems to find dead transitions.
[2025-05-30 08:36:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1558 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1992 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1558/3552 variables, and 4 constraints, problems are : Problem set: 0 solved, 1992 unsolved in 30064 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1559 constraints, PredecessorRefiner: 1992/1992 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1992 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1558 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1992 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1558/3552 variables, and 4 constraints, problems are : Problem set: 0 solved, 1992 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1559 constraints, PredecessorRefiner: 0/1992 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60634ms problems are : Problem set: 0 solved, 1992 unsolved
Search for dead transitions found 0 dead transitions in 60654ms
Starting structural reductions in LTL mode, iteration 1 : 1559/2585 places, 1993/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64137 ms. Remains : 1559/2585 places, 1993/3095 transitions.
Support contains 28 out of 1559 places after structural reductions.
[2025-05-30 08:37:34] [INFO ] Flatten gal took : 134 ms
[2025-05-30 08:37:34] [INFO ] Flatten gal took : 72 ms
[2025-05-30 08:37:34] [INFO ] Input system was already deterministic with 1993 transitions.
RANDOM walk for 40000 steps (283 resets) in 1834 ms. (21 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40002 steps (78 resets) in 263 ms. (151 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (77 resets) in 405 ms. (98 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (77 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (71 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (74 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (76 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (77 resets) in 233 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (76 resets) in 140 ms. (283 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (76 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (76 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
[2025-05-30 08:37:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1524/1548 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1548 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1983/3531 variables, 1548/1552 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3531 variables, 0/1552 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/3533 variables, 1/1553 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3533 variables, 0/1553 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/3535 variables, 1/1554 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3535 variables, 0/1554 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 2/3537 variables, 1/1555 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3537 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 2/3539 variables, 1/1556 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3539 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 2/3541 variables, 1/1557 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3541 variables, 0/1557 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 2/3543 variables, 1/1558 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3543 variables, 0/1558 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 2/3545 variables, 1/1559 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3545/3552 variables, and 1559 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1555/1559 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1524/1548 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1548 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1983/3531 variables, 1548/1552 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3531 variables, 12/1564 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3531 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/3533 variables, 1/1565 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3533 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 2/3535 variables, 1/1566 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3535 variables, 0/1566 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 2/3537 variables, 1/1567 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3537/3552 variables, and 1567 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1551/1559 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10057ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 1559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1559/1559 places, 1993/1993 transitions.
Graph (trivial) has 1858 edges and 1559 vertex of which 680 / 1559 are part of one of the 63 SCC in 11 ms
Free SCC test removed 617 places
Drop transitions (Empty/Sink Transition effects.) removed 777 transitions
Reduce isomorphic transitions removed 777 transitions.
Graph (complete) has 1390 edges and 942 vertex of which 933 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 933 transition count 709
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 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 547 rules applied. Total rules applied 1052 place count 437 transition count 658
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 36 rules applied. Total rules applied 1088 place count 403 transition count 656
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1090 place count 401 transition count 656
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1090 place count 401 transition count 609
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1184 place count 354 transition count 609
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1195 place count 343 transition count 594
Iterating global reduction 4 with 11 rules applied. Total rules applied 1206 place count 343 transition count 594
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1208 place count 343 transition count 592
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1210 place count 341 transition count 592
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1216 place count 335 transition count 586
Iterating global reduction 6 with 6 rules applied. Total rules applied 1222 place count 335 transition count 586
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1228 place count 335 transition count 580
Performed 165 Post agglomeration using F-continuation condition with reduction of 102 identical transitions.
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 7 with 330 rules applied. Total rules applied 1558 place count 170 transition count 313
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1571 place count 170 transition count 300
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1574 place count 167 transition count 297
Iterating global reduction 8 with 3 rules applied. Total rules applied 1577 place count 167 transition count 297
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1593 place count 159 transition count 288
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1602 place count 159 transition count 279
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 9 with 4 rules applied. Total rules applied 1606 place count 157 transition count 277
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1611 place count 157 transition count 272
Performed 35 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 10 with 70 rules applied. Total rules applied 1681 place count 122 transition count 311
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 10 with 28 rules applied. Total rules applied 1709 place count 122 transition count 283
Discarding 18 places :
Symmetric choice reduction at 11 with 18 rule applications. Total rules 1727 place count 104 transition count 247
Iterating global reduction 11 with 18 rules applied. Total rules applied 1745 place count 104 transition count 247
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 1752 place count 104 transition count 240
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1756 place count 100 transition count 232
Iterating global reduction 12 with 4 rules applied. Total rules applied 1760 place count 100 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1764 place count 100 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1785 place count 100 transition count 207
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1786 place count 99 transition count 206
Iterating global reduction 13 with 1 rules applied. Total rules applied 1787 place count 99 transition count 206
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 13 with 4 rules applied. Total rules applied 1791 place count 97 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1792 place count 97 transition count 203
Free-agglomeration rule applied 4 times.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1796 place count 97 transition count 199
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1802 place count 93 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1803 place count 93 transition count 196
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 1808 place count 93 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1809 place count 93 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1810 place count 92 transition count 194
Applied a total of 1810 rules in 174 ms. Remains 92 /1559 variables (removed 1467) and now considering 194/1993 (removed 1799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 92/1559 places, 194/1993 transitions.
RANDOM walk for 40000 steps (410 resets) in 580 ms. (68 steps per ms) remains 1/12 properties
BEST_FIRST walk for 33280 steps (104 resets) in 72 ms. (455 steps per ms) remains 0/1 properties
FORMULA CloudReconfiguration-PT-313-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2172 edges and 1559 vertex of which 1550 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p1)))&&p0)))'
Support contains 4 out of 1559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 1993/1993 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1542 transition count 1975
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1542 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1542 transition count 1974
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 1532 transition count 1962
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 1532 transition count 1962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 1532 transition count 1961
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 1527 transition count 1956
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 1527 transition count 1956
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 1523 transition count 1951
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 1523 transition count 1951
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 1519 transition count 1946
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 1519 transition count 1946
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 1515 transition count 1941
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 1515 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 1515 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 1512 transition count 1935
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 1512 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 1510 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 1509 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 1509 transition count 1931
Applied a total of 103 rules in 936 ms. Remains 1509 /1559 variables (removed 50) and now considering 1931/1993 (removed 62) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2025-05-30 08:37:47] [INFO ] Computed 4 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:37:47] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-05-30 08:37:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:37:48] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2025-05-30 08:37:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60435ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1559 places, 1931/1993 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62596 ms. Remains : 1509/1559 places, 1931/1993 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-313-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLCardinality-04 finished in 62990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1559 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1559/1559 places, 1993/1993 transitions.
Graph (trivial) has 1901 edges and 1559 vertex of which 697 / 1559 are part of one of the 63 SCC in 6 ms
Free SCC test removed 634 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1430 edges and 925 vertex of which 916 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 505 transitions
Trivial Post-agglo rules discarded 505 transitions
Performed 505 trivial Post agglomeration. Transition count delta: 505
Iterating post reduction 0 with 505 rules applied. Total rules applied 507 place count 915 transition count 746
Reduce places removed 505 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 529 rules applied. Total rules applied 1036 place count 410 transition count 722
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1048 place count 398 transition count 722
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1048 place count 398 transition count 678
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1136 place count 354 transition count 678
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1153 place count 337 transition count 652
Iterating global reduction 3 with 17 rules applied. Total rules applied 1170 place count 337 transition count 652
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1172 place count 337 transition count 650
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1174 place count 335 transition count 650
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1184 place count 325 transition count 637
Iterating global reduction 5 with 10 rules applied. Total rules applied 1194 place count 325 transition count 637
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1200 place count 325 transition count 631
Performed 157 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 6 with 314 rules applied. Total rules applied 1514 place count 168 transition count 379
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1525 place count 168 transition count 368
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1530 place count 163 transition count 361
Iterating global reduction 7 with 5 rules applied. Total rules applied 1535 place count 163 transition count 361
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1536 place count 162 transition count 359
Iterating global reduction 7 with 1 rules applied. Total rules applied 1537 place count 162 transition count 359
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1538 place count 161 transition count 357
Iterating global reduction 7 with 1 rules applied. Total rules applied 1539 place count 161 transition count 357
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1540 place count 160 transition count 355
Iterating global reduction 7 with 1 rules applied. Total rules applied 1541 place count 160 transition count 355
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1542 place count 159 transition count 348
Iterating global reduction 7 with 1 rules applied. Total rules applied 1543 place count 159 transition count 348
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1563 place count 149 transition count 336
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1572 place count 149 transition count 327
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1573 place count 148 transition count 325
Iterating global reduction 8 with 1 rules applied. Total rules applied 1574 place count 148 transition count 325
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1612 place count 129 transition count 366
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 1634 place count 129 transition count 344
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1643 place count 120 transition count 326
Iterating global reduction 9 with 9 rules applied. Total rules applied 1652 place count 120 transition count 326
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1658 place count 120 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 10 with 41 rules applied. Total rules applied 1699 place count 120 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1700 place count 119 transition count 278
Applied a total of 1700 rules in 107 ms. Remains 119 /1559 variables (removed 1440) and now considering 278/1993 (removed 1715) transitions.
[2025-05-30 08:38:49] [INFO ] Flow matrix only has 219 transitions (discarded 59 similar events)
// Phase 1: matrix 219 rows 119 cols
[2025-05-30 08:38:49] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:38:49] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-30 08:38:49] [INFO ] Flow matrix only has 219 transitions (discarded 59 similar events)
[2025-05-30 08:38:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:38:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 08:38:49] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [14, 81]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 190 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1559 places, 278/1993 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 115 transition count 276
Applied a total of 4 rules in 13 ms. Remains 115 /117 variables (removed 2) and now considering 276/278 (removed 2) transitions.
[2025-05-30 08:38:49] [INFO ] Flow matrix only has 217 transitions (discarded 59 similar events)
// Phase 1: matrix 217 rows 115 cols
[2025-05-30 08:38:49] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:38:49] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-30 08:38:49] [INFO ] Flow matrix only has 217 transitions (discarded 59 similar events)
[2025-05-30 08:38:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:38:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 08:38:49] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1559 places, 276/1993 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 462 ms. Remains : 115/1559 places, 276/1993 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLCardinality-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-313-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLCardinality-05 finished in 563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 1559 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1559/1559 places, 1993/1993 transitions.
Graph (trivial) has 1897 edges and 1559 vertex of which 697 / 1559 are part of one of the 63 SCC in 3 ms
Free SCC test removed 634 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1431 edges and 925 vertex of which 916 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 503 place count 915 transition count 751
Reduce places removed 501 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 526 rules applied. Total rules applied 1029 place count 414 transition count 726
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1042 place count 402 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1043 place count 401 transition count 725
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1043 place count 401 transition count 681
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1131 place count 357 transition count 681
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1148 place count 340 transition count 655
Iterating global reduction 4 with 17 rules applied. Total rules applied 1165 place count 340 transition count 655
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1167 place count 340 transition count 653
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1169 place count 338 transition count 653
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1179 place count 328 transition count 640
Iterating global reduction 6 with 10 rules applied. Total rules applied 1189 place count 328 transition count 640
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1195 place count 328 transition count 634
Performed 157 Post agglomeration using F-continuation condition with reduction of 94 identical transitions.
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 7 with 314 rules applied. Total rules applied 1509 place count 171 transition count 383
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1520 place count 171 transition count 372
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1525 place count 166 transition count 365
Iterating global reduction 8 with 5 rules applied. Total rules applied 1530 place count 166 transition count 365
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1531 place count 165 transition count 363
Iterating global reduction 8 with 1 rules applied. Total rules applied 1532 place count 165 transition count 363
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1533 place count 164 transition count 361
Iterating global reduction 8 with 1 rules applied. Total rules applied 1534 place count 164 transition count 361
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1554 place count 154 transition count 349
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1564 place count 154 transition count 339
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1565 place count 153 transition count 337
Iterating global reduction 9 with 1 rules applied. Total rules applied 1566 place count 153 transition count 337
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1604 place count 134 transition count 379
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 9 with 26 rules applied. Total rules applied 1630 place count 134 transition count 353
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1639 place count 125 transition count 335
Iterating global reduction 10 with 9 rules applied. Total rules applied 1648 place count 125 transition count 335
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1654 place count 125 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 11 with 45 rules applied. Total rules applied 1699 place count 125 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1700 place count 124 transition count 283
Applied a total of 1700 rules in 85 ms. Remains 124 /1559 variables (removed 1435) and now considering 283/1993 (removed 1710) transitions.
[2025-05-30 08:38:49] [INFO ] Flow matrix only has 224 transitions (discarded 59 similar events)
// Phase 1: matrix 224 rows 124 cols
[2025-05-30 08:38:49] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:38:50] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-30 08:38:50] [INFO ] Flow matrix only has 224 transitions (discarded 59 similar events)
[2025-05-30 08:38:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:38:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 08:38:50] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [16, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 182 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/1559 places, 283/1993 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 281
Applied a total of 4 rules in 8 ms. Remains 120 /122 variables (removed 2) and now considering 281/283 (removed 2) transitions.
[2025-05-30 08:38:50] [INFO ] Flow matrix only has 222 transitions (discarded 59 similar events)
// Phase 1: matrix 222 rows 120 cols
[2025-05-30 08:38:50] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:38:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-30 08:38:50] [INFO ] Flow matrix only has 222 transitions (discarded 59 similar events)
[2025-05-30 08:38:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:38:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 08:38:50] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/1559 places, 281/1993 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 441 ms. Remains : 120/1559 places, 281/1993 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLCardinality-06
Product exploration explored 100000 steps with 9025 reset in 291 ms.
Product exploration explored 100000 steps with 9075 reset in 180 ms.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4317 resets) in 597 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (171 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8811 steps, run visited all 1 properties in 41 ms. (steps per millisecond=214 )
Probabilistic random walk after 8811 steps, saw 2561 distinct states, run finished after 44 ms. (steps per millisecond=200 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 281/281 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2025-05-30 08:38:51] [INFO ] Flow matrix only has 222 transitions (discarded 59 similar events)
[2025-05-30 08:38:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:38:51] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-30 08:38:51] [INFO ] Flow matrix only has 222 transitions (discarded 59 similar events)
[2025-05-30 08:38:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:38:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 08:38:51] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:38:51] [INFO ] Redundant transitions in 59 ms returned []
Running 276 sub problems to find dead transitions.
[2025-05-30 08:38:51] [INFO ] Flow matrix only has 222 transitions (discarded 59 similar events)
[2025-05-30 08:38:51] [INFO ] Invariant cache hit.
[2025-05-30 08:38:51] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 221/340 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/341 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 1/342 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 125 constraints, problems are : Problem set: 0 solved, 276 unsolved in 18036 ms.
Refiners :[State Equation: 120/120 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 221/340 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 276/399 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 1/341 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 1/342 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 401 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30015 ms.
Refiners :[State Equation: 120/120 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48115ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 48117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48346 ms. Remains : 120/120 places, 281/281 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4273 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (368 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8811 steps, run visited all 1 properties in 15 ms. (steps per millisecond=587 )
Probabilistic random walk after 8811 steps, saw 2561 distinct states, run finished after 16 ms. (steps per millisecond=550 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8956 reset in 169 ms.
Product exploration explored 100000 steps with 9034 reset in 171 ms.
Built C files in :
/tmp/ltsmin5363736863431060580
[2025-05-30 08:39:40] [INFO ] Computing symmetric may disable matrix : 281 transitions.
[2025-05-30 08:39:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:39:40] [INFO ] Computing symmetric may enable matrix : 281 transitions.
[2025-05-30 08:39:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:39:40] [INFO ] Computing Do-Not-Accords matrix : 281 transitions.
[2025-05-30 08:39:40] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:39:40] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5363736863431060580
Running compilation step : cd /tmp/ltsmin5363736863431060580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 618 ms.
Running link step : cd /tmp/ltsmin5363736863431060580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin5363736863431060580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14436578192182070435.hoa' '--buchi-type=spotba'
LTSmin run took 441 ms.
FORMULA CloudReconfiguration-PT-313-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-313-LTLCardinality-06 finished in 52187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 1993/1993 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1542 transition count 1975
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1542 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1542 transition count 1974
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 1533 transition count 1963
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 1533 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 1533 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 1529 transition count 1958
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 1529 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 1526 transition count 1955
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 1526 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 1523 transition count 1952
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 1523 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 1520 transition count 1948
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 1520 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 1517 transition count 1943
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 1517 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 1515 transition count 1940
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 1514 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 1514 transition count 1939
Applied a total of 92 rules in 624 ms. Remains 1514 /1559 variables (removed 45) and now considering 1939/1993 (removed 54) transitions.
// Phase 1: matrix 1939 rows 1514 cols
[2025-05-30 08:39:42] [INFO ] Computed 4 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:39:42] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-05-30 08:39:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:39:43] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
Running 1938 sub problems to find dead transitions.
[2025-05-30 08:39:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3453 variables, and 4 constraints, problems are : Problem set: 0 solved, 1938 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1938/1938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1938 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3453 variables, and 4 constraints, problems are : Problem set: 0 solved, 1938 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60555ms problems are : Problem set: 0 solved, 1938 unsolved
Search for dead transitions found 0 dead transitions in 60560ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1559 places, 1939/1993 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62371 ms. Remains : 1514/1559 places, 1939/1993 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLCardinality-08
Product exploration explored 100000 steps with 714 reset in 190 ms.
Product exploration explored 100000 steps with 711 reset in 236 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2116 edges and 1514 vertex of which 1505 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (278 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (69 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 406620 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 406620 steps, saw 101190 distinct states, run finished after 3003 ms. (steps per millisecond=135 ) properties seen :0
[2025-05-30 08:40:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 699/701 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 802/1503 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1929/3432 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3453 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3453 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3453 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3453/3453 variables, and 1518 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1221 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 699/701 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 802/1503 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1929/3432 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3453 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3453 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3453 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3453/3453 variables, and 1519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2106 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3337ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 276 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=138 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Applied a total of 0 rules in 57 ms. Remains 1514 /1514 variables (removed 0) and now considering 1939/1939 (removed 0) transitions.
[2025-05-30 08:40:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:40:52] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-05-30 08:40:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:40:53] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
Running 1938 sub problems to find dead transitions.
[2025-05-30 08:40:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3453 variables, and 4 constraints, problems are : Problem set: 0 solved, 1938 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1938/1938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1938 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1938 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3453 variables, and 4 constraints, problems are : Problem set: 0 solved, 1938 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60450ms problems are : Problem set: 0 solved, 1938 unsolved
Search for dead transitions found 0 dead transitions in 60453ms
Finished structural reductions in LTL mode , in 1 iterations and 61708 ms. Remains : 1514/1514 places, 1939/1939 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2116 edges and 1514 vertex of which 1505 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (278 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (76 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 418472 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 418472 steps, saw 104202 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
[2025-05-30 08:41:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 699/701 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 802/1503 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1929/3432 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3453 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3453 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3453 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3453/3453 variables, and 1518 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1274 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 699/701 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 802/1503 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1929/3432 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3453 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3453 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3453 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3453/3453 variables, and 1519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3318ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 100 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 718 reset in 165 ms.
Product exploration explored 100000 steps with 716 reset in 176 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Graph (trivial) has 1848 edges and 1514 vertex of which 691 / 1514 are part of one of the 63 SCC in 4 ms
Free SCC test removed 628 places
Ensure Unique test removed 729 transitions
Reduce isomorphic transitions removed 729 transitions.
Graph (complete) has 1381 edges and 886 vertex of which 877 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 479 place count 877 transition count 1205
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 491 place count 877 transition count 1193
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 491 place count 877 transition count 1206
Deduced a syphon composed of 498 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 512 place count 877 transition count 1206
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 794 place count 595 transition count 915
Deduced a syphon composed of 231 places in 1 ms
Iterating global reduction 2 with 282 rules applied. Total rules applied 1076 place count 595 transition count 915
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1087 place count 584 transition count 900
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1098 place count 584 transition count 900
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1104 place count 584 transition count 894
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1116 place count 572 transition count 882
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1128 place count 572 transition count 882
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1130 place count 570 transition count 878
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1132 place count 570 transition count 878
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1134 place count 568 transition count 874
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1136 place count 568 transition count 874
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1140 place count 564 transition count 870
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1144 place count 564 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1146 place count 562 transition count 866
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1148 place count 562 transition count 866
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1150 place count 560 transition count 862
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1152 place count 560 transition count 862
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1156 place count 556 transition count 856
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1160 place count 556 transition count 856
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1163 place count 553 transition count 847
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1166 place count 553 transition count 847
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1168 place count 551 transition count 845
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1170 place count 551 transition count 845
Performed 109 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 322 places in 0 ms
Iterating global reduction 3 with 109 rules applied. Total rules applied 1279 place count 551 transition count 923
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 1320 place count 551 transition count 882
Discarding 103 places :
Symmetric choice reduction at 4 with 103 rule applications. Total rules 1423 place count 448 transition count 769
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 4 with 103 rules applied. Total rules applied 1526 place count 448 transition count 769
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1532 place count 442 transition count 760
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1538 place count 442 transition count 760
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1545 place count 442 transition count 760
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1550 place count 442 transition count 755
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1565 place count 427 transition count 736
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1580 place count 427 transition count 736
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1586 place count 427 transition count 730
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1590 place count 423 transition count 726
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1594 place count 423 transition count 726
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1597 place count 423 transition count 726
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1603 place count 423 transition count 720
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1606 place count 420 transition count 717
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1609 place count 420 transition count 717
Performed 71 Post agglomeration using F-continuation condition with reduction of 113 identical transitions.
Deduced a syphon composed of 286 places in 0 ms
Iterating global reduction 7 with 71 rules applied. Total rules applied 1680 place count 420 transition count 1045
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 7 with 126 rules applied. Total rules applied 1806 place count 420 transition count 919
Discarding 125 places :
Symmetric choice reduction at 8 with 125 rule applications. Total rules 1931 place count 295 transition count 591
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 8 with 125 rules applied. Total rules applied 2056 place count 295 transition count 591
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 2071 place count 295 transition count 576
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 2098 place count 268 transition count 518
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 9 with 27 rules applied. Total rules applied 2125 place count 268 transition count 518
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2128 place count 268 transition count 562
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2132 place count 268 transition count 558
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2136 place count 264 transition count 530
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2140 place count 264 transition count 530
Deduced a syphon composed of 142 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 10 with 47 rules applied. Total rules applied 2187 place count 264 transition count 483
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2191 place count 260 transition count 479
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2195 place count 260 transition count 479
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2198 place count 260 transition count 539
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2201 place count 257 transition count 524
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2204 place count 257 transition count 524
Deduced a syphon composed of 138 places in 0 ms
Applied a total of 2204 rules in 340 ms. Remains 257 /1514 variables (removed 1257) and now considering 524/1939 (removed 1415) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:42:01] [INFO ] Redundant transitions in 11 ms returned []
Running 523 sub problems to find dead transitions.
[2025-05-30 08:42:01] [INFO ] Flow matrix only has 467 transitions (discarded 57 similar events)
// Phase 1: matrix 467 rows 257 cols
[2025-05-30 08:42:01] [INFO ] Computed 0 invariants in 2 ms
[2025-05-30 08:42:01] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
At refinement iteration 1 (OVERLAPS) 466/722 variables, 256/256 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/722 variables, 3/259 constraints. Problems are: Problem set: 250 solved, 273 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/722 variables, 0/259 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 1/723 variables, 1/260 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/723 variables, 0/260 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 1/724 variables, 1/261 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/261 constraints. Problems are: Problem set: 250 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 724/724 variables, and 261 constraints, problems are : Problem set: 250 solved, 273 unsolved in 30015 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 250 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 463/581 variables, 118/118 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 3/121 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 273/394 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/394 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 142/723 variables, 139/533 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/723 variables, 0/533 constraints. Problems are: Problem set: 250 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 1/724 variables, 1/534 constraints. Problems are: Problem set: 250 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 724/724 variables, and 534 constraints, problems are : Problem set: 250 solved, 273 unsolved in 30022 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 273/523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 250 solved, 273 unsolved
Search for dead transitions found 250 dead transitions in 60135ms
Found 250 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 250 transitions
Dead transitions reduction (with SMT) removed 250 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 257/1514 places, 274/1939 transitions.
Graph (complete) has 423 edges and 257 vertex of which 119 are kept as prefixes of interest. Removing 138 places using SCC suffix rule.0 ms
Discarding 138 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 119 /257 variables (removed 138) and now considering 274/274 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/1514 places, 274/1939 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60504 ms. Remains : 119/1514 places, 274/1939 transitions.
Built C files in :
/tmp/ltsmin16332172558031798496
[2025-05-30 08:43:02] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16332172558031798496
Running compilation step : cd /tmp/ltsmin16332172558031798496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin16332172558031798496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin16332172558031798496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1514/1514 places, 1939/1939 transitions.
Applied a total of 0 rules in 70 ms. Remains 1514 /1514 variables (removed 0) and now considering 1939/1939 (removed 0) transitions.
// Phase 1: matrix 1939 rows 1514 cols
[2025-05-30 08:43:05] [INFO ] Computed 4 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:43:05] [INFO ] Implicit Places using invariants in 397 ms returned []
[2025-05-30 08:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:43:06] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
Running 1938 sub problems to find dead transitions.
[2025-05-30 08:43:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 1.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 1.0)
(s1110 0.0)
(s1111 1.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 1.0)
(s1120 1.0)
(s1121 0.0)
(s1122 1.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 1.0)
(s1133 1.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3453 variables, and 4 constraints, problems are : Problem set: 0 solved, 1938 unsolved in 30050 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1938/1938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1938 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1938 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3453 variables, and 4 constraints, problems are : Problem set: 0 solved, 1938 unsolved in 30054 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 1938 unsolved
Search for dead transitions found 0 dead transitions in 60463ms
Finished structural reductions in LTL mode , in 1 iterations and 61835 ms. Remains : 1514/1514 places, 1939/1939 transitions.
Built C files in :
/tmp/ltsmin13256866356598774948
[2025-05-30 08:44:07] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13256866356598774948
Running compilation step : cd /tmp/ltsmin13256866356598774948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin13256866356598774948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin13256866356598774948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 08:44:10] [INFO ] Flatten gal took : 52 ms
[2025-05-30 08:44:10] [INFO ] Flatten gal took : 49 ms
[2025-05-30 08:44:10] [INFO ] Time to serialize gal into /tmp/LTL16956126468928842506.gal : 15 ms
[2025-05-30 08:44:10] [INFO ] Time to serialize properties into /tmp/LTL5371150898409554540.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16956126468928842506.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17262436498413499773.hoa' '-atoms' '/tmp/LTL5371150898409554540.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5371150898409554540.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17262436498413499773.hoa
Detected timeout of ITS tools.
[2025-05-30 08:44:25] [INFO ] Flatten gal took : 48 ms
[2025-05-30 08:44:25] [INFO ] Flatten gal took : 42 ms
[2025-05-30 08:44:25] [INFO ] Time to serialize gal into /tmp/LTL6450936366248637399.gal : 8 ms
[2025-05-30 08:44:25] [INFO ] Time to serialize properties into /tmp/LTL9555127037680520112.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6450936366248637399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9555127037680520112.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p1028==0)||(p409==1))")))))
Formula 0 simplified : XXF!"((p1028==0)||(p409==1))"
Detected timeout of ITS tools.
[2025-05-30 08:44:40] [INFO ] Flatten gal took : 39 ms
[2025-05-30 08:44:40] [INFO ] Applying decomposition
[2025-05-30 08:44:40] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4810019134858529482.txt' '-o' '/tmp/graph4810019134858529482.bin' '-w' '/tmp/graph4810019134858529482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4810019134858529482.bin' '-l' '-1' '-v' '-w' '/tmp/graph4810019134858529482.weights' '-q' '0' '-e' '0.001'
[2025-05-30 08:44:40] [INFO ] Decomposing Gal with order
[2025-05-30 08:44:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:44:41] [INFO ] Removed a total of 484 redundant transitions.
[2025-05-30 08:44:41] [INFO ] Flatten gal took : 123 ms
[2025-05-30 08:44:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 32 ms.
[2025-05-30 08:44:41] [INFO ] Time to serialize gal into /tmp/LTL12652370248928394104.gal : 20 ms
[2025-05-30 08:44:41] [INFO ] Time to serialize properties into /tmp/LTL18374504574432028161.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12652370248928394104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18374504574432028161.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i17.i0.i6.u230.p1028==0)||(i0.u69.p409==1))")))))
Formula 0 simplified : XXF!"((i17.i0.i6.u230.p1028==0)||(i0.u69.p409==1))"
Reverse transition relation is NOT exact ! Due to transitions t26, t189, t270, t301, t381, t452, t504, t696, t748, t779, t808, t857, t930, t981, t1192, t12...2128
Computing Next relation with stutter on 140576 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1289 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,13.0741,458800,1,0,902614,14834,22755,1.63994e+06,683,71365,2703014
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-313-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property CloudReconfiguration-PT-313-LTLCardinality-08 finished in 314205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((X(X(!p0)) U ((!p1&&X(X(!p0)))||X(X(G(!p0))))))) U !p2))'
Support contains 5 out of 1559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 1993/1993 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1544 transition count 1977
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1544 transition count 1977
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 1544 transition count 1976
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 1535 transition count 1966
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 1535 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 1535 transition count 1965
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 1531 transition count 1961
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 1531 transition count 1961
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 1528 transition count 1957
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 1528 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 1525 transition count 1953
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 1525 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 1522 transition count 1949
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 1522 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 1522 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 1520 transition count 1944
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 1520 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 1518 transition count 1941
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 1518 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 1517 transition count 1940
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 1517 transition count 1940
Applied a total of 87 rules in 620 ms. Remains 1517 /1559 variables (removed 42) and now considering 1940/1993 (removed 53) transitions.
// Phase 1: matrix 1940 rows 1517 cols
[2025-05-30 08:44:56] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:57] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-05-30 08:44:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:44:57] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2025-05-30 08:44:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3457 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1516/3457 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Starting structural reductions in LTL mode, iteration 1 : 1517/1559 places, 1940/1993 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62159 ms. Remains : 1517/1559 places, 1940/1993 transitions.
Stuttering acceptance computed with spot in 170 ms :[p2, p0, p0, p0, true]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLCardinality-10
Product exploration explored 100000 steps with 16585 reset in 251 ms.
Product exploration explored 100000 steps with 16628 reset in 269 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2117 edges and 1517 vertex of which 1508 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND p0 p1))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 114 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p2, p0, p0, p0, true]
RANDOM walk for 40000 steps (273 resets) in 201 ms. (198 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (77 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (82 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (78 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (79 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
[2025-05-30 08:45:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 825/828 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 678/1506 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1506 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3436 variables, 1506/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3454 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3454 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3456 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3456 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3457 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3457 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3457 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3457/3457 variables, and 1521 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3398 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1517/1517 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 825/828 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 678/1506 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1506 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3436 variables, 1506/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3436 variables, 4/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3436 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3438 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3438 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3440 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3440 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3442 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3442 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3444 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3444 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3446 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3446 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3448 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3448 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3450 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3450 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3452 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3452 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3454 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3454 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3456 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 4 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 3456/3457 variables, and 1524 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1516/1517 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8420ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1517/1517 places, 1940/1940 transitions.
Graph (trivial) has 1846 edges and 1517 vertex of which 687 / 1517 are part of one of the 63 SCC in 3 ms
Free SCC test removed 624 places
Drop transitions (Empty/Sink Transition effects.) removed 788 transitions
Reduce isomorphic transitions removed 788 transitions.
Graph (complete) has 1324 edges and 893 vertex of which 884 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 884 transition count 645
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 554 rules applied. Total rules applied 1059 place count 388 transition count 587
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1097 place count 350 transition count 587
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 1097 place count 350 transition count 537
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1197 place count 300 transition count 537
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1207 place count 290 transition count 523
Iterating global reduction 3 with 10 rules applied. Total rules applied 1217 place count 290 transition count 523
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1219 place count 290 transition count 521
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1221 place count 288 transition count 521
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1228 place count 281 transition count 513
Iterating global reduction 5 with 7 rules applied. Total rules applied 1235 place count 281 transition count 513
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1241 place count 281 transition count 507
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1242 place count 280 transition count 501
Iterating global reduction 6 with 1 rules applied. Total rules applied 1243 place count 280 transition count 501
Performed 150 Post agglomeration using F-continuation condition with reduction of 98 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 6 with 300 rules applied. Total rules applied 1543 place count 130 transition count 253
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1559 place count 130 transition count 237
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1563 place count 126 transition count 231
Iterating global reduction 7 with 4 rules applied. Total rules applied 1567 place count 126 transition count 231
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 1593 place count 113 transition count 215
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1606 place count 113 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1608 place count 112 transition count 201
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1611 place count 112 transition count 198
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 1677 place count 79 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 9 with 56 rules applied. Total rules applied 1733 place count 79 transition count 174
Discarding 24 places :
Symmetric choice reduction at 10 with 24 rule applications. Total rules 1757 place count 55 transition count 149
Iterating global reduction 10 with 24 rules applied. Total rules applied 1781 place count 55 transition count 149
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1796 place count 55 transition count 134
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1801 place count 50 transition count 124
Iterating global reduction 11 with 5 rules applied. Total rules applied 1806 place count 50 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1811 place count 50 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 12 with 31 rules applied. Total rules applied 1842 place count 50 transition count 88
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1845 place count 47 transition count 79
Iterating global reduction 12 with 3 rules applied. Total rules applied 1848 place count 47 transition count 79
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1851 place count 44 transition count 76
Iterating global reduction 12 with 3 rules applied. Total rules applied 1854 place count 44 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1857 place count 44 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1860 place count 44 transition count 70
Free-agglomeration rule applied 3 times.
Iterating global reduction 13 with 3 rules applied. Total rules applied 1863 place count 44 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1866 place count 41 transition count 67
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1867 place count 41 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1868 place count 40 transition count 66
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 38 edges and 39 vertex of which 25 / 39 are part of one of the 9 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 14 with 2 rules applied. Total rules applied 1870 place count 23 transition count 66
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 15 with 33 rules applied. Total rules applied 1903 place count 23 transition count 33
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 1906 place count 20 transition count 30
Iterating global reduction 16 with 3 rules applied. Total rules applied 1909 place count 20 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 1915 place count 17 transition count 27
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 1922 place count 17 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1923 place count 17 transition count 19
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 1926 place count 17 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 1929 place count 14 transition count 16
Applied a total of 1929 rules in 60 ms. Remains 14 /1517 variables (removed 1503) and now considering 16/1940 (removed 1924) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 14/1517 places, 16/1940 transitions.
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND p0 p1))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 13 factoid took 304 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p2, p0, p0, p0, true]
Stuttering acceptance computed with spot in 184 ms :[p2, p0, p0, p0, true]
[2025-05-30 08:46:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG p2
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND p0 p1))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2))), (G p2)]
Property proved to be false thanks to negative knowledge :(G p2)
Knowledge based reduction with 13 factoid took 386 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-313-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-313-LTLCardinality-10 finished in 73495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(G(p1))||(p1&&F(p2))))||p0)))'
Support contains 5 out of 1559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 1993/1993 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1542 transition count 1975
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1542 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1542 transition count 1974
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 1531 transition count 1961
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 1531 transition count 1961
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 1531 transition count 1960
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 1526 transition count 1955
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 1526 transition count 1955
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 1522 transition count 1950
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 1522 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 1518 transition count 1945
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 1518 transition count 1945
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 1514 transition count 1940
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 1514 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 93 place count 1514 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 1511 transition count 1934
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 1511 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 1509 transition count 1931
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 1508 transition count 1930
Applied a total of 105 rules in 615 ms. Remains 1508 /1559 variables (removed 51) and now considering 1930/1993 (removed 63) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2025-05-30 08:46:10] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:10] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-30 08:46:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:46:11] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 08:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60518ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60522ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1559 places, 1930/1993 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62311 ms. Remains : 1508/1559 places, 1930/1993 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLCardinality-11
Product exploration explored 100000 steps with 701 reset in 183 ms.
Product exploration explored 100000 steps with 709 reset in 184 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 130 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
RANDOM walk for 40000 steps (280 resets) in 172 ms. (231 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (77 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (77 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (74 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
[2025-05-30 08:47:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 816/819 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 678/1497 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3417 variables, 1497/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3438 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3438 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3438 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3438/3438 variables, and 1512 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3189 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 816/819 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 678/1497 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3417 variables, 1497/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3417 variables, 4/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3417 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3419 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3419 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3421 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3421 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3423 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3423 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3425 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3425 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3427 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3427 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3429 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3429 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3431 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3431 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3433 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3433 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3435 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3435 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3437 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
(s616 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 7)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0timeout
)
(s617 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3437/3438 variables, and 1515 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5025 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1508 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8224ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Graph (trivial) has 1837 edges and 1508 vertex of which 693 / 1508 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1306 edges and 878 vertex of which 869 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 481 transitions
Trivial Post-agglo rules discarded 481 transitions
Performed 481 trivial Post agglomeration. Transition count delta: 481
Iterating post reduction 0 with 488 rules applied. Total rules applied 490 place count 869 transition count 642
Reduce places removed 481 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 541 rules applied. Total rules applied 1031 place count 388 transition count 582
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 41 rules applied. Total rules applied 1072 place count 349 transition count 580
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1074 place count 347 transition count 580
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1074 place count 347 transition count 530
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 1174 place count 297 transition count 530
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1186 place count 285 transition count 513
Iterating global reduction 4 with 12 rules applied. Total rules applied 1198 place count 285 transition count 513
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1201 place count 285 transition count 510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1204 place count 282 transition count 510
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1212 place count 274 transition count 500
Iterating global reduction 6 with 8 rules applied. Total rules applied 1220 place count 274 transition count 500
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1226 place count 274 transition count 494
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1228 place count 272 transition count 482
Iterating global reduction 7 with 2 rules applied. Total rules applied 1230 place count 272 transition count 482
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 1231 place count 272 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1232 place count 271 transition count 481
Performed 142 Post agglomeration using F-continuation condition with reduction of 97 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 9 with 284 rules applied. Total rules applied 1516 place count 129 transition count 242
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 13 rules applied. Total rules applied 1529 place count 129 transition count 229
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 1531 place count 128 transition count 228
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1534 place count 125 transition count 225
Iterating global reduction 11 with 3 rules applied. Total rules applied 1537 place count 125 transition count 225
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1563 place count 112 transition count 209
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 1578 place count 112 transition count 194
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1644 place count 79 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 12 with 54 rules applied. Total rules applied 1698 place count 79 transition count 171
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 1722 place count 55 transition count 146
Iterating global reduction 13 with 24 rules applied. Total rules applied 1746 place count 55 transition count 146
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 1759 place count 55 transition count 133
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 1764 place count 50 transition count 123
Iterating global reduction 14 with 5 rules applied. Total rules applied 1769 place count 50 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1774 place count 50 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 15 with 30 rules applied. Total rules applied 1804 place count 50 transition count 88
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1807 place count 47 transition count 79
Iterating global reduction 15 with 3 rules applied. Total rules applied 1810 place count 47 transition count 79
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1813 place count 44 transition count 76
Iterating global reduction 15 with 3 rules applied. Total rules applied 1816 place count 44 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1819 place count 44 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1822 place count 44 transition count 70
Free-agglomeration rule applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 1825 place count 44 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1828 place count 41 transition count 67
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1829 place count 41 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1830 place count 40 transition count 66
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 38 edges and 39 vertex of which 25 / 39 are part of one of the 9 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 17 with 2 rules applied. Total rules applied 1832 place count 23 transition count 66
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 18 with 34 rules applied. Total rules applied 1866 place count 23 transition count 32
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 1869 place count 20 transition count 29
Iterating global reduction 19 with 3 rules applied. Total rules applied 1872 place count 20 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 19 with 6 rules applied. Total rules applied 1878 place count 17 transition count 26
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 1885 place count 17 transition count 19
Free-agglomeration rule applied 3 times.
Iterating global reduction 20 with 3 rules applied. Total rules applied 1888 place count 17 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1891 place count 14 transition count 16
Applied a total of 1891 rules in 60 ms. Remains 14 /1508 variables (removed 1494) and now considering 16/1930 (removed 1914) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 14/1508 places, 16/1930 transitions.
RANDOM walk for 98 steps (5 resets) in 4 ms. (19 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 230 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 5 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Applied a total of 0 rules in 61 ms. Remains 1508 /1508 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2025-05-30 08:47:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:47:22] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-05-30 08:47:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:47:23] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 08:47:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60447ms
Finished structural reductions in LTL mode , in 1 iterations and 61677 ms. Remains : 1508/1508 places, 1930/1930 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 130 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
RANDOM walk for 40000 steps (275 resets) in 164 ms. (242 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (80 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (75 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (75 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
[2025-05-30 08:48:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 816/819 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 678/1497 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3417 variables, 1497/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3438 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3438 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3438 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3438/3438 variables, and 1512 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3327 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 816/819 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/819 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 678/1497 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3417 variables, 1497/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3417 variables, 4/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3417 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3419 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3419 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3421 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3421 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3423 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3423 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3425 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3425 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3427 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3427 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3429 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3429 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3431 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3431 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3433 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3433 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3435 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3435 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3437 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3437/3438 variables, and 1515 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1508 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8363ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Graph (trivial) has 1837 edges and 1508 vertex of which 693 / 1508 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1306 edges and 878 vertex of which 869 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 481 transitions
Trivial Post-agglo rules discarded 481 transitions
Performed 481 trivial Post agglomeration. Transition count delta: 481
Iterating post reduction 0 with 488 rules applied. Total rules applied 490 place count 869 transition count 642
Reduce places removed 481 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 541 rules applied. Total rules applied 1031 place count 388 transition count 582
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 41 rules applied. Total rules applied 1072 place count 349 transition count 580
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1074 place count 347 transition count 580
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1074 place count 347 transition count 530
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1174 place count 297 transition count 530
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1186 place count 285 transition count 513
Iterating global reduction 4 with 12 rules applied. Total rules applied 1198 place count 285 transition count 513
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1201 place count 285 transition count 510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1204 place count 282 transition count 510
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1212 place count 274 transition count 500
Iterating global reduction 6 with 8 rules applied. Total rules applied 1220 place count 274 transition count 500
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1226 place count 274 transition count 494
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1228 place count 272 transition count 482
Iterating global reduction 7 with 2 rules applied. Total rules applied 1230 place count 272 transition count 482
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 1231 place count 272 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1232 place count 271 transition count 481
Performed 142 Post agglomeration using F-continuation condition with reduction of 97 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 9 with 284 rules applied. Total rules applied 1516 place count 129 transition count 242
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 13 rules applied. Total rules applied 1529 place count 129 transition count 229
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 1531 place count 128 transition count 228
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1534 place count 125 transition count 225
Iterating global reduction 11 with 3 rules applied. Total rules applied 1537 place count 125 transition count 225
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1563 place count 112 transition count 209
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 1578 place count 112 transition count 194
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1644 place count 79 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 12 with 54 rules applied. Total rules applied 1698 place count 79 transition count 171
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 1722 place count 55 transition count 146
Iterating global reduction 13 with 24 rules applied. Total rules applied 1746 place count 55 transition count 146
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 1759 place count 55 transition count 133
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 1764 place count 50 transition count 123
Iterating global reduction 14 with 5 rules applied. Total rules applied 1769 place count 50 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1774 place count 50 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 15 with 30 rules applied. Total rules applied 1804 place count 50 transition count 88
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1807 place count 47 transition count 79
Iterating global reduction 15 with 3 rules applied. Total rules applied 1810 place count 47 transition count 79
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1813 place count 44 transition count 76
Iterating global reduction 15 with 3 rules applied. Total rules applied 1816 place count 44 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1819 place count 44 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1822 place count 44 transition count 70
Free-agglomeration rule applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 1825 place count 44 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1828 place count 41 transition count 67
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1829 place count 41 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1830 place count 40 transition count 66
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 38 edges and 39 vertex of which 25 / 39 are part of one of the 9 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 17 with 2 rules applied. Total rules applied 1832 place count 23 transition count 66
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 18 with 34 rules applied. Total rules applied 1866 place count 23 transition count 32
Discarding 3 places :
Symmetric choice reduction at 19 with 3 rule applications. Total rules 1869 place count 20 transition count 29
Iterating global reduction 19 with 3 rules applied. Total rules applied 1872 place count 20 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 19 with 6 rules applied. Total rules applied 1878 place count 17 transition count 26
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 1885 place count 17 transition count 19
Free-agglomeration rule applied 3 times.
Iterating global reduction 20 with 3 rules applied. Total rules applied 1888 place count 17 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1891 place count 14 transition count 16
Applied a total of 1891 rules in 59 ms. Remains 14 /1508 variables (removed 1494) and now considering 16/1930 (removed 1914) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 14/1508 places, 16/1930 transitions.
RANDOM walk for 97 steps (6 resets) in 5 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 307 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Product exploration explored 100000 steps with 707 reset in 146 ms.
Product exploration explored 100000 steps with 719 reset in 150 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 5 out of 1508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Graph (trivial) has 1835 edges and 1508 vertex of which 693 / 1508 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1369 edges and 878 vertex of which 869 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 467 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 467 rules applied. Total rules applied 469 place count 869 transition count 1193
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 481 place count 869 transition count 1181
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 481 place count 869 transition count 1195
Deduced a syphon composed of 489 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 503 place count 869 transition count 1195
Discarding 277 places :
Symmetric choice reduction at 2 with 277 rule applications. Total rules 780 place count 592 transition count 908
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 2 with 277 rules applied. Total rules applied 1057 place count 592 transition count 908
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1069 place count 580 transition count 892
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1081 place count 580 transition count 892
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1087 place count 580 transition count 886
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1099 place count 568 transition count 874
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1111 place count 568 transition count 874
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1113 place count 566 transition count 870
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1115 place count 566 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1117 place count 564 transition count 866
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1119 place count 564 transition count 866
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1123 place count 560 transition count 862
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1127 place count 560 transition count 862
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1129 place count 558 transition count 858
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1131 place count 558 transition count 858
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1133 place count 556 transition count 854
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1135 place count 556 transition count 854
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1139 place count 552 transition count 848
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1143 place count 552 transition count 848
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1147 place count 548 transition count 832
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1151 place count 548 transition count 832
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1152 place count 548 transition count 832
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1156 place count 544 transition count 828
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1160 place count 544 transition count 828
Performed 105 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 314 places in 1 ms
Iterating global reduction 4 with 105 rules applied. Total rules applied 1265 place count 544 transition count 903
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1304 place count 544 transition count 864
Discarding 98 places :
Symmetric choice reduction at 5 with 98 rule applications. Total rules 1402 place count 446 transition count 756
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 5 with 98 rules applied. Total rules applied 1500 place count 446 transition count 756
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1506 place count 440 transition count 747
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1512 place count 440 transition count 747
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1519 place count 440 transition count 747
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1523 place count 440 transition count 743
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1538 place count 425 transition count 724
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1553 place count 425 transition count 724
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1559 place count 425 transition count 718
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1563 place count 421 transition count 714
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1567 place count 421 transition count 714
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1570 place count 421 transition count 714
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1576 place count 421 transition count 708
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1579 place count 418 transition count 705
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1582 place count 418 transition count 705
Performed 70 Post agglomeration using F-continuation condition with reduction of 115 identical transitions.
Deduced a syphon composed of 282 places in 0 ms
Iterating global reduction 8 with 70 rules applied. Total rules applied 1652 place count 418 transition count 1014
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 8 with 119 rules applied. Total rules applied 1771 place count 418 transition count 895
Discarding 124 places :
Symmetric choice reduction at 9 with 124 rule applications. Total rules 1895 place count 294 transition count 572
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 9 with 124 rules applied. Total rules applied 2019 place count 294 transition count 572
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 2029 place count 294 transition count 562
Discarding 24 places :
Symmetric choice reduction at 10 with 24 rule applications. Total rules 2053 place count 270 transition count 515
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 24 rules applied. Total rules applied 2077 place count 270 transition count 515
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2080 place count 270 transition count 567
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2083 place count 267 transition count 538
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2086 place count 267 transition count 538
Deduced a syphon composed of 143 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 10 with 45 rules applied. Total rules applied 2131 place count 267 transition count 493
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2135 place count 263 transition count 489
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2139 place count 263 transition count 489
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2142 place count 263 transition count 549
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2145 place count 260 transition count 534
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2148 place count 260 transition count 534
Deduced a syphon composed of 139 places in 1 ms
Applied a total of 2148 rules in 243 ms. Remains 260 /1508 variables (removed 1248) and now considering 534/1930 (removed 1396) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:48:34] [INFO ] Redundant transitions in 11 ms returned []
Running 533 sub problems to find dead transitions.
[2025-05-30 08:48:34] [INFO ] Flow matrix only has 477 transitions (discarded 57 similar events)
// Phase 1: matrix 477 rows 260 cols
[2025-05-30 08:48:34] [INFO ] Computed 0 invariants in 1 ms
[2025-05-30 08:48:34] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
At refinement iteration 1 (OVERLAPS) 476/735 variables, 259/259 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/735 variables, 2/261 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/735 variables, 0/261 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 1/736 variables, 1/262 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 0/262 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 1/737 variables, 1/263 constraints. Problems are: Problem set: 260 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 737/737 variables, and 263 constraints, problems are : Problem set: 260 solved, 273 unsolved in 30012 ms.
Refiners :[State Equation: 260/260 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 260 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 473/593 variables, 120/120 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 2/122 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 273/395 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 0/395 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 143/736 variables, 140/535 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 0/535 constraints. Problems are: Problem set: 260 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 1/737 variables, 1/536 constraints. Problems are: Problem set: 260 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 737/737 variables, and 536 constraints, problems are : Problem set: 260 solved, 273 unsolved in 30013 ms.
Refiners :[State Equation: 260/260 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 273/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60215ms problems are : Problem set: 260 solved, 273 unsolved
Search for dead transitions found 260 dead transitions in 60216ms
Found 260 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 260 transitions
Dead transitions reduction (with SMT) removed 260 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 260/1508 places, 274/1930 transitions.
Graph (complete) has 424 edges and 260 vertex of which 121 are kept as prefixes of interest. Removing 139 places using SCC suffix rule.0 ms
Discarding 139 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 121 /260 variables (removed 139) and now considering 274/274 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/1508 places, 274/1930 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60520 ms. Remains : 121/1508 places, 274/1930 transitions.
Built C files in :
/tmp/ltsmin16419928770301275122
[2025-05-30 08:49:35] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16419928770301275122
Running compilation step : cd /tmp/ltsmin16419928770301275122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin16419928770301275122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin16419928770301275122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Applied a total of 0 rules in 58 ms. Remains 1508 /1508 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2025-05-30 08:49:38] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:38] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-05-30 08:49:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:49:39] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 08:49:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Finished structural reductions in LTL mode , in 1 iterations and 61634 ms. Remains : 1508/1508 places, 1930/1930 transitions.
Built C files in :
/tmp/ltsmin10329331398942392054
[2025-05-30 08:50:39] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10329331398942392054
Running compilation step : cd /tmp/ltsmin10329331398942392054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin10329331398942392054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin10329331398942392054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 08:50:42] [INFO ] Flatten gal took : 31 ms
[2025-05-30 08:50:42] [INFO ] Flatten gal took : 29 ms
[2025-05-30 08:50:42] [INFO ] Time to serialize gal into /tmp/LTL12437451322373024137.gal : 13 ms
[2025-05-30 08:50:42] [INFO ] Time to serialize properties into /tmp/LTL7898298471287197136.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12437451322373024137.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8025039559235177577.hoa' '-atoms' '/tmp/LTL7898298471287197136.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7898298471287197136.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8025039559235177577.hoa
Detected timeout of ITS tools.
[2025-05-30 08:50:58] [INFO ] Flatten gal took : 28 ms
[2025-05-30 08:50:58] [INFO ] Flatten gal took : 27 ms
[2025-05-30 08:50:58] [INFO ] Time to serialize gal into /tmp/LTL13932100514304465968.gal : 6 ms
[2025-05-30 08:50:58] [INFO ] Time to serialize properties into /tmp/LTL11699748304595278798.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13932100514304465968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11699748304595278798.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("((p1433==0)||(p17==1))")||(X((X(G("((p1402==0)||(p1141==1))")))||(("((p1402==0)||(p1141==1))")&&(F("(p1191==1)"))))))))
Formula 0 simplified : F(!"((p1433==0)||(p17==1))" & X(XF!"((p1402==0)||(p1141==1))" & (!"((p1402==0)||(p1141==1))" | G!"(p1191==1)")))
Detected timeout of ITS tools.
[2025-05-30 08:51:13] [INFO ] Flatten gal took : 31 ms
[2025-05-30 08:51:13] [INFO ] Applying decomposition
[2025-05-30 08:51:13] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5992969799599872808.txt' '-o' '/tmp/graph5992969799599872808.bin' '-w' '/tmp/graph5992969799599872808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5992969799599872808.bin' '-l' '-1' '-v' '-w' '/tmp/graph5992969799599872808.weights' '-q' '0' '-e' '0.001'
[2025-05-30 08:51:13] [INFO ] Decomposing Gal with order
[2025-05-30 08:51:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:51:13] [INFO ] Removed a total of 499 redundant transitions.
[2025-05-30 08:51:13] [INFO ] Flatten gal took : 79 ms
[2025-05-30 08:51:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 35 ms.
[2025-05-30 08:51:13] [INFO ] Time to serialize gal into /tmp/LTL8780286959785090640.gal : 29 ms
[2025-05-30 08:51:13] [INFO ] Time to serialize properties into /tmp/LTL5302166440780542378.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8780286959785090640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5302166440780542378.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("((i20.u340.p1433==0)||(i3.i2.i5.u6.p17==1))")||(X((X(G("((i19.u331.p1402==0)||(i12.i2.i1.u263.p1141==1))")))||(("((i19.u331.p14...231
Formula 0 simplified : F(!"((i20.u340.p1433==0)||(i3.i2.i5.u6.p17==1))" & X(XF!"((i19.u331.p1402==0)||(i12.i2.i1.u263.p1141==1))" & (!"((i19.u331.p1402==0)...219
Reverse transition relation is NOT exact ! Due to transitions t26, t189, t218, t284, t285, t289, t301, t330, t381, t452, t504, t533, t696, t719, t748, t808...2363
Computing Next relation with stutter on 140576 deadlock states
41 unique states visited
41 strongly connected components in search stack
43 transitions explored
41 items max in DFS search stack
738 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,7.56406,248336,1,0,429664,10864,24007,896059,770,67227,1550881
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-313-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-313-LTLCardinality-11 finished in 312750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1559 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1559/1559 places, 1993/1993 transitions.
Graph (trivial) has 1900 edges and 1559 vertex of which 686 / 1559 are part of one of the 61 SCC in 2 ms
Free SCC test removed 625 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1439 edges and 934 vertex of which 925 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 509 transitions
Trivial Post-agglo rules discarded 509 transitions
Performed 509 trivial Post agglomeration. Transition count delta: 509
Iterating post reduction 0 with 509 rules applied. Total rules applied 511 place count 924 transition count 751
Reduce places removed 509 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 532 rules applied. Total rules applied 1043 place count 415 transition count 728
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1055 place count 404 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1056 place count 403 transition count 727
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1056 place count 403 transition count 682
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1146 place count 358 transition count 682
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1164 place count 340 transition count 654
Iterating global reduction 4 with 18 rules applied. Total rules applied 1182 place count 340 transition count 654
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1184 place count 340 transition count 652
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1186 place count 338 transition count 652
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1197 place count 327 transition count 637
Iterating global reduction 6 with 11 rules applied. Total rules applied 1208 place count 327 transition count 637
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1214 place count 327 transition count 631
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1215 place count 326 transition count 629
Iterating global reduction 7 with 1 rules applied. Total rules applied 1216 place count 326 transition count 629
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1217 place count 325 transition count 627
Iterating global reduction 7 with 1 rules applied. Total rules applied 1218 place count 325 transition count 627
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1219 place count 324 transition count 625
Iterating global reduction 7 with 1 rules applied. Total rules applied 1220 place count 324 transition count 625
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1221 place count 323 transition count 623
Iterating global reduction 7 with 1 rules applied. Total rules applied 1222 place count 323 transition count 623
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1223 place count 322 transition count 621
Iterating global reduction 7 with 1 rules applied. Total rules applied 1224 place count 322 transition count 621
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1225 place count 321 transition count 614
Iterating global reduction 7 with 1 rules applied. Total rules applied 1226 place count 321 transition count 614
Performed 158 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 7 with 316 rules applied. Total rules applied 1542 place count 163 transition count 360
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1552 place count 163 transition count 350
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1557 place count 158 transition count 343
Iterating global reduction 8 with 5 rules applied. Total rules applied 1562 place count 158 transition count 343
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1563 place count 157 transition count 341
Iterating global reduction 8 with 1 rules applied. Total rules applied 1564 place count 157 transition count 341
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1565 place count 156 transition count 339
Iterating global reduction 8 with 1 rules applied. Total rules applied 1566 place count 156 transition count 339
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1567 place count 155 transition count 337
Iterating global reduction 8 with 1 rules applied. Total rules applied 1568 place count 155 transition count 337
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1569 place count 154 transition count 330
Iterating global reduction 8 with 1 rules applied. Total rules applied 1570 place count 154 transition count 330
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 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 1594 place count 142 transition count 316
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1604 place count 142 transition count 306
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1640 place count 124 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1657 place count 124 transition count 324
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1666 place count 115 transition count 306
Iterating global reduction 10 with 9 rules applied. Total rules applied 1675 place count 115 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1681 place count 115 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 11 with 37 rules applied. Total rules applied 1718 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1719 place count 114 transition count 262
Applied a total of 1719 rules in 71 ms. Remains 114 /1559 variables (removed 1445) and now considering 262/1993 (removed 1731) transitions.
[2025-05-30 08:51:22] [INFO ] Flow matrix only has 207 transitions (discarded 55 similar events)
// Phase 1: matrix 207 rows 114 cols
[2025-05-30 08:51:22] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:22] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-30 08:51:22] [INFO ] Flow matrix only has 207 transitions (discarded 55 similar events)
[2025-05-30 08:51:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:51:22] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [8, 74]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 182 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1559 places, 262/1993 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 110 transition count 260
Applied a total of 4 rules in 4 ms. Remains 110 /112 variables (removed 2) and now considering 260/262 (removed 2) transitions.
[2025-05-30 08:51:22] [INFO ] Flow matrix only has 205 transitions (discarded 55 similar events)
// Phase 1: matrix 205 rows 110 cols
[2025-05-30 08:51:22] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:22] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-30 08:51:22] [INFO ] Flow matrix only has 205 transitions (discarded 55 similar events)
[2025-05-30 08:51:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:51:22] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1559 places, 260/1993 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 424 ms. Remains : 110/1559 places, 260/1993 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLCardinality-12
Stuttering criterion allowed to conclude after 1270 steps with 111 reset in 2 ms.
FORMULA CloudReconfiguration-PT-313-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLCardinality-12 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1559 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1559/1559 places, 1993/1993 transitions.
Graph (trivial) has 1900 edges and 1559 vertex of which 699 / 1559 are part of one of the 63 SCC in 1 ms
Free SCC test removed 636 places
Ensure Unique test removed 739 transitions
Reduce isomorphic transitions removed 739 transitions.
Graph (complete) has 1427 edges and 923 vertex of which 914 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 506 place count 913 transition count 744
Reduce places removed 504 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 529 rules applied. Total rules applied 1035 place count 409 transition count 719
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1047 place count 397 transition count 719
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1047 place count 397 transition count 675
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1135 place count 353 transition count 675
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1152 place count 336 transition count 649
Iterating global reduction 3 with 17 rules applied. Total rules applied 1169 place count 336 transition count 649
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1171 place count 336 transition count 647
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1173 place count 334 transition count 647
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1183 place count 324 transition count 634
Iterating global reduction 5 with 10 rules applied. Total rules applied 1193 place count 324 transition count 634
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1199 place count 324 transition count 628
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1200 place count 323 transition count 626
Iterating global reduction 6 with 1 rules applied. Total rules applied 1201 place count 323 transition count 626
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1202 place count 322 transition count 624
Iterating global reduction 6 with 1 rules applied. Total rules applied 1203 place count 322 transition count 624
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1204 place count 321 transition count 622
Iterating global reduction 6 with 1 rules applied. Total rules applied 1205 place count 321 transition count 622
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1206 place count 320 transition count 620
Iterating global reduction 6 with 1 rules applied. Total rules applied 1207 place count 320 transition count 620
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1208 place count 319 transition count 618
Iterating global reduction 6 with 1 rules applied. Total rules applied 1209 place count 319 transition count 618
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1210 place count 318 transition count 611
Iterating global reduction 6 with 1 rules applied. Total rules applied 1211 place count 318 transition count 611
Performed 156 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 6 with 312 rules applied. Total rules applied 1523 place count 162 transition count 359
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1531 place count 162 transition count 351
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1536 place count 157 transition count 344
Iterating global reduction 7 with 5 rules applied. Total rules applied 1541 place count 157 transition count 344
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1542 place count 156 transition count 342
Iterating global reduction 7 with 1 rules applied. Total rules applied 1543 place count 156 transition count 342
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1544 place count 155 transition count 340
Iterating global reduction 7 with 1 rules applied. Total rules applied 1545 place count 155 transition count 340
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1546 place count 154 transition count 338
Iterating global reduction 7 with 1 rules applied. Total rules applied 1547 place count 154 transition count 338
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1548 place count 153 transition count 331
Iterating global reduction 7 with 1 rules applied. Total rules applied 1549 place count 153 transition count 331
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1569 place count 143 transition count 319
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1577 place count 143 transition count 311
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 1611 place count 126 transition count 345
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 1628 place count 126 transition count 328
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1637 place count 117 transition count 310
Iterating global reduction 9 with 9 rules applied. Total rules applied 1646 place count 117 transition count 310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1652 place count 117 transition count 304
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 1688 place count 117 transition count 268
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1689 place count 117 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1690 place count 117 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1691 place count 116 transition count 266
Applied a total of 1691 rules in 69 ms. Remains 116 /1559 variables (removed 1443) and now considering 266/1993 (removed 1727) transitions.
[2025-05-30 08:51:23] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
// Phase 1: matrix 209 rows 116 cols
[2025-05-30 08:51:23] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:23] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-05-30 08:51:23] [INFO ] Flow matrix only has 209 transitions (discarded 57 similar events)
[2025-05-30 08:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:51:23] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [8, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 265 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1559 places, 266/1993 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 112 transition count 264
Applied a total of 4 rules in 4 ms. Remains 112 /114 variables (removed 2) and now considering 264/266 (removed 2) transitions.
[2025-05-30 08:51:23] [INFO ] Flow matrix only has 207 transitions (discarded 57 similar events)
// Phase 1: matrix 207 rows 112 cols
[2025-05-30 08:51:23] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:23] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-30 08:51:23] [INFO ] Flow matrix only has 207 transitions (discarded 57 similar events)
[2025-05-30 08:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:51:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:51:23] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1559 places, 264/1993 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 491 ms. Remains : 112/1559 places, 264/1993 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-313-LTLCardinality-15
Stuttering criterion allowed to conclude after 3116 steps with 282 reset in 9 ms.
FORMULA CloudReconfiguration-PT-313-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-313-LTLCardinality-15 finished in 576 ms.
All properties solved by simple procedures.
Total runtime 894655 ms.

BK_STOP 1748595083616

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-313"
export BK_EXAMINATION="LTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-313, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028200307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-313.tgz
mv CloudReconfiguration-PT-313 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;