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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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 3.7K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 19:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 11 19:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 19:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 19:39 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-305-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-305-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717179525884

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-305
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:18:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:18:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:18:47] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-05-31 18:18:47] [INFO ] Transformed 2585 places.
[2024-05-31 18:18:47] [INFO ] Transformed 3095 transitions.
[2024-05-31 18:18:47] [INFO ] Found NUPN structural information;
[2024-05-31 18:18:47] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-305-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-305-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 519 places :
Symmetric choice reduction at 0 with 519 rule applications. Total rules 519 place count 2066 transition count 2576
Iterating global reduction 0 with 519 rules applied. Total rules applied 1038 place count 2066 transition count 2576
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 2066 transition count 2547
Discarding 238 places :
Symmetric choice reduction at 1 with 238 rule applications. Total rules 1305 place count 1828 transition count 2309
Iterating global reduction 1 with 238 rules applied. Total rules applied 1543 place count 1828 transition count 2309
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 1633 place count 1738 transition count 2219
Iterating global reduction 1 with 90 rules applied. Total rules applied 1723 place count 1738 transition count 2219
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1740 place count 1738 transition count 2202
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1789 place count 1689 transition count 2153
Iterating global reduction 2 with 49 rules applied. Total rules applied 1838 place count 1689 transition count 2153
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1846 place count 1689 transition count 2145
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1885 place count 1650 transition count 2101
Iterating global reduction 3 with 39 rules applied. Total rules applied 1924 place count 1650 transition count 2101
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1952 place count 1622 transition count 2073
Iterating global reduction 3 with 28 rules applied. Total rules applied 1980 place count 1622 transition count 2073
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2006 place count 1596 transition count 2047
Iterating global reduction 3 with 26 rules applied. Total rules applied 2032 place count 1596 transition count 2047
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2057 place count 1571 transition count 2022
Iterating global reduction 3 with 25 rules applied. Total rules applied 2082 place count 1571 transition count 2022
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 2104 place count 1549 transition count 1986
Iterating global reduction 3 with 22 rules applied. Total rules applied 2126 place count 1549 transition count 1986
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2134 place count 1541 transition count 1973
Iterating global reduction 3 with 8 rules applied. Total rules applied 2142 place count 1541 transition count 1973
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2150 place count 1533 transition count 1963
Iterating global reduction 3 with 8 rules applied. Total rules applied 2158 place count 1533 transition count 1963
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2161 place count 1533 transition count 1960
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2163 place count 1531 transition count 1958
Iterating global reduction 4 with 2 rules applied. Total rules applied 2165 place count 1531 transition count 1958
Applied a total of 2165 rules in 2279 ms. Remains 1531 /2585 variables (removed 1054) and now considering 1958/3095 (removed 1137) transitions.
// Phase 1: matrix 1958 rows 1531 cols
[2024-05-31 18:18:50] [INFO ] Computed 4 invariants in 42 ms
[2024-05-31 18:18:50] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-31 18:18:50] [INFO ] Invariant cache hit.
[2024-05-31 18:18:51] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1994 ms to find 0 implicit places.
Running 1957 sub problems to find dead transitions.
[2024-05-31 18:18:52] [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/1530 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1957 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1530/3489 variables, and 4 constraints, problems are : Problem set: 0 solved, 1957 unsolved in 30097 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1531 constraints, PredecessorRefiner: 1957/1957 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1957 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1530 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1957 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1530/3489 variables, and 4 constraints, problems are : Problem set: 0 solved, 1957 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1531 constraints, PredecessorRefiner: 0/1957 constraints, Known Traps: 0/0 constraints]
After SMT, in 60919ms problems are : Problem set: 0 solved, 1957 unsolved
Search for dead transitions found 0 dead transitions in 61004ms
Starting structural reductions in LTL mode, iteration 1 : 1531/2585 places, 1958/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65313 ms. Remains : 1531/2585 places, 1958/3095 transitions.
Support contains 31 out of 1531 places after structural reductions.
[2024-05-31 18:19:53] [INFO ] Flatten gal took : 126 ms
[2024-05-31 18:19:53] [INFO ] Flatten gal took : 70 ms
[2024-05-31 18:19:53] [INFO ] Input system was already deterministic with 1958 transitions.
RANDOM walk for 40000 steps (310 resets) in 1836 ms. (21 steps per ms) remains 17/30 properties
BEST_FIRST walk for 4002 steps (11 resets) in 84 ms. (47 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 84 ms. (47 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (11 resets) in 89 ms. (44 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (11 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (10 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (11 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (9 resets) in 22 ms. (173 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (10 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 45 ms. (87 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
[2024-05-31 18:19:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1501/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1520 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1948/3468 variables, 1520/1524 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3468 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/3470 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3470 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 2/3472 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3472 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 2/3474 variables, 1/1527 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3474 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 2/3476 variables, 1/1528 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3476 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 2/3478 variables, 1/1529 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3478/3489 variables, and 1529 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1525/1531 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1501/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1520 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1948/3468 variables, 1520/1524 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3468 variables, 17/1541 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3468 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/3470 variables, 1/1542 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3470 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 2/3472 variables, 1/1543 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3472 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 2/3474 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3474 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 2/3476 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3476/3489 variables, and 1545 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1524/1531 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 10061ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 1531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Graph (trivial) has 1826 edges and 1531 vertex of which 654 / 1531 are part of one of the 61 SCC in 8 ms
Free SCC test removed 593 places
Drop transitions (Empty/Sink Transition effects.) removed 750 transitions
Reduce isomorphic transitions removed 750 transitions.
Graph (complete) has 1381 edges and 938 vertex of which 929 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 929 transition count 705
Reduce places removed 493 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 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 554 rules applied. Total rules applied 1055 place count 436 transition count 644
Reduce places removed 39 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 49 rules applied. Total rules applied 1104 place count 397 transition count 634
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1114 place count 387 transition count 634
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 1114 place count 387 transition count 583
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1216 place count 336 transition count 583
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1223 place count 329 transition count 574
Iterating global reduction 4 with 7 rules applied. Total rules applied 1230 place count 329 transition count 574
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1232 place count 329 transition count 572
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1234 place count 327 transition count 572
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1239 place count 322 transition count 567
Iterating global reduction 6 with 5 rules applied. Total rules applied 1244 place count 322 transition count 567
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1249 place count 322 transition count 562
Performed 159 Post agglomeration using F-continuation condition with reduction of 101 identical transitions.
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 7 with 318 rules applied. Total rules applied 1567 place count 163 transition count 302
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1589 place count 163 transition count 280
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1592 place count 160 transition count 277
Iterating global reduction 8 with 3 rules applied. Total rules applied 1595 place count 160 transition count 277
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 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 1617 place count 149 transition count 264
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1629 place count 149 transition count 252
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1631 place count 148 transition count 251
Performed 35 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 9 with 70 rules applied. Total rules applied 1701 place count 113 transition count 288
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 1726 place count 113 transition count 263
Discarding 16 places :
Symmetric choice reduction at 10 with 16 rule applications. Total rules 1742 place count 97 transition count 231
Iterating global reduction 10 with 16 rules applied. Total rules applied 1758 place count 97 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1764 place count 97 transition count 225
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1765 place count 96 transition count 223
Iterating global reduction 11 with 1 rules applied. Total rules applied 1766 place count 96 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1769 place count 96 transition count 220
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1770 place count 95 transition count 219
Iterating global reduction 11 with 1 rules applied. Total rules applied 1771 place count 95 transition count 219
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 11 with 2 rules applied. Total rules applied 1773 place count 94 transition count 218
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 1777 place count 94 transition count 218
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1778 place count 93 transition count 217
Applied a total of 1778 rules in 163 ms. Remains 93 /1531 variables (removed 1438) and now considering 217/1958 (removed 1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 93/1531 places, 217/1958 transitions.
RANDOM walk for 40000 steps (4359 resets) in 772 ms. (51 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40004 steps (885 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (883 resets) in 88 ms. (449 steps per ms) remains 1/2 properties
[2024-05-31 18:20:05] [INFO ] Flow matrix only has 205 transitions (discarded 12 similar events)
// Phase 1: matrix 205 rows 93 cols
[2024-05-31 18:20:05] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 18:20:05] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 31/298 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/93 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 33ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2135 edges and 1531 vertex of which 1522 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.25 ms
FORMULA CloudReconfiguration-PT-305-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)))'
Support contains 1 out of 1531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Graph (trivial) has 1868 edges and 1531 vertex of which 687 / 1531 are part of one of the 63 SCC in 3 ms
Free SCC test removed 624 places
Ensure Unique test removed 725 transitions
Reduce isomorphic transitions removed 725 transitions.
Graph (complete) has 1405 edges and 907 vertex of which 898 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 897 transition count 735
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 517 rules applied. Total rules applied 1011 place count 405 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 1024 place count 393 transition count 709
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1025 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 1025 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 1119 place count 345 transition count 662
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1133 place count 331 transition count 639
Iterating global reduction 4 with 14 rules applied. Total rules applied 1147 place count 331 transition count 639
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1149 place count 331 transition count 637
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1151 place count 329 transition count 637
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1160 place count 320 transition count 624
Iterating global reduction 6 with 9 rules applied. Total rules applied 1169 place count 320 transition count 624
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1174 place count 320 transition count 619
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1176 place count 318 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 1178 place count 318 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1180 place count 316 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1182 place count 316 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1184 place count 314 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1186 place count 314 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1188 place count 312 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1190 place count 312 transition count 603
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1192 place count 310 transition count 599
Iterating global reduction 7 with 2 rules applied. Total rules applied 1194 place count 310 transition count 599
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1196 place count 308 transition count 585
Iterating global reduction 7 with 2 rules applied. Total rules applied 1198 place count 308 transition count 585
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1199 place count 308 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1200 place count 307 transition count 584
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 9 with 298 rules applied. Total rules applied 1498 place count 158 transition count 348
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 11 rules applied. Total rules applied 1509 place count 158 transition count 337
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 1511 place count 157 transition count 336
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1516 place count 152 transition count 330
Iterating global reduction 11 with 5 rules applied. Total rules applied 1521 place count 152 transition count 330
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1522 place count 151 transition count 329
Iterating global reduction 11 with 1 rules applied. Total rules applied 1523 place count 151 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1524 place count 151 transition count 328
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1544 place count 141 transition count 316
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1553 place count 141 transition count 307
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 13 with 34 rules applied. Total rules applied 1587 place count 124 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 1604 place count 124 transition count 324
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1613 place count 115 transition count 306
Iterating global reduction 14 with 9 rules applied. Total rules applied 1622 place count 115 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1628 place count 115 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 15 with 37 rules applied. Total rules applied 1665 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1666 place count 114 transition count 262
Applied a total of 1666 rules in 161 ms. Remains 114 /1531 variables (removed 1417) and now considering 262/1958 (removed 1696) transitions.
[2024-05-31 18:20:05] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 114 cols
[2024-05-31 18:20:05] [INFO ] Computed 0 invariants in 6 ms
[2024-05-31 18:20:05] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 18:20:05] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2024-05-31 18:20:05] [INFO ] Invariant cache hit.
[2024-05-31 18:20:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:20:05] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [8, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 215 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1531 places, 262/1958 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 260
Applied a total of 2 rules in 8 ms. Remains 110 /112 variables (removed 2) and now considering 260/262 (removed 2) transitions.
[2024-05-31 18:20:05] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 110 cols
[2024-05-31 18:20:05] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:20:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 18:20:05] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-31 18:20:05] [INFO ] Invariant cache hit.
[2024-05-31 18:20:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 18:20:06] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1531 places, 260/1958 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 539 ms. Remains : 110/1531 places, 260/1958 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-00 finished in 793 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)))||G(p1)))'
Support contains 2 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1521 transition count 1948
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1521 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1521 transition count 1947
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 1514 transition count 1940
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 1514 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 1511 transition count 1936
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 1511 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 1509 transition count 1932
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 1509 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 1507 transition count 1929
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 1507 transition count 1929
Applied a total of 50 rules in 302 ms. Remains 1507 /1531 variables (removed 24) and now considering 1929/1958 (removed 29) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-31 18:20:06] [INFO ] Computed 4 invariants in 19 ms
[2024-05-31 18:20:06] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-31 18:20:06] [INFO ] Invariant cache hit.
[2024-05-31 18:20:07] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:20:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 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/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60659ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60688ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1531 places, 1929/1958 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62377 ms. Remains : 1507/1531 places, 1929/1958 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-01
Product exploration explored 100000 steps with 787 reset in 351 ms.
Product exploration explored 100000 steps with 790 reset in 286 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.11 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 253 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (309 resets) in 345 ms. (115 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (93 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (90 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (103 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (92 resets) in 112 ms. (354 steps per ms) remains 2/4 properties
[2024-05-31 18:21:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 289/291 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 1511 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 289/291 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3436 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3436 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3436 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3436/3436 variables, and 1513 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2008 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4052ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 326 ms.
Support contains 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Graph (trivial) has 1838 edges and 1507 vertex of which 689 / 1507 are part of one of the 63 SCC in 2 ms
Free SCC test removed 626 places
Drop transitions (Empty/Sink Transition effects.) removed 791 transitions
Reduce isomorphic transitions removed 791 transitions.
Graph (complete) has 1310 edges and 881 vertex of which 872 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 872 transition count 639
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 546 rules applied. Total rules applied 1043 place count 384 transition count 581
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 40 rules applied. Total rules applied 1083 place count 346 transition count 579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1085 place count 344 transition count 579
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1085 place count 344 transition count 529
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1185 place count 294 transition count 529
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1195 place count 284 transition count 515
Iterating global reduction 4 with 10 rules applied. Total rules applied 1205 place count 284 transition count 515
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 1208 place count 284 transition count 512
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1211 place count 281 transition count 512
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1217 place count 275 transition count 506
Iterating global reduction 6 with 6 rules applied. Total rules applied 1223 place count 275 transition count 506
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1229 place count 275 transition count 500
Performed 144 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 7 with 288 rules applied. Total rules applied 1517 place count 131 transition count 260
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1536 place count 131 transition count 241
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1539 place count 128 transition count 238
Iterating global reduction 8 with 3 rules applied. Total rules applied 1542 place count 128 transition count 238
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 8 with 26 rules applied. Total rules applied 1568 place count 115 transition count 222
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1584 place count 115 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1586 place count 114 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1588 place count 114 transition count 203
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 1590 place count 113 transition count 202
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1591 place count 113 transition count 201
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 11 with 68 rules applied. Total rules applied 1659 place count 79 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 11 with 38 rules applied. Total rules applied 1697 place count 79 transition count 194
Discarding 22 places :
Symmetric choice reduction at 12 with 22 rule applications. Total rules 1719 place count 57 transition count 158
Iterating global reduction 12 with 22 rules applied. Total rules applied 1741 place count 57 transition count 158
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1754 place count 57 transition count 145
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1760 place count 51 transition count 133
Iterating global reduction 13 with 6 rules applied. Total rules applied 1766 place count 51 transition count 133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1772 place count 51 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 14 with 11 rules applied. Total rules applied 1783 place count 51 transition count 116
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1784 place count 50 transition count 113
Iterating global reduction 14 with 1 rules applied. Total rules applied 1785 place count 50 transition count 113
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1786 place count 49 transition count 112
Iterating global reduction 14 with 1 rules applied. Total rules applied 1787 place count 49 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1788 place count 49 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1789 place count 49 transition count 110
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 1793 place count 49 transition count 106
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1799 place count 45 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1800 place count 45 transition count 103
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1802 place count 45 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1803 place count 45 transition count 102
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1804 place count 44 transition count 101
Iterating global reduction 16 with 1 rules applied. Total rules applied 1805 place count 44 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1806 place count 43 transition count 100
Applied a total of 1806 rules in 89 ms. Remains 43 /1507 variables (removed 1464) and now considering 100/1929 (removed 1829) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 43/1507 places, 100/1929 transitions.
RANDOM walk for 90 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Applied a total of 0 rules in 55 ms. Remains 1507 /1507 variables (removed 0) and now considering 1929/1929 (removed 0) transitions.
[2024-05-31 18:21:15] [INFO ] Invariant cache hit.
[2024-05-31 18:21:15] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-31 18:21:15] [INFO ] Invariant cache hit.
[2024-05-31 18:21:16] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:21:16] [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 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 1.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)timeout

(s855 0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 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/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60538ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60564ms
Finished structural reductions in LTL mode , in 1 iterations and 61920 ms. Remains : 1507/1507 places, 1929/1929 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.24 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (312 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (94 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (89 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (101 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (94 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 230787 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 4
Probabilistic random walk after 230787 steps, saw 65490 distinct states, run finished after 3007 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-31 18:22:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 289/291 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 1511 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4202 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 289/291 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 4/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3415 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3417 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3417 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3419 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3419 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3421 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3423 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/3436 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3436 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/3436 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3436/3436 variables, and 1515 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3164 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7377ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 982 ms.
Support contains 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Graph (trivial) has 1838 edges and 1507 vertex of which 689 / 1507 are part of one of the 63 SCC in 3 ms
Free SCC test removed 626 places
Drop transitions (Empty/Sink Transition effects.) removed 791 transitions
Reduce isomorphic transitions removed 791 transitions.
Graph (complete) has 1310 edges and 881 vertex of which 872 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 872 transition count 639
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 546 rules applied. Total rules applied 1043 place count 384 transition count 581
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 40 rules applied. Total rules applied 1083 place count 346 transition count 579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1085 place count 344 transition count 579
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1085 place count 344 transition count 529
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 1185 place count 294 transition count 529
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1195 place count 284 transition count 515
Iterating global reduction 4 with 10 rules applied. Total rules applied 1205 place count 284 transition count 515
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 1208 place count 284 transition count 512
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1211 place count 281 transition count 512
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1217 place count 275 transition count 506
Iterating global reduction 6 with 6 rules applied. Total rules applied 1223 place count 275 transition count 506
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1229 place count 275 transition count 500
Performed 144 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 7 with 288 rules applied. Total rules applied 1517 place count 131 transition count 260
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1536 place count 131 transition count 241
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1539 place count 128 transition count 238
Iterating global reduction 8 with 3 rules applied. Total rules applied 1542 place count 128 transition count 238
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 8 with 26 rules applied. Total rules applied 1568 place count 115 transition count 222
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1584 place count 115 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1586 place count 114 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1588 place count 114 transition count 203
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 1590 place count 113 transition count 202
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1591 place count 113 transition count 201
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 11 with 68 rules applied. Total rules applied 1659 place count 79 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 11 with 38 rules applied. Total rules applied 1697 place count 79 transition count 194
Discarding 22 places :
Symmetric choice reduction at 12 with 22 rule applications. Total rules 1719 place count 57 transition count 158
Iterating global reduction 12 with 22 rules applied. Total rules applied 1741 place count 57 transition count 158
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1754 place count 57 transition count 145
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1760 place count 51 transition count 133
Iterating global reduction 13 with 6 rules applied. Total rules applied 1766 place count 51 transition count 133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1772 place count 51 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 14 with 11 rules applied. Total rules applied 1783 place count 51 transition count 116
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1784 place count 50 transition count 113
Iterating global reduction 14 with 1 rules applied. Total rules applied 1785 place count 50 transition count 113
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1786 place count 49 transition count 112
Iterating global reduction 14 with 1 rules applied. Total rules applied 1787 place count 49 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1788 place count 49 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1789 place count 49 transition count 110
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 1793 place count 49 transition count 106
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1799 place count 45 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1800 place count 45 transition count 103
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1802 place count 45 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1803 place count 45 transition count 102
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1804 place count 44 transition count 101
Iterating global reduction 16 with 1 rules applied. Total rules applied 1805 place count 44 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1806 place count 43 transition count 100
Applied a total of 1806 rules in 63 ms. Remains 43 /1507 variables (removed 1464) and now considering 100/1929 (removed 1829) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 43/1507 places, 100/1929 transitions.
RANDOM walk for 304 steps (4 resets) in 6 ms. (43 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 792 reset in 191 ms.
Product exploration explored 100000 steps with 769 reset in 209 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Graph (trivial) has 1838 edges and 1507 vertex of which 689 / 1507 are part of one of the 63 SCC in 4 ms
Free SCC test removed 626 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1373 edges and 881 vertex of which 872 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 872 transition count 1197
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 490 place count 872 transition count 1185
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 490 place count 872 transition count 1198
Deduced a syphon composed of 497 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 511 place count 872 transition count 1198
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 794 place count 589 transition count 906
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1077 place count 589 transition count 906
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1087 place count 579 transition count 894
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1097 place count 579 transition count 894
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1103 place count 579 transition count 888
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1112 place count 570 transition count 879
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1121 place count 570 transition count 879
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1122 place count 569 transition count 877
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1123 place count 569 transition count 877
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1124 place count 568 transition count 875
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1125 place count 568 transition count 875
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1127 place count 566 transition count 873
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1129 place count 566 transition count 873
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1130 place count 565 transition count 871
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1131 place count 565 transition count 871
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1132 place count 564 transition count 869
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1133 place count 564 transition count 869
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1134 place count 563 transition count 868
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1135 place count 563 transition count 868
Performed 110 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 327 places in 1 ms
Iterating global reduction 3 with 110 rules applied. Total rules applied 1245 place count 563 transition count 943
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1288 place count 563 transition count 900
Discarding 104 places :
Symmetric choice reduction at 4 with 104 rule applications. Total rules 1392 place count 459 transition count 786
Deduced a syphon composed of 233 places in 1 ms
Iterating global reduction 4 with 104 rules applied. Total rules applied 1496 place count 459 transition count 786
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1502 place count 453 transition count 777
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1508 place count 453 transition count 777
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 234 places in 1 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1515 place count 453 transition count 777
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1521 place count 453 transition count 771
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1536 place count 438 transition count 752
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1551 place count 438 transition count 752
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1557 place count 438 transition count 746
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1561 place count 434 transition count 742
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1565 place count 434 transition count 742
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1568 place count 434 transition count 742
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1574 place count 434 transition count 736
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1577 place count 431 transition count 733
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1580 place count 431 transition count 733
Performed 75 Post agglomeration using F-continuation condition with reduction of 123 identical transitions.
Deduced a syphon composed of 294 places in 0 ms
Iterating global reduction 7 with 75 rules applied. Total rules applied 1655 place count 431 transition count 1075
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 7 with 126 rules applied. Total rules applied 1781 place count 431 transition count 949
Discarding 130 places :
Symmetric choice reduction at 8 with 130 rule applications. Total rules 1911 place count 301 transition count 603
Deduced a syphon composed of 173 places in 0 ms
Iterating global reduction 8 with 130 rules applied. Total rules applied 2041 place count 301 transition count 603
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 2056 place count 301 transition count 588
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 2083 place count 274 transition count 531
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 9 with 27 rules applied. Total rules applied 2110 place count 274 transition count 531
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2113 place count 274 transition count 579
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2116 place count 271 transition count 552
Deduced a syphon composed of 146 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2119 place count 271 transition count 552
Deduced a syphon composed of 146 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 9 with 58 rules applied. Total rules applied 2177 place count 271 transition count 494
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2182 place count 266 transition count 489
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 2187 place count 266 transition count 489
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2190 place count 266 transition count 549
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2193 place count 263 transition count 534
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2196 place count 263 transition count 534
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 2196 rules in 341 ms. Remains 263 /1507 variables (removed 1244) and now considering 534/1929 (removed 1395) transitions.
[2024-05-31 18:22:31] [INFO ] Redundant transitions in 33 ms returned []
Running 533 sub problems to find dead transitions.
[2024-05-31 18:22:31] [INFO ] Flow matrix only has 476 transitions (discarded 58 similar events)
// Phase 1: matrix 476 rows 263 cols
[2024-05-31 18:22:31] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 18:22:31] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
At refinement iteration 1 (OVERLAPS) 475/737 variables, 262/262 constraints. Problems are: Problem set: 252 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/737 variables, 4/266 constraints. Problems are: Problem set: 252 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/737 variables, 0/266 constraints. Problems are: Problem set: 252 solved, 281 unsolved
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/738 variables, 1/267 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/738 variables, 0/267 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 1/739 variables, 1/268 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/739 variables, 0/268 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 0/739 variables, 0/268 constraints. Problems are: Problem set: 257 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/739 variables, and 268 constraints, problems are : Problem set: 257 solved, 276 unsolved in 19594 ms.
Refiners :[State Equation: 263/263 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 257 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 472/593 variables, 121/121 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 4/125 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 276/401 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 0/401 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 145/738 variables, 142/543 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/738 variables, 0/543 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 1/739 variables, 1/544 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/739 variables, 0/544 constraints. Problems are: Problem set: 257 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/739 variables, 0/544 constraints. Problems are: Problem set: 257 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 739/739 variables, and 544 constraints, problems are : Problem set: 257 solved, 276 unsolved in 23865 ms.
Refiners :[State Equation: 263/263 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 276/533 constraints, Known Traps: 0/0 constraints]
After SMT, in 43730ms problems are : Problem set: 257 solved, 276 unsolved
Search for dead transitions found 257 dead transitions in 43738ms
Found 257 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 257 transitions
Dead transitions reduction (with SMT) removed 257 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 263/1507 places, 277/1929 transitions.
Graph (complete) has 420 edges and 263 vertex of which 122 are kept as prefixes of interest. Removing 141 places using SCC suffix rule.1 ms
Discarding 141 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 115 transition count 259
Applied a total of 8 rules in 9 ms. Remains 115 /263 variables (removed 148) and now considering 259/277 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1507 places, 259/1929 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44136 ms. Remains : 115/1507 places, 259/1929 transitions.
Support contains 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Applied a total of 0 rules in 46 ms. Remains 1507 /1507 variables (removed 0) and now considering 1929/1929 (removed 0) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-31 18:23:15] [INFO ] Computed 4 invariants in 15 ms
[2024-05-31 18:23:15] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-31 18:23:15] [INFO ] Invariant cache hit.
[2024-05-31 18:23:16] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:23:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 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/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60589ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60608ms
Finished structural reductions in LTL mode , in 1 iterations and 61966 ms. Remains : 1507/1507 places, 1929/1929 transitions.
Treatment of property CloudReconfiguration-PT-305-LTLFireability-01 finished in 250873 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&&X(p1)))))'
Support contains 2 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1520 transition count 1947
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1520 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1520 transition count 1946
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1513 transition count 1939
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1513 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 1510 transition count 1935
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 1510 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 1508 transition count 1931
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 1508 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 1506 transition count 1928
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 1506 transition count 1928
Applied a total of 52 rules in 268 ms. Remains 1506 /1531 variables (removed 25) and now considering 1928/1958 (removed 30) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-31 18:24:17] [INFO ] Computed 4 invariants in 19 ms
[2024-05-31 18:24:17] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-31 18:24:17] [INFO ] Invariant cache hit.
[2024-05-31 18:24:18] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-31 18:24:18] [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, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 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 0)
(s13 0)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 1)
(s341 1)
(s342 0)
(s343 1)
(s344 1)
(s345 0)
(s346 1)
(s347 0)
(s348 0)
(s349 1)
(s350 1)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 1)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 1)
(s694 1)
(s695 1)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 1)
(s701 0)
(s702 1)
(s703 0)
(s704 0)
(s705 0)
(s706 1)
(s707 0)
(s708 0)
(s709 0)
(s710 1)
(s711 1)
(s712 0)
(s713 1)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 1)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 1)
(s1095 1)
(s1096 0)
(s1097 1)
(s1098 0)
(s1099 0)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 1)
(s1109 0)
(s1110 0)
(s1111 1)
(s1112 1)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 1)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60511ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1531 places, 1928/1958 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62029 ms. Remains : 1506/1531 places, 1928/1958 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-02
Stuttering criterion allowed to conclude after 165 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-02 finished in 62230 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))||(p1 U X(p2)))))'
Support contains 3 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1520 transition count 1947
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1520 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1520 transition count 1946
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1513 transition count 1939
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1513 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 1510 transition count 1935
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 1510 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 1508 transition count 1931
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 1508 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 1506 transition count 1928
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 1506 transition count 1928
Applied a total of 52 rules in 276 ms. Remains 1506 /1531 variables (removed 25) and now considering 1928/1958 (removed 30) transitions.
[2024-05-31 18:25:19] [INFO ] Invariant cache hit.
[2024-05-31 18:25:19] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-31 18:25:19] [INFO ] Invariant cache hit.
[2024-05-31 18:25:20] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-31 18:25:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60599ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60620ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1531 places, 1928/1958 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62124 ms. Remains : 1506/1531 places, 1928/1958 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-03
Product exploration explored 100000 steps with 775 reset in 207 ms.
Product exploration explored 100000 steps with 782 reset in 222 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (295 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (87 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 389834 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 389834 steps, saw 100181 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2024-05-31 18:26:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 415/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1299 ms.
Refiners :[Generalized P Invariants (flows): 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 415/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1400 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2711ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2292 steps, including 31 resets, run visited all 1 properties in 10 ms. (steps per millisecond=229 )
Parikh walk visited 1 properties in 16 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 165 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1506 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 58 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2024-05-31 18:26:28] [INFO ] Invariant cache hit.
[2024-05-31 18:26:29] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-31 18:26:29] [INFO ] Invariant cache hit.
[2024-05-31 18:26:30] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1429 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-31 18:26:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60592ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60612ms
Finished structural reductions in LTL mode , in 1 iterations and 62107 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.11 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (315 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (94 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 408130 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 408130 steps, saw 101095 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2024-05-31 18:27:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 415/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1406 ms.
Refiners :[Generalized P Invariants (flows): 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 415/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1414 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2832ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8415 steps, including 132 resets, run visited all 1 properties in 32 ms. (steps per millisecond=262 )
Parikh walk visited 1 properties in 32 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 46785 steps with 380 reset in 76 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-03 finished in 138604 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(p0)||G(F(p1))||(F(p1)&&G(F(p2)))))'
Support contains 3 out of 1531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Graph (trivial) has 1863 edges and 1531 vertex of which 695 / 1531 are part of one of the 63 SCC in 1 ms
Free SCC test removed 632 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1395 edges and 899 vertex of which 890 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 486 rules applied. Total rules applied 488 place count 889 transition count 731
Reduce places removed 486 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 511 rules applied. Total rules applied 999 place count 403 transition count 706
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1011 place count 391 transition count 706
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1011 place count 391 transition count 660
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1103 place count 345 transition count 660
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1117 place count 331 transition count 637
Iterating global reduction 3 with 14 rules applied. Total rules applied 1131 place count 331 transition count 637
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1133 place count 331 transition count 635
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1135 place count 329 transition count 635
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1144 place count 320 transition count 622
Iterating global reduction 5 with 9 rules applied. Total rules applied 1153 place count 320 transition count 622
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1158 place count 320 transition count 617
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1160 place count 318 transition count 613
Iterating global reduction 6 with 2 rules applied. Total rules applied 1162 place count 318 transition count 613
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1164 place count 316 transition count 609
Iterating global reduction 6 with 2 rules applied. Total rules applied 1166 place count 316 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1167 place count 315 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 1168 place count 315 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1169 place count 314 transition count 605
Iterating global reduction 6 with 1 rules applied. Total rules applied 1170 place count 314 transition count 605
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1171 place count 313 transition count 603
Iterating global reduction 6 with 1 rules applied. Total rules applied 1172 place count 313 transition count 603
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1173 place count 312 transition count 596
Iterating global reduction 6 with 1 rules applied. Total rules applied 1174 place count 312 transition count 596
Performed 147 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 6 with 294 rules applied. Total rules applied 1468 place count 165 transition count 366
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1480 place count 165 transition count 354
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1485 place count 160 transition count 348
Iterating global reduction 7 with 5 rules applied. Total rules applied 1490 place count 160 transition count 348
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1491 place count 159 transition count 347
Iterating global reduction 7 with 1 rules applied. Total rules applied 1492 place count 159 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1493 place count 159 transition count 346
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 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 1515 place count 148 transition count 333
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1526 place count 148 transition count 322
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1527 place count 147 transition count 320
Iterating global reduction 9 with 1 rules applied. Total rules applied 1528 place count 147 transition count 320
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -38
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 1562 place count 130 transition count 358
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1583 place count 130 transition count 337
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1592 place count 121 transition count 319
Iterating global reduction 10 with 9 rules applied. Total rules applied 1601 place count 121 transition count 319
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1606 place count 121 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 11 with 38 rules applied. Total rules applied 1644 place count 121 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1645 place count 120 transition count 275
Applied a total of 1645 rules in 144 ms. Remains 120 /1531 variables (removed 1411) and now considering 275/1958 (removed 1683) transitions.
[2024-05-31 18:27:38] [INFO ] Flow matrix only has 218 transitions (discarded 57 similar events)
// Phase 1: matrix 218 rows 120 cols
[2024-05-31 18:27:38] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 18:27:38] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-31 18:27:38] [INFO ] Flow matrix only has 218 transitions (discarded 57 similar events)
[2024-05-31 18:27:38] [INFO ] Invariant cache hit.
[2024-05-31 18:27:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:27:38] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [12, 82]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 231 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1531 places, 275/1958 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 273
Applied a total of 2 rules in 6 ms. Remains 116 /118 variables (removed 2) and now considering 273/275 (removed 2) transitions.
[2024-05-31 18:27:38] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
// Phase 1: matrix 216 rows 116 cols
[2024-05-31 18:27:38] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:27:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-31 18:27:38] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-31 18:27:38] [INFO ] Invariant cache hit.
[2024-05-31 18:27:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:27:38] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1531 places, 273/1958 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 530 ms. Remains : 116/1531 places, 273/1958 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-04
Product exploration explored 100000 steps with 9812 reset in 251 ms.
Product exploration explored 100000 steps with 9736 reset in 227 ms.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, false, false]
RANDOM walk for 40000 steps (4846 resets) in 354 ms. (112 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (962 resets) in 92 ms. (430 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (942 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (953 resets) in 66 ms. (597 steps per ms) remains 2/3 properties
[2024-05-31 18:27:39] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-31 18:27:39] [INFO ] Invariant cache hit.
[2024-05-31 18:27:39] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/147 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 177/324 variables, 97/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/331 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/331 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/332 variables, and 119 constraints, problems are : Problem set: 0 solved, 2 unsolved in 119 ms.
Refiners :[State Equation: 116/116 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/147 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 177/324 variables, 97/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/331 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/331 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/332 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 137 ms.
Refiners :[State Equation: 116/116 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 273/273 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 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 64 rules applied. Total rules applied 64 place count 116 transition count 209
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 71 place count 109 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 71 place count 109 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 108 transition count 208
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 119 place count 85 transition count 185
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 130 place count 85 transition count 174
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 139 place count 76 transition count 165
Iterating global reduction 3 with 9 rules applied. Total rules applied 148 place count 76 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 76 transition count 162
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 171 place count 66 transition count 152
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 181 place count 66 transition count 142
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 189 place count 58 transition count 132
Iterating global reduction 5 with 8 rules applied. Total rules applied 197 place count 58 transition count 132
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 205 place count 58 transition count 124
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 219 place count 51 transition count 125
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 229 place count 51 transition count 115
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 235 place count 45 transition count 107
Iterating global reduction 7 with 6 rules applied. Total rules applied 241 place count 45 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 247 place count 45 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 257 place count 45 transition count 91
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 259 place count 43 transition count 85
Iterating global reduction 8 with 2 rules applied. Total rules applied 261 place count 43 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 263 place count 43 transition count 83
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 265 place count 41 transition count 81
Iterating global reduction 9 with 2 rules applied. Total rules applied 267 place count 41 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 271 place count 41 transition count 77
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 273 place count 40 transition count 87
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 278 place count 40 transition count 82
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 284 place count 35 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 285 place count 35 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 286 place count 35 transition count 80
Applied a total of 286 rules in 27 ms. Remains 35 /116 variables (removed 81) and now considering 80/273 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 35/116 places, 80/273 transitions.
RANDOM walk for 40000 steps (918 resets) in 519 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (281 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (289 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Probably explored full state space saw : 3166 states, properties seen :0
Probabilistic random walk after 12717 steps, saw 3166 distinct states, run finished after 57 ms. (steps per millisecond=223 ) properties seen :0
Explored full state space saw : 3166 states, properties seen :0
Exhaustive walk after 12717 steps, saw 3166 distinct states, run finished after 62 ms. (steps per millisecond=205 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p0), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 16 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-305-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-305-LTLFireability-04 finished in 2630 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(p0)&&X(G(p1))))'
Support contains 2 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1521 transition count 1948
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1521 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1521 transition count 1947
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 1514 transition count 1940
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 1514 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 1511 transition count 1936
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 1511 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 1509 transition count 1932
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 1509 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 1507 transition count 1929
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 1507 transition count 1929
Applied a total of 50 rules in 347 ms. Remains 1507 /1531 variables (removed 24) and now considering 1929/1958 (removed 29) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-31 18:27:40] [INFO ] Computed 4 invariants in 18 ms
[2024-05-31 18:27:41] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-31 18:27:41] [INFO ] Invariant cache hit.
[2024-05-31 18:27:42] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:27:42] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 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/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60557ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60577ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1531 places, 1929/1958 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62346 ms. Remains : 1507/1531 places, 1929/1958 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-05
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-05 finished in 62556 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(F(p1)))))'
Support contains 3 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1520 transition count 1947
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1520 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1520 transition count 1946
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1513 transition count 1939
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1513 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 1510 transition count 1935
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 1510 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 1508 transition count 1931
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 1508 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 1506 transition count 1928
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 1506 transition count 1928
Applied a total of 52 rules in 339 ms. Remains 1506 /1531 variables (removed 25) and now considering 1928/1958 (removed 30) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-31 18:28:43] [INFO ] Computed 4 invariants in 13 ms
[2024-05-31 18:28:43] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-31 18:28:43] [INFO ] Invariant cache hit.
[2024-05-31 18:28:44] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-31 18:28:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60576ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60595ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1531 places, 1928/1958 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62315 ms. Remains : 1506/1531 places, 1928/1958 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-06
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-06 finished in 62496 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)))'
Support contains 1 out of 1531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Graph (trivial) has 1869 edges and 1531 vertex of which 695 / 1531 are part of one of the 63 SCC in 2 ms
Free SCC test removed 632 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1395 edges and 899 vertex of which 890 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 490 place count 889 transition count 729
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 513 rules applied. Total rules applied 1003 place count 401 transition count 704
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1015 place count 389 transition count 704
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1015 place count 389 transition count 658
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1107 place count 343 transition count 658
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1121 place count 329 transition count 635
Iterating global reduction 3 with 14 rules applied. Total rules applied 1135 place count 329 transition count 635
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1137 place count 329 transition count 633
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1139 place count 327 transition count 633
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1148 place count 318 transition count 620
Iterating global reduction 5 with 9 rules applied. Total rules applied 1157 place count 318 transition count 620
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1162 place count 318 transition count 615
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1164 place count 316 transition count 611
Iterating global reduction 6 with 2 rules applied. Total rules applied 1166 place count 316 transition count 611
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1168 place count 314 transition count 607
Iterating global reduction 6 with 2 rules applied. Total rules applied 1170 place count 314 transition count 607
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1172 place count 312 transition count 603
Iterating global reduction 6 with 2 rules applied. Total rules applied 1174 place count 312 transition count 603
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1176 place count 310 transition count 599
Iterating global reduction 6 with 2 rules applied. Total rules applied 1178 place count 310 transition count 599
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1180 place count 308 transition count 595
Iterating global reduction 6 with 2 rules applied. Total rules applied 1182 place count 308 transition count 595
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1184 place count 306 transition count 581
Iterating global reduction 6 with 2 rules applied. Total rules applied 1186 place count 306 transition count 581
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1187 place count 306 transition count 580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1188 place count 305 transition count 580
Performed 147 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 8 with 294 rules applied. Total rules applied 1482 place count 158 transition count 347
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 8 with 11 rules applied. Total rules applied 1493 place count 158 transition count 336
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1495 place count 157 transition count 335
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1500 place count 152 transition count 329
Iterating global reduction 10 with 5 rules applied. Total rules applied 1505 place count 152 transition count 329
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1506 place count 151 transition count 328
Iterating global reduction 10 with 1 rules applied. Total rules applied 1507 place count 151 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1508 place count 151 transition count 327
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1528 place count 141 transition count 315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1537 place count 141 transition count 306
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1571 place count 124 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1588 place count 124 transition count 323
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1597 place count 115 transition count 305
Iterating global reduction 13 with 9 rules applied. Total rules applied 1606 place count 115 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1612 place count 115 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 1648 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1649 place count 114 transition count 262
Applied a total of 1649 rules in 90 ms. Remains 114 /1531 variables (removed 1417) and now considering 262/1958 (removed 1696) transitions.
[2024-05-31 18:29:45] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 114 cols
[2024-05-31 18:29:45] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 18:29:45] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 18:29:45] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2024-05-31 18:29:45] [INFO ] Invariant cache hit.
[2024-05-31 18:29:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:29:45] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [8, 74]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 183 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1531 places, 262/1958 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 260
Applied a total of 2 rules in 5 ms. Remains 110 /112 variables (removed 2) and now considering 260/262 (removed 2) transitions.
[2024-05-31 18:29:45] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 110 cols
[2024-05-31 18:29:45] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:29:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 18:29:45] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-31 18:29:45] [INFO ] Invariant cache hit.
[2024-05-31 18:29:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 18:29:46] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1531 places, 260/1958 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 445 ms. Remains : 110/1531 places, 260/1958 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-07 finished in 494 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)&&F(p1))))'
Support contains 2 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1520 transition count 1947
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1520 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1520 transition count 1946
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1513 transition count 1939
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1513 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 1510 transition count 1935
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 1510 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 1508 transition count 1931
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 1508 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 1506 transition count 1928
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 1506 transition count 1928
Applied a total of 52 rules in 347 ms. Remains 1506 /1531 variables (removed 25) and now considering 1928/1958 (removed 30) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-31 18:29:46] [INFO ] Computed 4 invariants in 16 ms
[2024-05-31 18:29:46] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-31 18:29:46] [INFO ] Invariant cache hit.
[2024-05-31 18:29:47] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-31 18:29:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60519ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60537ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1531 places, 1928/1958 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62199 ms. Remains : 1506/1531 places, 1928/1958 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-08
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-08 finished in 62370 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)&&F(G((F(p1)||(p2 U (p3||G(p2)))))))))'
Support contains 3 out of 1531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Graph (trivial) has 1864 edges and 1531 vertex of which 690 / 1531 are part of one of the 63 SCC in 1 ms
Free SCC test removed 627 places
Ensure Unique test removed 729 transitions
Reduce isomorphic transitions removed 729 transitions.
Graph (complete) has 1401 edges and 904 vertex of which 895 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 490 place count 894 transition count 735
Reduce places removed 488 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 513 rules applied. Total rules applied 1003 place count 406 transition count 710
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 1017 place count 394 transition count 708
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1019 place count 392 transition count 708
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1019 place count 392 transition count 662
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1111 place count 346 transition count 662
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1125 place count 332 transition count 639
Iterating global reduction 4 with 14 rules applied. Total rules applied 1139 place count 332 transition count 639
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1141 place count 332 transition count 637
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1143 place count 330 transition count 637
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1152 place count 321 transition count 624
Iterating global reduction 6 with 9 rules applied. Total rules applied 1161 place count 321 transition count 624
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1166 place count 321 transition count 619
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1168 place count 319 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 1170 place count 319 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1172 place count 317 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1174 place count 317 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1176 place count 315 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1178 place count 315 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1180 place count 313 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1182 place count 313 transition count 603
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1184 place count 311 transition count 599
Iterating global reduction 7 with 2 rules applied. Total rules applied 1186 place count 311 transition count 599
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1188 place count 309 transition count 585
Iterating global reduction 7 with 2 rules applied. Total rules applied 1190 place count 309 transition count 585
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1191 place count 309 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1192 place count 308 transition count 584
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 9 with 292 rules applied. Total rules applied 1484 place count 162 transition count 351
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 11 rules applied. Total rules applied 1495 place count 162 transition count 340
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 1497 place count 161 transition count 339
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1501 place count 157 transition count 334
Iterating global reduction 11 with 4 rules applied. Total rules applied 1505 place count 157 transition count 334
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1525 place count 147 transition count 322
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1534 place count 147 transition count 313
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1568 place count 130 transition count 347
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1585 place count 130 transition count 330
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1594 place count 121 transition count 312
Iterating global reduction 13 with 9 rules applied. Total rules applied 1603 place count 121 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1609 place count 121 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 1645 place count 121 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1646 place count 120 transition count 269
Applied a total of 1646 rules in 71 ms. Remains 120 /1531 variables (removed 1411) and now considering 269/1958 (removed 1689) transitions.
[2024-05-31 18:30:48] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
// Phase 1: matrix 212 rows 120 cols
[2024-05-31 18:30:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 18:30:48] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-31 18:30:48] [INFO ] Flow matrix only has 212 transitions (discarded 57 similar events)
[2024-05-31 18:30:48] [INFO ] Invariant cache hit.
[2024-05-31 18:30:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:30:49] [INFO ] Implicit Places using invariants and state equation in 270 ms returned [10, 80]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 426 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1531 places, 269/1958 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 267
Applied a total of 2 rules in 4 ms. Remains 116 /118 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2024-05-31 18:30:49] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 116 cols
[2024-05-31 18:30:49] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:30:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 18:30:49] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2024-05-31 18:30:49] [INFO ] Invariant cache hit.
[2024-05-31 18:30:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 18:30:49] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1531 places, 267/1958 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 859 ms. Remains : 116/1531 places, 267/1958 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-10 finished in 1023 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(G(p0))&&G(p1))))'
Support contains 2 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1522 transition count 1949
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1522 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1522 transition count 1948
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 1516 transition count 1942
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 1514 transition count 1939
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1512 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1510 transition count 1933
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1510 transition count 1933
Applied a total of 43 rules in 316 ms. Remains 1510 /1531 variables (removed 21) and now considering 1933/1958 (removed 25) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2024-05-31 18:30:49] [INFO ] Computed 4 invariants in 8 ms
[2024-05-31 18:30:50] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-31 18:30:50] [INFO ] Invariant cache hit.
[2024-05-31 18:30:51] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-31 18:30:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints]
After SMT, in 60525ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60543ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1531 places, 1933/1958 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62194 ms. Remains : 1510/1531 places, 1933/1958 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-12
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-12 finished in 62365 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((X((p1&&G(p2)))&&p0))))'
Support contains 4 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1521 transition count 1948
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1521 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1521 transition count 1947
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 1515 transition count 1941
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 1515 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 1512 transition count 1937
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 1512 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 1510 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 1510 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 1508 transition count 1930
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 1508 transition count 1930
Applied a total of 48 rules in 338 ms. Remains 1508 /1531 variables (removed 23) and now considering 1930/1958 (removed 28) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-31 18:31:52] [INFO ] Computed 4 invariants in 15 ms
[2024-05-31 18:31:52] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-31 18:31:52] [INFO ] Invariant cache hit.
[2024-05-31 18:31:53] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-31 18:31:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60533ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1531 places, 1930/1958 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62192 ms. Remains : 1508/1531 places, 1930/1958 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-13
Entered a terminal (fully accepting) state of product in 69036 steps with 539 reset in 147 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-13 finished in 62543 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)))'
Support contains 1 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1521 transition count 1948
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1521 transition count 1948
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 1514 transition count 1941
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 1514 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 1511 transition count 1937
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 1511 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 1511 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1509 transition count 1933
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1507 transition count 1930
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1507 transition count 1930
Applied a total of 49 rules in 333 ms. Remains 1507 /1531 variables (removed 24) and now considering 1930/1958 (removed 28) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-31 18:32:54] [INFO ] Computed 4 invariants in 15 ms
[2024-05-31 18:32:55] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-31 18:32:55] [INFO ] Invariant cache hit.
[2024-05-31 18:32:56] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-31 18:32:56] [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/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60569ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60587ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1531 places, 1930/1958 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62267 ms. Remains : 1507/1531 places, 1930/1958 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-305-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-305-LTLFireability-15 finished in 62389 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)))||G(p1)))'
Found a Shortening insensitive property : CloudReconfiguration-PT-305-LTLFireability-01
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1531/1531 places, 1958/1958 transitions.
Graph (trivial) has 1867 edges and 1531 vertex of which 691 / 1531 are part of one of the 63 SCC in 2 ms
Free SCC test removed 628 places
Ensure Unique test removed 730 transitions
Reduce isomorphic transitions removed 730 transitions.
Graph (complete) has 1400 edges and 903 vertex of which 894 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 492 place count 893 transition count 732
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 515 rules applied. Total rules applied 1007 place count 403 transition count 707
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 1020 place count 391 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1021 place count 390 transition count 706
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1021 place count 390 transition count 660
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1113 place count 344 transition count 660
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1126 place count 331 transition count 639
Iterating global reduction 4 with 13 rules applied. Total rules applied 1139 place count 331 transition count 639
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1141 place count 331 transition count 637
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1143 place count 329 transition count 637
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1150 place count 322 transition count 628
Iterating global reduction 6 with 7 rules applied. Total rules applied 1157 place count 322 transition count 628
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1162 place count 322 transition count 623
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1163 place count 321 transition count 621
Iterating global reduction 7 with 1 rules applied. Total rules applied 1164 place count 321 transition count 621
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1165 place count 320 transition count 619
Iterating global reduction 7 with 1 rules applied. Total rules applied 1166 place count 320 transition count 619
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1167 place count 319 transition count 617
Iterating global reduction 7 with 1 rules applied. Total rules applied 1168 place count 319 transition count 617
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1169 place count 318 transition count 615
Iterating global reduction 7 with 1 rules applied. Total rules applied 1170 place count 318 transition count 615
Performed 150 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 7 with 300 rules applied. Total rules applied 1470 place count 168 transition count 378
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1483 place count 168 transition count 365
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1488 place count 163 transition count 359
Iterating global reduction 8 with 5 rules applied. Total rules applied 1493 place count 163 transition count 359
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1494 place count 162 transition count 358
Iterating global reduction 8 with 1 rules applied. Total rules applied 1495 place count 162 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1496 place count 162 transition count 357
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1518 place count 151 transition count 344
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1530 place count 151 transition count 332
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1531 place count 150 transition count 330
Iterating global reduction 10 with 1 rules applied. Total rules applied 1532 place count 150 transition count 330
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 38 rules applied. Total rules applied 1570 place count 131 transition count 368
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 1593 place count 131 transition count 345
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1602 place count 122 transition count 327
Iterating global reduction 11 with 9 rules applied. Total rules applied 1611 place count 122 transition count 327
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1617 place count 122 transition count 321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1618 place count 121 transition count 320
Applied a total of 1618 rules in 79 ms. Remains 121 /1531 variables (removed 1410) and now considering 320/1958 (removed 1638) transitions.
[2024-05-31 18:33:57] [INFO ] Flow matrix only has 262 transitions (discarded 58 similar events)
// Phase 1: matrix 262 rows 121 cols
[2024-05-31 18:33:57] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 18:33:57] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 18:33:57] [INFO ] Flow matrix only has 262 transitions (discarded 58 similar events)
[2024-05-31 18:33:57] [INFO ] Invariant cache hit.
[2024-05-31 18:33:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 18:33:57] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [17, 83]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 194 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 119/1531 places, 320/1958 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 318
Applied a total of 2 rules in 5 ms. Remains 117 /119 variables (removed 2) and now considering 318/320 (removed 2) transitions.
[2024-05-31 18:33:57] [INFO ] Flow matrix only has 260 transitions (discarded 58 similar events)
// Phase 1: matrix 260 rows 117 cols
[2024-05-31 18:33:57] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 18:33:57] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-31 18:33:57] [INFO ] Flow matrix only has 260 transitions (discarded 58 similar events)
[2024-05-31 18:33:57] [INFO ] Invariant cache hit.
[2024-05-31 18:33:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 18:33:57] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 117/1531 places, 318/1958 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 439 ms. Remains : 117/1531 places, 318/1958 transitions.
Running random walk in product with property : CloudReconfiguration-PT-305-LTLFireability-01
Stuttering criterion allowed to conclude after 5514 steps with 542 reset in 9 ms.
Treatment of property CloudReconfiguration-PT-305-LTLFireability-01 finished in 759 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-31 18:33:57] [INFO ] Flatten gal took : 54 ms
[2024-05-31 18:33:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 18:33:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1531 places, 1958 transitions and 4087 arcs took 12 ms.
Total runtime 910494 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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

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

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