fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r480-tall-171624188700156
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CloudReconfiguration-PT-306

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1227.359 468395.00 669077.00 1360.50 TFFFTTTFFFTFTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r480-tall-171624188700156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is CloudReconfiguration-PT-306, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188700156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 19:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 11 19:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 19:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 19:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-306-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717179744895

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-306
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:22:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:22:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:22:26] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-31 18:22:26] [INFO ] Transformed 2584 places.
[2024-05-31 18:22:26] [INFO ] Transformed 3094 transitions.
[2024-05-31 18:22:26] [INFO ] Found NUPN structural information;
[2024-05-31 18:22:26] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CloudReconfiguration-PT-306-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-306-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-306-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-306-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 519 places :
Symmetric choice reduction at 0 with 519 rule applications. Total rules 519 place count 2065 transition count 2575
Iterating global reduction 0 with 519 rules applied. Total rules applied 1038 place count 2065 transition count 2575
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1067 place count 2065 transition count 2546
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1306 place count 1826 transition count 2307
Iterating global reduction 1 with 239 rules applied. Total rules applied 1545 place count 1826 transition count 2307
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 1634 place count 1737 transition count 2218
Iterating global reduction 1 with 89 rules applied. Total rules applied 1723 place count 1737 transition count 2218
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1741 place count 1737 transition count 2200
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1788 place count 1690 transition count 2153
Iterating global reduction 2 with 47 rules applied. Total rules applied 1835 place count 1690 transition count 2153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1844 place count 1690 transition count 2144
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1879 place count 1655 transition count 2104
Iterating global reduction 3 with 35 rules applied. Total rules applied 1914 place count 1655 transition count 2104
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1940 place count 1629 transition count 2078
Iterating global reduction 3 with 26 rules applied. Total rules applied 1966 place count 1629 transition count 2078
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1990 place count 1605 transition count 2054
Iterating global reduction 3 with 24 rules applied. Total rules applied 2014 place count 1605 transition count 2054
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2038 place count 1581 transition count 2030
Iterating global reduction 3 with 24 rules applied. Total rules applied 2062 place count 1581 transition count 2030
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2083 place count 1560 transition count 1997
Iterating global reduction 3 with 21 rules applied. Total rules applied 2104 place count 1560 transition count 1997
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2112 place count 1552 transition count 1984
Iterating global reduction 3 with 8 rules applied. Total rules applied 2120 place count 1552 transition count 1984
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2128 place count 1544 transition count 1973
Iterating global reduction 3 with 8 rules applied. Total rules applied 2136 place count 1544 transition count 1973
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2138 place count 1544 transition count 1971
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2141 place count 1541 transition count 1968
Iterating global reduction 4 with 3 rules applied. Total rules applied 2144 place count 1541 transition count 1968
Applied a total of 2144 rules in 2163 ms. Remains 1541 /2584 variables (removed 1043) and now considering 1968/3094 (removed 1126) transitions.
// Phase 1: matrix 1968 rows 1541 cols
[2024-05-31 18:22:29] [INFO ] Computed 4 invariants in 34 ms
[2024-05-31 18:22:29] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-31 18:22:29] [INFO ] Invariant cache hit.
[2024-05-31 18:22:30] [INFO ] Implicit Places using invariants and state equation in 991 ms returned [1530]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1461 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1540/2584 places, 1968/3094 transitions.
Applied a total of 0 rules in 45 ms. Remains 1540 /1540 variables (removed 0) and now considering 1968/1968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3693 ms. Remains : 1540/2584 places, 1968/3094 transitions.
Support contains 28 out of 1540 places after structural reductions.
[2024-05-31 18:22:30] [INFO ] Flatten gal took : 137 ms
[2024-05-31 18:22:30] [INFO ] Flatten gal took : 70 ms
[2024-05-31 18:22:31] [INFO ] Input system was already deterministic with 1968 transitions.
RANDOM walk for 40000 steps (422 resets) in 1564 ms. (25 steps per ms) remains 21/27 properties
BEST_FIRST walk for 4002 steps (16 resets) in 106 ms. (37 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (14 resets) in 65 ms. (60 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 60 ms. (65 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (14 resets) in 30 ms. (129 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 52 ms. (75 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (17 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (16 resets) in 50 ms. (78 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
// Phase 1: matrix 1968 rows 1540 cols
[2024-05-31 18:22:31] [INFO ] Computed 3 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1497/1517 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1517 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1950/3467 variables, 1517/1520 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3467 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 7/3474 variables, 5/1525 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3474 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 6/3480 variables, 3/1528 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3480 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 6/3486 variables, 3/1531 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3486 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 6/3492 variables, 3/1534 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3492/3508 variables, and 1534 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1531/1540 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1497/1517 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1517 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1950/3467 variables, 1517/1520 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3467 variables, 20/1540 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3467 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 7/3474 variables, 5/1545 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3474 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 6/3480 variables, 3/1548 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3480 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 6/3486 variables, 3/1551 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3486/3508 variables, and 1551 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5019 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1528/1540 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 10106ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 1540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1836 edges and 1540 vertex of which 654 / 1540 are part of one of the 62 SCC in 10 ms
Free SCC test removed 592 places
Drop transitions (Empty/Sink Transition effects.) removed 745 transitions
Reduce isomorphic transitions removed 745 transitions.
Graph (complete) has 1392 edges and 948 vertex of which 940 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 502 rules applied. Total rules applied 504 place count 940 transition count 717
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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 553 rules applied. Total rules applied 1057 place count 444 transition count 660
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 39 rules applied. Total rules applied 1096 place count 407 transition count 658
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1099 place count 406 transition count 656
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1103 place count 405 transition count 653
Reduce places removed 2 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 5 with 14 rules applied. Total rules applied 1117 place count 403 transition count 641
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1130 place count 391 transition count 640
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 52 Pre rules applied. Total rules applied 1130 place count 391 transition count 588
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 1234 place count 339 transition count 588
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1243 place count 330 transition count 576
Iterating global reduction 7 with 9 rules applied. Total rules applied 1252 place count 330 transition count 576
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 1253 place count 330 transition count 575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1254 place count 329 transition count 575
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1260 place count 323 transition count 569
Iterating global reduction 9 with 6 rules applied. Total rules applied 1266 place count 323 transition count 569
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1272 place count 323 transition count 563
Performed 162 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 162 places in 0 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 10 with 324 rules applied. Total rules applied 1596 place count 161 transition count 306
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 10 with 19 rules applied. Total rules applied 1615 place count 161 transition count 287
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1618 place count 158 transition count 284
Iterating global reduction 11 with 3 rules applied. Total rules applied 1621 place count 158 transition count 284
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 11 with 18 rules applied. Total rules applied 1639 place count 149 transition count 275
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1651 place count 149 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1655 place count 147 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1660 place count 147 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1662 place count 146 transition count 255
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 13 with 68 rules applied. Total rules applied 1730 place count 112 transition count 287
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 13 with 29 rules applied. Total rules applied 1759 place count 112 transition count 258
Discarding 17 places :
Symmetric choice reduction at 14 with 17 rule applications. Total rules 1776 place count 95 transition count 224
Iterating global reduction 14 with 17 rules applied. Total rules applied 1793 place count 95 transition count 224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1799 place count 95 transition count 218
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1802 place count 92 transition count 212
Iterating global reduction 15 with 3 rules applied. Total rules applied 1805 place count 92 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1807 place count 92 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 16 with 8 rules applied. Total rules applied 1815 place count 92 transition count 202
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1816 place count 91 transition count 201
Iterating global reduction 16 with 1 rules applied. Total rules applied 1817 place count 91 transition count 201
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1818 place count 91 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1819 place count 90 transition count 200
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 1824 place count 90 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1825 place count 89 transition count 199
Applied a total of 1825 rules in 166 ms. Remains 89 /1540 variables (removed 1451) and now considering 199/1968 (removed 1769) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 89/1540 places, 199/1968 transitions.
RANDOM walk for 37040 steps (4503 resets) in 724 ms. (51 steps per ms) remains 0/20 properties
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2142 edges and 1540 vertex of which 1532 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.28 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1531 transition count 1959
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1531 transition count 1959
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 1523 transition count 1951
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 1523 transition count 1951
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 1519 transition count 1947
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 1519 transition count 1947
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 1515 transition count 1943
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1515 transition count 1943
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1511 transition count 1938
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1511 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 1508 transition count 1934
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 1508 transition count 1934
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 1505 transition count 1930
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 1505 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 1505 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1504 transition count 1927
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1504 transition count 1927
Applied a total of 73 rules in 455 ms. Remains 1504 /1540 variables (removed 36) and now considering 1927/1968 (removed 41) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2024-05-31 18:22:43] [INFO ] Computed 3 invariants in 16 ms
[2024-05-31 18:22:44] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-31 18:22:44] [INFO ] Invariant cache hit.
[2024-05-31 18:22:45] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2024-05-31 18:22:45] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30046 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 127)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 0)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 0)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints]
After SMT, in 60819ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60845ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1540 places, 1927/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62655 ms. Remains : 1504/1540 places, 1927/1968 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 406 ms.
Product exploration explored 100000 steps with 33333 reset in 389 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2100 edges and 1504 vertex of which 1496 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.12 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 23 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-306-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-306-LTLFireability-00 finished in 64282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p1))&&p0)))'
Support contains 4 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1872 edges and 1540 vertex of which 690 / 1540 are part of one of the 63 SCC in 6 ms
Free SCC test removed 627 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1409 edges and 913 vertex of which 905 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 904 transition count 739
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 524 rules applied. Total rules applied 1022 place count 408 transition count 711
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 1038 place count 394 transition count 709
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1040 place count 392 transition count 709
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1040 place count 392 transition count 662
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1134 place count 345 transition count 662
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1148 place count 331 transition count 640
Iterating global reduction 4 with 14 rules applied. Total rules applied 1162 place count 331 transition count 640
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1163 place count 331 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1164 place count 330 transition count 639
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1174 place count 320 transition count 625
Iterating global reduction 6 with 10 rules applied. Total rules applied 1184 place count 320 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1190 place count 320 transition count 619
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1192 place count 318 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 1194 place count 318 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1196 place count 316 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1198 place count 316 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1200 place count 314 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1202 place count 314 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1204 place count 312 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1206 place count 312 transition count 603
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1208 place count 310 transition count 599
Iterating global reduction 7 with 2 rules applied. Total rules applied 1210 place count 310 transition count 599
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1211 place count 309 transition count 592
Iterating global reduction 7 with 1 rules applied. Total rules applied 1212 place count 309 transition count 592
Performed 148 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 7 with 296 rules applied. Total rules applied 1508 place count 161 transition count 357
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1519 place count 161 transition count 346
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1524 place count 156 transition count 336
Iterating global reduction 8 with 5 rules applied. Total rules applied 1529 place count 156 transition count 336
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1553 place count 144 transition count 323
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1566 place count 144 transition count 310
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1600 place count 127 transition count 344
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1617 place count 127 transition count 327
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1626 place count 118 transition count 309
Iterating global reduction 10 with 9 rules applied. Total rules applied 1635 place count 118 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1641 place count 118 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 11 with 36 rules applied. Total rules applied 1677 place count 118 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1678 place count 117 transition count 266
Applied a total of 1678 rules in 194 ms. Remains 117 /1540 variables (removed 1423) and now considering 266/1968 (removed 1702) transitions.
[2024-05-31 18:23:47] [INFO ] Flow matrix only has 210 transitions (discarded 56 similar events)
// Phase 1: matrix 210 rows 117 cols
[2024-05-31 18:23:47] [INFO ] Computed 0 invariants in 4 ms
[2024-05-31 18:23:47] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-31 18:23:47] [INFO ] Flow matrix only has 210 transitions (discarded 56 similar events)
[2024-05-31 18:23:47] [INFO ] Invariant cache hit.
[2024-05-31 18:23:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:23:47] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [10, 45, 78]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 260 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1540 places, 266/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 111 transition count 263
Applied a total of 4 rules in 7 ms. Remains 111 /114 variables (removed 3) and now considering 263/266 (removed 3) transitions.
[2024-05-31 18:23:47] [INFO ] Flow matrix only has 207 transitions (discarded 56 similar events)
// Phase 1: matrix 207 rows 111 cols
[2024-05-31 18:23:47] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:23:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 18:23:47] [INFO ] Flow matrix only has 207 transitions (discarded 56 similar events)
[2024-05-31 18:23:47] [INFO ] Invariant cache hit.
[2024-05-31 18:23:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 18:23:47] [INFO ] Implicit Places using invariants and state equation in 94 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 : 111/1540 places, 263/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 629 ms. Remains : 111/1540 places, 263/1968 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-01 finished in 763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1||F(p2)))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1874 edges and 1540 vertex of which 691 / 1540 are part of one of the 63 SCC in 4 ms
Free SCC test removed 628 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1409 edges and 912 vertex of which 904 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 498 transitions
Trivial Post-agglo rules discarded 498 transitions
Performed 498 trivial Post agglomeration. Transition count delta: 498
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 903 transition count 737
Reduce places removed 498 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 524 rules applied. Total rules applied 1024 place count 405 transition count 711
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 1038 place count 392 transition count 710
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1040 place count 391 transition count 709
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1040 place count 391 transition count 662
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 1134 place count 344 transition count 662
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1148 place count 330 transition count 641
Iterating global reduction 4 with 14 rules applied. Total rules applied 1162 place count 330 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1165 place count 330 transition count 638
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1167 place count 328 transition count 638
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1177 place count 318 transition count 624
Iterating global reduction 6 with 10 rules applied. Total rules applied 1187 place count 318 transition count 624
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1193 place count 318 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1195 place count 316 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1197 place count 316 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1199 place count 314 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1201 place count 314 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1203 place count 312 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1205 place count 312 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1207 place count 310 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1209 place count 310 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1211 place count 308 transition count 598
Iterating global reduction 7 with 2 rules applied. Total rules applied 1213 place count 308 transition count 598
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1214 place count 307 transition count 591
Iterating global reduction 7 with 1 rules applied. Total rules applied 1215 place count 307 transition count 591
Performed 147 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 7 with 294 rules applied. Total rules applied 1509 place count 160 transition count 357
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 160 transition count 346
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1524 place count 156 transition count 341
Iterating global reduction 8 with 4 rules applied. Total rules applied 1528 place count 156 transition count 341
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1550 place count 145 transition count 329
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1562 place count 145 transition count 317
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
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 1598 place count 127 transition count 351
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 1616 place count 127 transition count 333
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1625 place count 118 transition count 315
Iterating global reduction 10 with 9 rules applied. Total rules applied 1634 place count 118 transition count 315
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1640 place count 118 transition count 309
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 1677 place count 118 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1678 place count 117 transition count 271
Applied a total of 1678 rules in 240 ms. Remains 117 /1540 variables (removed 1423) and now considering 271/1968 (removed 1697) transitions.
[2024-05-31 18:23:48] [INFO ] Flow matrix only has 214 transitions (discarded 57 similar events)
// Phase 1: matrix 214 rows 117 cols
[2024-05-31 18:23:48] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 18:23:48] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 18:23:48] [INFO ] Flow matrix only has 214 transitions (discarded 57 similar events)
[2024-05-31 18:23:48] [INFO ] Invariant cache hit.
[2024-05-31 18:23:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:23:48] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [11, 46, 79]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 235 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1540 places, 271/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 111 transition count 268
Applied a total of 4 rules in 7 ms. Remains 111 /114 variables (removed 3) and now considering 268/271 (removed 3) transitions.
[2024-05-31 18:23:48] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
// Phase 1: matrix 211 rows 111 cols
[2024-05-31 18:23:48] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:23:48] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 18:23:48] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
[2024-05-31 18:23:48] [INFO ] Invariant cache hit.
[2024-05-31 18:23:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:23:48] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1540 places, 268/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 622 ms. Remains : 111/1540 places, 268/1968 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-02
Product exploration explored 100000 steps with 13766 reset in 294 ms.
Product exploration explored 100000 steps with 13473 reset in 282 ms.
Computed a total of 1 stabilizing places and 15 stable transitions
Computed a total of 1 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 127 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (6712 resets) in 768 ms. (52 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40002 steps (17 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (237 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (234 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
[2024-05-31 18:23:50] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
[2024-05-31 18:23:50] [INFO ] Invariant cache hit.
[2024-05-31 18:23:50] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/44 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 140/184 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 133/317 variables, 76/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/321 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/321 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/322 variables, and 114 constraints, problems are : Problem set: 0 solved, 3 unsolved in 205 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/44 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 140/184 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 133/317 variables, 76/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/321 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/321 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/322 variables, and 117 constraints, problems are : Problem set: 0 solved, 3 unsolved in 194 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 22 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 268/268 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 111 transition count 203
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 104 transition count 203
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 118 place count 81 transition count 180
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 129 place count 81 transition count 169
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 138 place count 72 transition count 160
Iterating global reduction 3 with 9 rules applied. Total rules applied 147 place count 72 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 150 place count 72 transition count 157
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 170 place count 62 transition count 147
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 180 place count 62 transition count 137
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 188 place count 54 transition count 127
Iterating global reduction 5 with 8 rules applied. Total rules applied 196 place count 54 transition count 127
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 204 place count 54 transition count 119
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 216 place count 48 transition count 119
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 226 place count 48 transition count 109
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 231 place count 43 transition count 103
Iterating global reduction 7 with 5 rules applied. Total rules applied 236 place count 43 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 241 place count 43 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 252 place count 43 transition count 87
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 254 place count 41 transition count 81
Iterating global reduction 8 with 2 rules applied. Total rules applied 256 place count 41 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 258 place count 41 transition count 79
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 260 place count 39 transition count 77
Iterating global reduction 9 with 2 rules applied. Total rules applied 262 place count 39 transition count 77
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 266 place count 39 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 268 place count 38 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 270 place count 37 transition count 82
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 275 place count 37 transition count 77
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 281 place count 32 transition count 76
Applied a total of 281 rules in 22 ms. Remains 32 /111 variables (removed 79) and now considering 76/268 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 32/111 places, 76/268 transitions.
RANDOM walk for 20519 steps (238 resets) in 71 ms. (284 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 18 factoid took 419 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 268/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-05-31 18:23:51] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
[2024-05-31 18:23:51] [INFO ] Invariant cache hit.
[2024-05-31 18:23:51] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-31 18:23:51] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
[2024-05-31 18:23:51] [INFO ] Invariant cache hit.
[2024-05-31 18:23:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:23:51] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-31 18:23:51] [INFO ] Redundant transitions in 85 ms returned []
Running 261 sub problems to find dead transitions.
[2024-05-31 18:23:51] [INFO ] Flow matrix only has 211 transitions (discarded 57 similar events)
[2024-05-31 18:23:51] [INFO ] Invariant cache hit.
[2024-05-31 18:23:51] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Problem TDEAD258 is UNSAT
Problem TDEAD259 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 TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
At refinement iteration 1 (OVERLAPS) 210/320 variables, 110/110 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 3/113 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/113 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 1/321 variables, 1/114 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/114 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/114 constraints. Problems are: Problem set: 10 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/322 variables, and 114 constraints, problems are : Problem set: 10 solved, 251 unsolved in 6386 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 210/320 variables, 110/110 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 3/113 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 181/294 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/294 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 1/321 variables, 1/295 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 70/365 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/365 constraints. Problems are: Problem set: 10 solved, 251 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/365 constraints. Problems are: Problem set: 10 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/322 variables, and 365 constraints, problems are : Problem set: 10 solved, 251 unsolved in 8816 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 251/261 constraints, Known Traps: 0/0 constraints]
After SMT, in 15348ms problems are : Problem set: 10 solved, 251 unsolved
Search for dead transitions found 10 dead transitions in 15352ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 111/111 places, 258/268 transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 36 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 97 transition count 222
Applied a total of 14 rules in 9 ms. Remains 97 /111 variables (removed 14) and now considering 222/258 (removed 36) transitions.
[2024-05-31 18:24:07] [INFO ] Flow matrix only has 173 transitions (discarded 49 similar events)
// Phase 1: matrix 173 rows 97 cols
[2024-05-31 18:24:07] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:24:07] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 18:24:07] [INFO ] Flow matrix only has 173 transitions (discarded 49 similar events)
[2024-05-31 18:24:07] [INFO ] Invariant cache hit.
[2024-05-31 18:24:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:24:07] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/111 places, 222/268 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15830 ms. Remains : 97/111 places, 222/268 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 144 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (6771 resets) in 397 ms. (100 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40001 steps (23 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (137 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (201 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (22 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
[2024-05-31 18:24:07] [INFO ] Flow matrix only has 173 transitions (discarded 49 similar events)
[2024-05-31 18:24:07] [INFO ] Invariant cache hit.
[2024-05-31 18:24:07] [INFO ] State equation strengthened by 3 read => feed constraints.
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) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/38 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 106/144 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 121/265 variables, 69/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/269 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/269 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/270 variables, and 100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 129 ms.
Refiners :[State Equation: 97/97 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/38 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 106/144 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 121/265 variables, 69/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/269 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/269 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/270 variables, and 104 constraints, problems are : Problem set: 0 solved, 4 unsolved in 152 ms.
Refiners :[State Equation: 97/97 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 814 steps, including 60 resets, run visited all 4 properties in 13 ms. (steps per millisecond=62 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 17 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 18 factoid took 376 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 13672 reset in 137 ms.
Product exploration explored 100000 steps with 13707 reset in 176 ms.
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-31 18:24:09] [INFO ] Flow matrix only has 173 transitions (discarded 49 similar events)
[2024-05-31 18:24:09] [INFO ] Invariant cache hit.
[2024-05-31 18:24:09] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 18:24:09] [INFO ] Flow matrix only has 173 transitions (discarded 49 similar events)
[2024-05-31 18:24:09] [INFO ] Invariant cache hit.
[2024-05-31 18:24:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:24:09] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-31 18:24:09] [INFO ] Redundant transitions in 38 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-31 18:24:09] [INFO ] Flow matrix only has 173 transitions (discarded 49 similar events)
[2024-05-31 18:24:09] [INFO ] Invariant cache hit.
[2024-05-31 18:24:09] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 172/268 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 1/269 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/269 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/270 variables, and 100 constraints, problems are : Problem set: 0 solved, 215 unsolved in 4536 ms.
Refiners :[State Equation: 97/97 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 172/268 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 163/262 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 1/269 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 52/315 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/270 variables, and 315 constraints, problems are : Problem set: 0 solved, 215 unsolved in 5729 ms.
Refiners :[State Equation: 97/97 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 10354ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 10357ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10540 ms. Remains : 97/97 places, 222/222 transitions.
Treatment of property CloudReconfiguration-PT-306-LTLFireability-02 finished in 32369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F((F(p1)&&G(p2)))))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1874 edges and 1540 vertex of which 688 / 1540 are part of one of the 63 SCC in 2 ms
Free SCC test removed 625 places
Ensure Unique test removed 726 transitions
Reduce isomorphic transitions removed 726 transitions.
Graph (complete) has 1410 edges and 915 vertex of which 907 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 498 transitions
Trivial Post-agglo rules discarded 498 transitions
Performed 498 trivial Post agglomeration. Transition count delta: 498
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 906 transition count 738
Reduce places removed 498 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 524 rules applied. Total rules applied 1024 place count 408 transition count 712
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 1040 place count 395 transition count 709
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1043 place count 392 transition count 709
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1043 place count 392 transition count 661
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1139 place count 344 transition count 661
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1154 place count 329 transition count 638
Iterating global reduction 4 with 15 rules applied. Total rules applied 1169 place count 329 transition count 638
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1172 place count 329 transition count 635
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1174 place count 327 transition count 635
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1184 place count 317 transition count 621
Iterating global reduction 6 with 10 rules applied. Total rules applied 1194 place count 317 transition count 621
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1200 place count 317 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1202 place count 315 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1204 place count 315 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 313 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 313 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1210 place count 311 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1212 place count 311 transition count 603
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1214 place count 309 transition count 599
Iterating global reduction 7 with 2 rules applied. Total rules applied 1216 place count 309 transition count 599
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1218 place count 307 transition count 595
Iterating global reduction 7 with 2 rules applied. Total rules applied 1220 place count 307 transition count 595
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1221 place count 306 transition count 588
Iterating global reduction 7 with 1 rules applied. Total rules applied 1222 place count 306 transition count 588
Performed 146 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 7 with 292 rules applied. Total rules applied 1514 place count 160 transition count 355
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1524 place count 160 transition count 345
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1528 place count 156 transition count 340
Iterating global reduction 8 with 4 rules applied. Total rules applied 1532 place count 156 transition count 340
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1554 place count 145 transition count 328
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1566 place count 145 transition count 316
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
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 1602 place count 127 transition count 350
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1621 place count 127 transition count 331
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1630 place count 118 transition count 313
Iterating global reduction 10 with 9 rules applied. Total rules applied 1639 place count 118 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1645 place count 118 transition count 307
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 1682 place count 118 transition count 270
Applied a total of 1682 rules in 69 ms. Remains 118 /1540 variables (removed 1422) and now considering 270/1968 (removed 1698) transitions.
[2024-05-31 18:24:20] [INFO ] Flow matrix only has 214 transitions (discarded 56 similar events)
// Phase 1: matrix 214 rows 118 cols
[2024-05-31 18:24:20] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:24:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 18:24:20] [INFO ] Flow matrix only has 214 transitions (discarded 56 similar events)
[2024-05-31 18:24:20] [INFO ] Invariant cache hit.
[2024-05-31 18:24:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:24:20] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [13, 48, 81]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 185 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1540 places, 270/1968 transitions.
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 0 with 6 rules applied. Total rules applied 6 place count 112 transition count 267
Applied a total of 6 rules in 4 ms. Remains 112 /115 variables (removed 3) and now considering 267/270 (removed 3) transitions.
[2024-05-31 18:24:20] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
// Phase 1: matrix 211 rows 112 cols
[2024-05-31 18:24:20] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:24:20] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 18:24:20] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-31 18:24:20] [INFO ] Invariant cache hit.
[2024-05-31 18:24:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:24:20] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1540 places, 267/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 416 ms. Remains : 112/1540 places, 267/1968 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-03
Stuttering criterion allowed to conclude after 555 steps with 78 reset in 4 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-03 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G(p1)) U p2)))'
Support contains 4 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1532 transition count 1960
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1532 transition count 1960
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 1525 transition count 1953
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 1525 transition count 1953
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 1521 transition count 1949
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 1521 transition count 1949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 1517 transition count 1945
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 1517 transition count 1945
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1513 transition count 1940
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1513 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1510 transition count 1936
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1510 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 1507 transition count 1932
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 1507 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 1507 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1506 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1506 transition count 1929
Applied a total of 69 rules in 376 ms. Remains 1506 /1540 variables (removed 34) and now considering 1929/1968 (removed 39) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2024-05-31 18:24:21] [INFO ] Computed 3 invariants in 29 ms
[2024-05-31 18:24:21] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-31 18:24:21] [INFO ] Invariant cache hit.
[2024-05-31 18:24:22] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:24:22] [INFO ] Invariant cache hit.
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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 127.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 127)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60590ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60610ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1540 places, 1929/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62445 ms. Remains : 1506/1540 places, 1929/1968 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 468 ms.
Product exploration explored 100000 steps with 50000 reset in 428 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2102 edges and 1506 vertex of which 1498 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 14 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-306-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-306-LTLFireability-05 finished in 63551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1879 edges and 1540 vertex of which 695 / 1540 are part of one of the 63 SCC in 2 ms
Free SCC test removed 632 places
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 1402 edges and 908 vertex of which 900 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 497 transitions
Trivial Post-agglo rules discarded 497 transitions
Performed 497 trivial Post agglomeration. Transition count delta: 497
Iterating post reduction 0 with 497 rules applied. Total rules applied 499 place count 899 transition count 731
Reduce places removed 497 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 523 rules applied. Total rules applied 1022 place count 402 transition count 705
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 1036 place count 389 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1037 place count 388 transition count 704
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1037 place count 388 transition count 657
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1131 place count 341 transition count 657
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1146 place count 326 transition count 634
Iterating global reduction 4 with 15 rules applied. Total rules applied 1161 place count 326 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1164 place count 326 transition count 631
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1166 place count 324 transition count 631
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1176 place count 314 transition count 617
Iterating global reduction 6 with 10 rules applied. Total rules applied 1186 place count 314 transition count 617
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1192 place count 314 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1194 place count 312 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1196 place count 312 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1198 place count 310 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1200 place count 310 transition count 603
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1202 place count 308 transition count 599
Iterating global reduction 7 with 2 rules applied. Total rules applied 1204 place count 308 transition count 599
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 306 transition count 595
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 306 transition count 595
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1210 place count 304 transition count 591
Iterating global reduction 7 with 2 rules applied. Total rules applied 1212 place count 304 transition count 591
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1213 place count 303 transition count 584
Iterating global reduction 7 with 1 rules applied. Total rules applied 1214 place count 303 transition count 584
Performed 146 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 7 with 292 rules applied. Total rules applied 1506 place count 157 transition count 352
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1517 place count 157 transition count 341
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1522 place count 152 transition count 331
Iterating global reduction 8 with 5 rules applied. Total rules applied 1527 place count 152 transition count 331
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 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 1551 place count 140 transition count 318
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1564 place count 140 transition count 305
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1598 place count 123 transition count 339
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1615 place count 123 transition count 322
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1624 place count 114 transition count 304
Iterating global reduction 10 with 9 rules applied. Total rules applied 1633 place count 114 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1639 place count 114 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 11 with 36 rules applied. Total rules applied 1675 place count 114 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1676 place count 113 transition count 261
Applied a total of 1676 rules in 94 ms. Remains 113 /1540 variables (removed 1427) and now considering 261/1968 (removed 1707) transitions.
[2024-05-31 18:25:24] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 113 cols
[2024-05-31 18:25:24] [INFO ] Computed 0 invariants in 3 ms
[2024-05-31 18:25:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 18:25:24] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2024-05-31 18:25:24] [INFO ] Invariant cache hit.
[2024-05-31 18:25:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:25:24] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [8, 41, 74]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 167 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/1540 places, 261/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 258
Applied a total of 4 rules in 5 ms. Remains 107 /110 variables (removed 3) and now considering 258/261 (removed 3) transitions.
[2024-05-31 18:25:24] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
// Phase 1: matrix 201 rows 107 cols
[2024-05-31 18:25:24] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:25:24] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 18:25:24] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
[2024-05-31 18:25:24] [INFO ] Invariant cache hit.
[2024-05-31 18:25:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 18:25:24] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/1540 places, 258/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 107/1540 places, 258/1968 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-07 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1532 transition count 1960
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1532 transition count 1960
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 1525 transition count 1953
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 1525 transition count 1953
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 1521 transition count 1949
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 1521 transition count 1949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 1517 transition count 1945
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 1517 transition count 1945
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1513 transition count 1940
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1513 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1510 transition count 1936
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1510 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 1507 transition count 1932
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 1507 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 1507 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1506 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1506 transition count 1929
Applied a total of 69 rules in 379 ms. Remains 1506 /1540 variables (removed 34) and now considering 1929/1968 (removed 39) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2024-05-31 18:25:25] [INFO ] Computed 3 invariants in 17 ms
[2024-05-31 18:25:25] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-31 18:25:25] [INFO ] Invariant cache hit.
[2024-05-31 18:25:26] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:25:26] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
(s17 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60529ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60553ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1540 places, 1929/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62143 ms. Remains : 1506/1540 places, 1929/1968 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-08 finished in 62294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p0) U p1)||(X(p2)&&F(p0))))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1877 edges and 1540 vertex of which 678 / 1540 are part of one of the 63 SCC in 1 ms
Free SCC test removed 615 places
Ensure Unique test removed 711 transitions
Reduce isomorphic transitions removed 711 transitions.
Graph (complete) has 1425 edges and 925 vertex of which 917 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 916 transition count 746
Reduce places removed 505 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 533 rules applied. Total rules applied 1040 place count 411 transition count 718
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 1056 place count 397 transition count 716
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1059 place count 396 transition count 714
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1063 place count 395 transition count 711
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1066 place count 393 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1067 place count 392 transition count 710
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 48 Pre rules applied. Total rules applied 1067 place count 392 transition count 662
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 1163 place count 344 transition count 662
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1178 place count 329 transition count 639
Iterating global reduction 7 with 15 rules applied. Total rules applied 1193 place count 329 transition count 639
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 3 rules applied. Total rules applied 1196 place count 329 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1198 place count 327 transition count 636
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1208 place count 317 transition count 622
Iterating global reduction 9 with 10 rules applied. Total rules applied 1218 place count 317 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1224 place count 317 transition count 616
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1225 place count 316 transition count 614
Iterating global reduction 10 with 1 rules applied. Total rules applied 1226 place count 316 transition count 614
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1227 place count 315 transition count 612
Iterating global reduction 10 with 1 rules applied. Total rules applied 1228 place count 315 transition count 612
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1229 place count 314 transition count 610
Iterating global reduction 10 with 1 rules applied. Total rules applied 1230 place count 314 transition count 610
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1231 place count 313 transition count 608
Iterating global reduction 10 with 1 rules applied. Total rules applied 1232 place count 313 transition count 608
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1233 place count 312 transition count 606
Iterating global reduction 10 with 1 rules applied. Total rules applied 1234 place count 312 transition count 606
Performed 148 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 10 with 296 rules applied. Total rules applied 1530 place count 164 transition count 371
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1543 place count 164 transition count 358
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1548 place count 159 transition count 348
Iterating global reduction 11 with 5 rules applied. Total rules applied 1553 place count 159 transition count 348
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1577 place count 147 transition count 335
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1589 place count 147 transition count 323
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1590 place count 146 transition count 321
Iterating global reduction 12 with 1 rules applied. Total rules applied 1591 place count 146 transition count 321
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 38 rules applied. Total rules applied 1629 place count 127 transition count 363
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 12 with 27 rules applied. Total rules applied 1656 place count 127 transition count 336
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1665 place count 118 transition count 318
Iterating global reduction 13 with 9 rules applied. Total rules applied 1674 place count 118 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1680 place count 118 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 14 with 40 rules applied. Total rules applied 1720 place count 118 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1721 place count 117 transition count 271
Applied a total of 1721 rules in 92 ms. Remains 117 /1540 variables (removed 1423) and now considering 271/1968 (removed 1697) transitions.
[2024-05-31 18:26:27] [INFO ] Flow matrix only has 213 transitions (discarded 58 similar events)
// Phase 1: matrix 213 rows 117 cols
[2024-05-31 18:26:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:26:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 18:26:27] [INFO ] Flow matrix only has 213 transitions (discarded 58 similar events)
[2024-05-31 18:26:27] [INFO ] Invariant cache hit.
[2024-05-31 18:26:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:26:27] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [12, 47, 80]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 197 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1540 places, 271/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 111 transition count 268
Applied a total of 4 rules in 5 ms. Remains 111 /114 variables (removed 3) and now considering 268/271 (removed 3) transitions.
[2024-05-31 18:26:27] [INFO ] Flow matrix only has 210 transitions (discarded 58 similar events)
// Phase 1: matrix 210 rows 111 cols
[2024-05-31 18:26:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:26:27] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 18:26:27] [INFO ] Flow matrix only has 210 transitions (discarded 58 similar events)
[2024-05-31 18:26:27] [INFO ] Invariant cache hit.
[2024-05-31 18:26:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:26:27] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1540 places, 268/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 449 ms. Remains : 111/1540 places, 268/1968 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-09 finished in 667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1||G(p2))))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1532 transition count 1960
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1532 transition count 1960
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 1525 transition count 1953
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 1525 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 1522 transition count 1950
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 1522 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 1519 transition count 1947
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 1519 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 1516 transition count 1944
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 1516 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1514 transition count 1942
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1514 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1512 transition count 1939
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1512 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1511 transition count 1937
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1511 transition count 1937
Applied a total of 58 rules in 369 ms. Remains 1511 /1540 variables (removed 29) and now considering 1937/1968 (removed 31) transitions.
// Phase 1: matrix 1937 rows 1511 cols
[2024-05-31 18:26:28] [INFO ] Computed 3 invariants in 18 ms
[2024-05-31 18:26:28] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-31 18:26:28] [INFO ] Invariant cache hit.
[2024-05-31 18:26:29] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2024-05-31 18:26:29] [INFO ] Invariant cache hit.
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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3448 variables, and 3 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1936/1936 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3448 variables, and 3 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints]
After SMT, in 60560ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60577ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1540 places, 1937/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62146 ms. Remains : 1511/1540 places, 1937/1968 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 414 ms.
Product exploration explored 100000 steps with 50000 reset in 412 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2110 edges and 1511 vertex of which 1503 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-306-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-306-LTLFireability-10 finished in 63211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G(p1)))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1876 edges and 1540 vertex of which 692 / 1540 are part of one of the 63 SCC in 0 ms
Free SCC test removed 629 places
Ensure Unique test removed 729 transitions
Reduce isomorphic transitions removed 729 transitions.
Graph (complete) has 1407 edges and 911 vertex of which 903 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 902 transition count 734
Reduce places removed 499 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 523 rules applied. Total rules applied 1024 place count 403 transition count 710
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 1037 place count 391 transition count 709
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1039 place count 390 transition count 708
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1039 place count 390 transition count 661
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1133 place count 343 transition count 661
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1147 place count 329 transition count 640
Iterating global reduction 4 with 14 rules applied. Total rules applied 1161 place count 329 transition count 640
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1164 place count 329 transition count 637
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1166 place count 327 transition count 637
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1175 place count 318 transition count 625
Iterating global reduction 6 with 9 rules applied. Total rules applied 1184 place count 318 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1190 place count 318 transition count 619
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1191 place count 317 transition count 617
Iterating global reduction 7 with 1 rules applied. Total rules applied 1192 place count 317 transition count 617
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1193 place count 316 transition count 615
Iterating global reduction 7 with 1 rules applied. Total rules applied 1194 place count 316 transition count 615
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1195 place count 315 transition count 613
Iterating global reduction 7 with 1 rules applied. Total rules applied 1196 place count 315 transition count 613
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1197 place count 314 transition count 611
Iterating global reduction 7 with 1 rules applied. Total rules applied 1198 place count 314 transition count 611
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1199 place count 313 transition count 609
Iterating global reduction 7 with 1 rules applied. Total rules applied 1200 place count 313 transition count 609
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1201 place count 312 transition count 602
Iterating global reduction 7 with 1 rules applied. Total rules applied 1202 place count 312 transition count 602
Performed 149 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 7 with 298 rules applied. Total rules applied 1500 place count 163 transition count 366
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1511 place count 163 transition count 355
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1515 place count 159 transition count 350
Iterating global reduction 8 with 4 rules applied. Total rules applied 1519 place count 159 transition count 350
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1541 place count 148 transition count 338
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1553 place count 148 transition count 326
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1554 place count 147 transition count 324
Iterating global reduction 9 with 1 rules applied. Total rules applied 1555 place count 147 transition count 324
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1593 place count 128 transition count 361
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1615 place count 128 transition count 339
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1624 place count 119 transition count 321
Iterating global reduction 10 with 9 rules applied. Total rules applied 1633 place count 119 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1639 place count 119 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 11 with 41 rules applied. Total rules applied 1680 place count 119 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1681 place count 118 transition count 273
Applied a total of 1681 rules in 59 ms. Remains 118 /1540 variables (removed 1422) and now considering 273/1968 (removed 1695) transitions.
[2024-05-31 18:27:31] [INFO ] Flow matrix only has 214 transitions (discarded 59 similar events)
// Phase 1: matrix 214 rows 118 cols
[2024-05-31 18:27:31] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 18:27:31] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 18:27:31] [INFO ] Flow matrix only has 214 transitions (discarded 59 similar events)
[2024-05-31 18:27:31] [INFO ] Invariant cache hit.
[2024-05-31 18:27:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:27:31] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [13, 46, 81]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 191 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1540 places, 273/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 112 transition count 270
Applied a total of 4 rules in 4 ms. Remains 112 /115 variables (removed 3) and now considering 270/273 (removed 3) transitions.
[2024-05-31 18:27:31] [INFO ] Flow matrix only has 211 transitions (discarded 59 similar events)
// Phase 1: matrix 211 rows 112 cols
[2024-05-31 18:27:31] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:27:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 18:27:31] [INFO ] Flow matrix only has 211 transitions (discarded 59 similar events)
[2024-05-31 18:27:31] [INFO ] Invariant cache hit.
[2024-05-31 18:27:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:27:31] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1540 places, 270/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 402 ms. Remains : 112/1540 places, 270/1968 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4708 steps with 702 reset in 13 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-11 finished in 564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1531 transition count 1959
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1531 transition count 1959
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 1523 transition count 1951
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 1523 transition count 1951
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 1519 transition count 1947
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 1519 transition count 1947
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 1515 transition count 1943
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1515 transition count 1943
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1511 transition count 1938
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1511 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 1508 transition count 1934
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 1508 transition count 1934
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 1505 transition count 1930
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 1505 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 1505 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1504 transition count 1927
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1504 transition count 1927
Applied a total of 73 rules in 385 ms. Remains 1504 /1540 variables (removed 36) and now considering 1927/1968 (removed 41) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2024-05-31 18:27:31] [INFO ] Computed 3 invariants in 16 ms
[2024-05-31 18:27:32] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-31 18:27:32] [INFO ] Invariant cache hit.
[2024-05-31 18:27:33] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2024-05-31 18:27:33] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30051 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1540 places, 1927/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62254 ms. Remains : 1504/1540 places, 1927/1968 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-13
Stuttering criterion allowed to conclude after 161 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-306-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-306-LTLFireability-13 finished in 62383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((p1 U (p2 U p3))))))'
Support contains 4 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1532 transition count 1960
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1532 transition count 1960
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 1525 transition count 1953
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 1525 transition count 1953
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 1521 transition count 1949
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 1521 transition count 1949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 1517 transition count 1945
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 1517 transition count 1945
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1513 transition count 1940
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1513 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1510 transition count 1936
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1510 transition count 1936
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 1507 transition count 1932
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 1507 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 1507 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1506 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1506 transition count 1929
Applied a total of 69 rules in 375 ms. Remains 1506 /1540 variables (removed 34) and now considering 1929/1968 (removed 39) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2024-05-31 18:28:34] [INFO ] Computed 3 invariants in 14 ms
[2024-05-31 18:28:34] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-31 18:28:34] [INFO ] Invariant cache hit.
[2024-05-31 18:28:35] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:28:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3435 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60563ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60579ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1540 places, 1929/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62262 ms. Remains : 1506/1540 places, 1929/1968 transitions.
Stuttering acceptance computed with spot in 324 ms :[true, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : CloudReconfiguration-PT-306-LTLFireability-15
Product exploration explored 100000 steps with 1085 reset in 235 ms.
Product exploration explored 100000 steps with 1068 reset in 244 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2102 edges and 1506 vertex of which 1498 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 106 ms. Reduced automaton from 8 states, 21 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (437 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (158 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 471895 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 1
Probabilistic random walk after 471895 steps, saw 108266 distinct states, run finished after 3005 ms. (steps per millisecond=157 ) properties seen :0
[2024-05-31 18:29:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1482/1483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1483 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1911/3394 variables, 1483/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3394 variables, 0/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/3401 variables, 5/1491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3401 variables, 0/1491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/3407 variables, 3/1494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3407 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3413 variables, 3/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3413 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3419 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/3422 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3424 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3424 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3426 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3435/3435 variables, and 1509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1360 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1482/1483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1483 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1911/3394 variables, 1483/1486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3394 variables, 1/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3394 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/3401 variables, 5/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3401 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/3407 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3407 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3413 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3413 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3419 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/3422 variables, 2/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3435/3435 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1375 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2769ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 1929/1929 transitions.
Graph (trivial) has 1841 edges and 1506 vertex of which 688 / 1506 are part of one of the 63 SCC in 0 ms
Free SCC test removed 625 places
Drop transitions (Empty/Sink Transition effects.) removed 790 transitions
Reduce isomorphic transitions removed 790 transitions.
Graph (complete) has 1307 edges and 881 vertex of which 873 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 873 transition count 636
Reduce places removed 492 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 552 rules applied. Total rules applied 1053 place count 381 transition count 576
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1093 place count 342 transition count 575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1094 place count 341 transition count 575
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1094 place count 341 transition count 525
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 1194 place count 291 transition count 525
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1205 place count 280 transition count 509
Iterating global reduction 4 with 11 rules applied. Total rules applied 1216 place count 280 transition count 509
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1219 place count 280 transition count 506
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1222 place count 277 transition count 506
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1230 place count 269 transition count 496
Iterating global reduction 6 with 8 rules applied. Total rules applied 1238 place count 269 transition count 496
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1244 place count 269 transition count 490
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1246 place count 267 transition count 478
Iterating global reduction 7 with 2 rules applied. Total rules applied 1248 place count 267 transition count 478
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 1249 place count 267 transition count 477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1250 place count 266 transition count 477
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 1534 place count 124 transition count 238
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 1547 place count 124 transition count 225
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 1549 place count 123 transition count 224
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1552 place count 120 transition count 221
Iterating global reduction 11 with 3 rules applied. Total rules applied 1555 place count 120 transition count 221
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 1581 place count 107 transition count 205
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 1596 place count 107 transition count 190
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 1662 place count 74 transition count 221
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 12 with 56 rules applied. Total rules applied 1718 place count 74 transition count 165
Discarding 24 places :
Symmetric choice reduction at 13 with 24 rule applications. Total rules 1742 place count 50 transition count 140
Iterating global reduction 13 with 24 rules applied. Total rules applied 1766 place count 50 transition count 140
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 13 with 15 rules applied. Total rules applied 1781 place count 50 transition count 125
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 1786 place count 45 transition count 115
Iterating global reduction 14 with 5 rules applied. Total rules applied 1791 place count 45 transition count 115
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1796 place count 45 transition count 110
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 1826 place count 45 transition count 80
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1829 place count 42 transition count 71
Iterating global reduction 15 with 3 rules applied. Total rules applied 1832 place count 42 transition count 71
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1835 place count 39 transition count 68
Iterating global reduction 15 with 3 rules applied. Total rules applied 1838 place count 39 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1841 place count 39 transition count 65
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 1844 place count 39 transition count 62
Free-agglomeration rule applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 1847 place count 39 transition count 59
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1850 place count 36 transition count 59
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 1851 place count 36 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1852 place count 35 transition count 58
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1450.t1451.t1452.t1453.t1454.t1455.t1456.t1457.t1458.t1893.t1689.t1690.t1691.t1692.t1693.t1767.t1768.t1769.t1770.t1772.t1821 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 34 edges and 33 vertex of which 23 / 33 are part of one of the 8 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 17 with 4 rules applied. Total rules applied 1856 place count 18 transition count 55
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 18 with 33 rules applied. Total rules applied 1889 place count 17 transition count 23
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 1891 place count 15 transition count 21
Iterating global reduction 19 with 2 rules applied. Total rules applied 1893 place count 15 transition count 21
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 1899 place count 12 transition count 18
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 1904 place count 12 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 1905 place count 12 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 1906 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1907 place count 11 transition count 11
Applied a total of 1907 rules in 65 ms. Remains 11 /1506 variables (removed 1495) and now considering 11/1929 (removed 1918) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 11/1506 places, 11/1929 transitions.
RANDOM walk for 86 steps (17 resets) in 4 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 15 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-306-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-306-LTLFireability-15 finished in 69481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1||F(p2)))))'
[2024-05-31 18:29:43] [INFO ] Flatten gal took : 94 ms
[2024-05-31 18:29:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-31 18:29:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1540 places, 1968 transitions and 4105 arcs took 17 ms.
Total runtime 437550 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CloudReconfiguration-PT-306-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717180213290

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CloudReconfiguration-PT-306-LTLFireability-02
ltl formula formula --ltl=/tmp/1229/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1540 places, 1968 transitions and 4105 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.040 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1229/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1229/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1229/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1229/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 1541 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1541, there are 1998 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~493 levels ~10000 states ~25748 transitions
pnml2lts-mc( 3/ 4): ~611 levels ~20000 states ~50052 transitions
pnml2lts-mc( 3/ 4): ~637 levels ~40000 states ~98516 transitions
pnml2lts-mc( 3/ 4): ~637 levels ~80000 states ~195684 transitions
pnml2lts-mc( 3/ 4): ~637 levels ~160000 states ~464336 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~1651!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20368
pnml2lts-mc( 0/ 4): unique states count: 296905
pnml2lts-mc( 0/ 4): unique transitions count: 914279
pnml2lts-mc( 0/ 4): - self-loop count: 414
pnml2lts-mc( 0/ 4): - claim dead count: 219983
pnml2lts-mc( 0/ 4): - claim found count: 388527
pnml2lts-mc( 0/ 4): - claim success count: 297352
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12060
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 297836 states 917370 transitions, fanout: 3.080
pnml2lts-mc( 0/ 4): Total exploration time 27.580 sec (27.560 sec minimum, 27.570 sec on average)
pnml2lts-mc( 0/ 4): States per second: 10799, Transitions per second: 33262
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.5MB, 8.7 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1999 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.5MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-306"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CloudReconfiguration-PT-306, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624188700156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-306.tgz
mv CloudReconfiguration-PT-306 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;