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.r091-tall-171624187200204.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 greatspnxred
Input is CloudReconfiguration-PT-312, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187200204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K 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.9K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 19:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Apr 11 19:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 19:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 19:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 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-312-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-312-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716267971146

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-312
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 05:06:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 05:06:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 05:06:12] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-05-21 05:06:12] [INFO ] Transformed 2585 places.
[2024-05-21 05:06:12] [INFO ] Transformed 3095 transitions.
[2024-05-21 05:06:12] [INFO ] Found NUPN structural information;
[2024-05-21 05:06:12] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-312-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-312-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 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 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1066 place count 2066 transition count 2548
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1305 place count 1827 transition count 2309
Iterating global reduction 1 with 239 rules applied. Total rules applied 1544 place count 1827 transition count 2309
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 1630 place count 1741 transition count 2223
Iterating global reduction 1 with 86 rules applied. Total rules applied 1716 place count 1741 transition count 2223
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1733 place count 1741 transition count 2206
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1778 place count 1696 transition count 2161
Iterating global reduction 2 with 45 rules applied. Total rules applied 1823 place count 1696 transition count 2161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1830 place count 1696 transition count 2154
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1866 place count 1660 transition count 2113
Iterating global reduction 3 with 36 rules applied. Total rules applied 1902 place count 1660 transition count 2113
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1926 place count 1636 transition count 2089
Iterating global reduction 3 with 24 rules applied. Total rules applied 1950 place count 1636 transition count 2089
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1971 place count 1615 transition count 2068
Iterating global reduction 3 with 21 rules applied. Total rules applied 1992 place count 1615 transition count 2068
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2013 place count 1594 transition count 2047
Iterating global reduction 3 with 21 rules applied. Total rules applied 2034 place count 1594 transition count 2047
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2052 place count 1576 transition count 2019
Iterating global reduction 3 with 18 rules applied. Total rules applied 2070 place count 1576 transition count 2019
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2076 place count 1570 transition count 2010
Iterating global reduction 3 with 6 rules applied. Total rules applied 2082 place count 1570 transition count 2010
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2088 place count 1564 transition count 2002
Iterating global reduction 3 with 6 rules applied. Total rules applied 2094 place count 1564 transition count 2002
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2095 place count 1564 transition count 2001
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2097 place count 1562 transition count 1999
Iterating global reduction 4 with 2 rules applied. Total rules applied 2099 place count 1562 transition count 1999
Applied a total of 2099 rules in 1669 ms. Remains 1562 /2585 variables (removed 1023) and now considering 1999/3095 (removed 1096) transitions.
// Phase 1: matrix 1999 rows 1562 cols
[2024-05-21 05:06:14] [INFO ] Computed 4 invariants in 40 ms
[2024-05-21 05:06:15] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-21 05:06:15] [INFO ] Invariant cache hit.
[2024-05-21 05:06:16] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
Running 1998 sub problems to find dead transitions.
[2024-05-21 05:06:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1561 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1998 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3561 variables, and 4 constraints, problems are : Problem set: 0 solved, 1998 unsolved in 30086 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1998/1998 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1998 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1561 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1998 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3561 variables, and 4 constraints, problems are : Problem set: 0 solved, 1998 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1998 constraints, Known Traps: 0/0 constraints]
After SMT, in 60782ms problems are : Problem set: 0 solved, 1998 unsolved
Search for dead transitions found 0 dead transitions in 60818ms
Starting structural reductions in LTL mode, iteration 1 : 1562/2585 places, 1999/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64196 ms. Remains : 1562/2585 places, 1999/3095 transitions.
Support contains 35 out of 1562 places after structural reductions.
[2024-05-21 05:07:17] [INFO ] Flatten gal took : 154 ms
[2024-05-21 05:07:17] [INFO ] Flatten gal took : 75 ms
[2024-05-21 05:07:17] [INFO ] Input system was already deterministic with 1999 transitions.
RANDOM walk for 40000 steps (275 resets) in 2935 ms. (13 steps per ms) remains 28/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (8 resets) in 81 ms. (48 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (10 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
[2024-05-21 05:07:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1521/1551 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1551 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1989/3540 variables, 1551/1555 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3540 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 2/3542 variables, 1/1556 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3542 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 2/3544 variables, 1/1557 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 0.0)
(s2 0.0)
(s11 0.0)
(s12 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3544/3561 variables, and 1557 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1553/1562 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1521/1551 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1551 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1989/3540 variables, 1551/1555 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3540 variables, 28/1583 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3540 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 2/3542 variables, 1/1584 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3542 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 2/3544 variables, 1/1585 constraints. Problems are: Problem set: 0 solved, 28 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 3544/3561 variables, and 1585 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5024 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1553/1562 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 10069ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Graph (trivial) has 1843 edges and 1562 vertex of which 631 / 1562 are part of one of the 60 SCC in 10 ms
Free SCC test removed 571 places
Drop transitions (Empty/Sink Transition effects.) removed 717 transitions
Reduce isomorphic transitions removed 717 transitions.
Graph (complete) has 1457 edges and 991 vertex of which 982 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 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 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 512 rules applied. Total rules applied 514 place count 982 transition count 766
Reduce places removed 506 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 557 rules applied. Total rules applied 1071 place count 476 transition count 715
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 48 rules applied. Total rules applied 1119 place count 444 transition count 699
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 18 rules applied. Total rules applied 1137 place count 430 transition count 695
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1140 place count 429 transition count 693
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1141 place count 428 transition count 693
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 56 Pre rules applied. Total rules applied 1141 place count 428 transition count 637
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 1253 place count 372 transition count 637
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1260 place count 365 transition count 628
Iterating global reduction 6 with 7 rules applied. Total rules applied 1267 place count 365 transition count 628
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 1268 place count 365 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1269 place count 364 transition count 627
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1274 place count 359 transition count 622
Iterating global reduction 8 with 5 rules applied. Total rules applied 1279 place count 359 transition count 622
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1284 place count 359 transition count 617
Performed 173 Post agglomeration using F-continuation condition with reduction of 93 identical transitions.
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 9 with 346 rules applied. Total rules applied 1630 place count 186 transition count 351
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 1657 place count 186 transition count 324
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1660 place count 183 transition count 321
Iterating global reduction 10 with 3 rules applied. Total rules applied 1663 place count 183 transition count 321
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1683 place count 173 transition count 310
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1696 place count 173 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1698 place count 172 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1700 place count 172 transition count 294
Performed 40 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 12 with 80 rules applied. Total rules applied 1780 place count 132 transition count 342
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 12 with 31 rules applied. Total rules applied 1811 place count 132 transition count 311
Discarding 20 places :
Symmetric choice reduction at 13 with 20 rule applications. Total rules 1831 place count 112 transition count 271
Iterating global reduction 13 with 20 rules applied. Total rules applied 1851 place count 112 transition count 271
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 1858 place count 112 transition count 264
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1859 place count 111 transition count 262
Iterating global reduction 14 with 1 rules applied. Total rules applied 1860 place count 111 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 14 with 17 rules applied. Total rules applied 1877 place count 111 transition count 245
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1879 place count 110 transition count 244
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 1882 place count 110 transition count 241
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1885 place count 107 transition count 241
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 15 with 7 rules applied. Total rules applied 1892 place count 107 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1893 place count 106 transition count 240
Applied a total of 1893 rules in 251 ms. Remains 106 /1562 variables (removed 1456) and now considering 240/1999 (removed 1759) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 106/1562 places, 240/1999 transitions.
RANDOM walk for 40000 steps (3746 resets) in 1243 ms. (32 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40004 steps (581 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2024-05-21 05:07:29] [INFO ] Flow matrix only has 230 transitions (discarded 10 similar events)
// Phase 1: matrix 230 rows 106 cols
[2024-05-21 05:07:29] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 05:07:29] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 139/173 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 124/297 variables, 46/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/316 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/334 variables, 18/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/334 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 336/336 variables, and 115 constraints, problems are : Problem set: 1 solved, 0 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 151ms 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 2179 edges and 1562 vertex of which 1553 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.25 ms
FORMULA CloudReconfiguration-PT-312-LTLFireability-12 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' '!(X(F((G(p0)||(p1 U (G(p1)||(p1&&(p0 U (G(p0)||(p0&&G(p2)))))))))))'
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 1549 transition count 1984
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 1540 transition count 1975
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 1540 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 1540 transition count 1974
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 1534 transition count 1967
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 1534 transition count 1967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 1534 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 65 place count 1529 transition count 1960
Iterating global reduction 3 with 5 rules applied. Total rules applied 70 place count 1529 transition count 1960
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 75 place count 1524 transition count 1954
Iterating global reduction 3 with 5 rules applied. Total rules applied 80 place count 1524 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 1524 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 84 place count 1521 transition count 1950
Iterating global reduction 4 with 3 rules applied. Total rules applied 87 place count 1521 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 90 place count 1518 transition count 1947
Iterating global reduction 4 with 3 rules applied. Total rules applied 93 place count 1518 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 96 place count 1515 transition count 1942
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 1515 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 102 place count 1512 transition count 1936
Iterating global reduction 4 with 3 rules applied. Total rules applied 105 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 1510 transition count 1934
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 1510 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 1510 transition count 1933
Applied a total of 110 rules in 626 ms. Remains 1510 /1562 variables (removed 52) and now considering 1933/1999 (removed 66) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2024-05-21 05:07:30] [INFO ] Computed 4 invariants in 21 ms
[2024-05-21 05:07:31] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-21 05:07:31] [INFO ] Invariant cache hit.
[2024-05-21 05:07:32] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-21 05:07:32] [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/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 30040 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
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 30034 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 60726ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60747ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1562 places, 1933/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62628 ms. Remains : 1510/1562 places, 1933/1999 transitions.
Stuttering acceptance computed with spot in 357 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)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-00
Product exploration explored 100000 steps with 700 reset in 349 ms.
Product exploration explored 100000 steps with 704 reset in 280 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2110 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 125 ms. Reduced automaton from 5 states, 28 edges and 3 AP (stutter sensitive) to 5 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 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)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (289 resets) in 260 ms. (153 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40003 steps (82 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (76 resets) in 52 ms. (754 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (71 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (72 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (73 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (77 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (73 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (79 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (78 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (77 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (80 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
[2024-05-21 05:08:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 694/697 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/697 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 802/1499 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1499 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3422 variables, 1499/1503 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3436/3443 variables, and 1510 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1510 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 694/697 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/697 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 802/1499 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1499 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3422 variables, 1499/1503 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3422 variables, 11/1514 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3422 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2/3424 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3424 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 2/3426 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3426 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 2/3428 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3428 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 2/3430 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3430 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 2/3432 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3432 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 2/3434 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3434 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 2/3436 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3436 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 2/3438 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 11 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 3438/3443 variables, and 1522 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1510 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 10040ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1837 edges and 1510 vertex of which 675 / 1510 are part of one of the 62 SCC in 4 ms
Free SCC test removed 613 places
Drop transitions (Empty/Sink Transition effects.) removed 772 transitions
Reduce isomorphic transitions removed 772 transitions.
Graph (complete) has 1333 edges and 897 vertex of which 888 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 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 0 with 502 rules applied. Total rules applied 504 place count 888 transition count 655
Reduce places removed 495 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 554 rules applied. Total rules applied 1058 place count 393 transition count 596
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 41 rules applied. Total rules applied 1099 place count 355 transition count 593
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 1104 place count 353 transition count 590
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1107 place count 352 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1108 place count 351 transition count 588
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 1108 place count 351 transition count 537
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 1210 place count 300 transition count 537
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1219 place count 291 transition count 525
Iterating global reduction 6 with 9 rules applied. Total rules applied 1228 place count 291 transition count 525
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 6 with 2 rules applied. Total rules applied 1230 place count 291 transition count 523
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1232 place count 289 transition count 523
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1238 place count 283 transition count 517
Iterating global reduction 8 with 6 rules applied. Total rules applied 1244 place count 283 transition count 517
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1250 place count 283 transition count 511
Performed 151 Post agglomeration using F-continuation condition with reduction of 99 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 9 with 302 rules applied. Total rules applied 1552 place count 132 transition count 261
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 1572 place count 132 transition count 241
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1575 place count 129 transition count 238
Iterating global reduction 10 with 3 rules applied. Total rules applied 1578 place count 129 transition count 238
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1602 place count 117 transition count 224
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1617 place count 117 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1619 place count 116 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1621 place count 116 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1623 place count 115 transition count 205
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1624 place count 115 transition count 204
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 13 with 68 rules applied. Total rules applied 1692 place count 81 transition count 235
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 13 with 38 rules applied. Total rules applied 1730 place count 81 transition count 197
Discarding 22 places :
Symmetric choice reduction at 14 with 22 rule applications. Total rules 1752 place count 59 transition count 161
Iterating global reduction 14 with 22 rules applied. Total rules applied 1774 place count 59 transition count 161
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 1787 place count 59 transition count 148
Discarding 6 places :
Symmetric choice reduction at 15 with 6 rule applications. Total rules 1793 place count 53 transition count 136
Iterating global reduction 15 with 6 rules applied. Total rules applied 1799 place count 53 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1805 place count 53 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 16 with 11 rules applied. Total rules applied 1816 place count 53 transition count 119
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1817 place count 52 transition count 116
Iterating global reduction 16 with 1 rules applied. Total rules applied 1818 place count 52 transition count 116
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1819 place count 51 transition count 115
Iterating global reduction 16 with 1 rules applied. Total rules applied 1820 place count 51 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1821 place count 51 transition count 114
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 17 with 2 rules applied. Total rules applied 1823 place count 50 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1824 place count 50 transition count 112
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 1827 place count 50 transition count 109
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 1832 place count 47 transition count 107
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 1834 place count 47 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1835 place count 47 transition count 106
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1836 place count 46 transition count 105
Iterating global reduction 18 with 1 rules applied. Total rules applied 1837 place count 46 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1838 place count 45 transition count 104
Applied a total of 1838 rules in 87 ms. Remains 45 /1510 variables (removed 1465) and now considering 104/1933 (removed 1829) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 45/1510 places, 104/1933 transitions.
RANDOM walk for 40000 steps (590 resets) in 152 ms. (261 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
[2024-05-21 05:08:44] [INFO ] Flow matrix only has 96 transitions (discarded 8 similar events)
// Phase 1: matrix 96 rows 45 cols
[2024-05-21 05:08:44] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 05:08:44] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 16/141 variables, and 2 constraints, problems are : Problem set: 3 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, State Equation: 0/45 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p1)), (G (OR p0 (NOT p2) p1)), (G (OR p0 p2 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 26 factoid took 550 ms. Reduced automaton from 5 states, 28 edges and 3 AP (stutter sensitive) to 5 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 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)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 240 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)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Applied a total of 0 rules in 53 ms. Remains 1510 /1510 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2024-05-21 05:08:46] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 05:08:46] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 05:08:46] [INFO ] Invariant cache hit.
[2024-05-21 05:08:47] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-21 05:08:47] [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/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 30033 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
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 30033 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 60614ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60634ms
Finished structural reductions in LTL mode , in 1 iterations and 61879 ms. Remains : 1510/1510 places, 1933/1933 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2110 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.10 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 124 ms. Reduced automaton from 5 states, 25 edges and 3 AP (stutter sensitive) to 5 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 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)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (281 resets) in 471 ms. (84 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40001 steps (75 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (70 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (74 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (79 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (72 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (74 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (75 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (71 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (75 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (77 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (78 resets) in 111 ms. (357 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (75 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
[2024-05-21 05:09:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 694/697 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/697 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 802/1499 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1499 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3422 variables, 1499/1503 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5025ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1837 edges and 1510 vertex of which 675 / 1510 are part of one of the 62 SCC in 8 ms
Free SCC test removed 613 places
Drop transitions (Empty/Sink Transition effects.) removed 772 transitions
Reduce isomorphic transitions removed 772 transitions.
Graph (complete) has 1333 edges and 897 vertex of which 888 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 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 0 with 502 rules applied. Total rules applied 504 place count 888 transition count 655
Reduce places removed 495 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 554 rules applied. Total rules applied 1058 place count 393 transition count 596
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 41 rules applied. Total rules applied 1099 place count 355 transition count 593
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 1104 place count 353 transition count 590
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1107 place count 352 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1108 place count 351 transition count 588
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 1108 place count 351 transition count 537
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 1210 place count 300 transition count 537
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1219 place count 291 transition count 525
Iterating global reduction 6 with 9 rules applied. Total rules applied 1228 place count 291 transition count 525
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 6 with 2 rules applied. Total rules applied 1230 place count 291 transition count 523
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1232 place count 289 transition count 523
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1238 place count 283 transition count 517
Iterating global reduction 8 with 6 rules applied. Total rules applied 1244 place count 283 transition count 517
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1250 place count 283 transition count 511
Performed 151 Post agglomeration using F-continuation condition with reduction of 99 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 9 with 302 rules applied. Total rules applied 1552 place count 132 transition count 261
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 1572 place count 132 transition count 241
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1575 place count 129 transition count 238
Iterating global reduction 10 with 3 rules applied. Total rules applied 1578 place count 129 transition count 238
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1602 place count 117 transition count 224
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1617 place count 117 transition count 209
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 1619 place count 116 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1621 place count 116 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 12 with 2 rules applied. Total rules applied 1623 place count 115 transition count 205
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1624 place count 115 transition count 204
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 13 with 68 rules applied. Total rules applied 1692 place count 81 transition count 235
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 13 with 38 rules applied. Total rules applied 1730 place count 81 transition count 197
Discarding 22 places :
Symmetric choice reduction at 14 with 22 rule applications. Total rules 1752 place count 59 transition count 161
Iterating global reduction 14 with 22 rules applied. Total rules applied 1774 place count 59 transition count 161
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 1787 place count 59 transition count 148
Discarding 6 places :
Symmetric choice reduction at 15 with 6 rule applications. Total rules 1793 place count 53 transition count 136
Iterating global reduction 15 with 6 rules applied. Total rules applied 1799 place count 53 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1805 place count 53 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 16 with 11 rules applied. Total rules applied 1816 place count 53 transition count 119
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1817 place count 52 transition count 116
Iterating global reduction 16 with 1 rules applied. Total rules applied 1818 place count 52 transition count 116
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1819 place count 51 transition count 115
Iterating global reduction 16 with 1 rules applied. Total rules applied 1820 place count 51 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1821 place count 51 transition count 114
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 17 with 2 rules applied. Total rules applied 1823 place count 50 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1824 place count 50 transition count 112
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 1827 place count 50 transition count 109
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 1832 place count 47 transition count 107
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 1834 place count 47 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1835 place count 47 transition count 106
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1836 place count 46 transition count 105
Iterating global reduction 18 with 1 rules applied. Total rules applied 1837 place count 46 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1838 place count 45 transition count 104
Applied a total of 1838 rules in 91 ms. Remains 45 /1510 variables (removed 1465) and now considering 104/1933 (removed 1829) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 45/1510 places, 104/1933 transitions.
RANDOM walk for 40000 steps (586 resets) in 345 ms. (115 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
[2024-05-21 05:09:54] [INFO ] Flow matrix only has 96 transitions (discarded 8 similar events)
// Phase 1: matrix 96 rows 45 cols
[2024-05-21 05:09:54] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 05:09:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 16/141 variables, and 2 constraints, problems are : Problem set: 3 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, State Equation: 0/45 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p1))))), (G (OR p0 p2 p1)), (G (OR p0 (NOT p2) p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 24 factoid took 664 ms. Reduced automaton from 5 states, 25 edges and 3 AP (stutter sensitive) to 5 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 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)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 207 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)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 224 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)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 696 reset in 157 ms.
Product exploration explored 100000 steps with 716 reset in 165 ms.
Applying partial POR strategy [true, true, true, true, false]
Stuttering acceptance computed with spot in 244 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)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Graph (trivial) has 1837 edges and 1510 vertex of which 675 / 1510 are part of one of the 62 SCC in 5 ms
Free SCC test removed 613 places
Ensure Unique test removed 709 transitions
Reduce isomorphic transitions removed 709 transitions.
Graph (complete) has 1395 edges and 897 vertex of which 888 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 483 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 483 rules applied. Total rules applied 485 place count 888 transition count 1219
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 15 rules applied. Total rules applied 500 place count 888 transition count 1205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 2 with 2 rules applied. Total rules applied 502 place count 888 transition count 1204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 503 place count 888 transition count 1203
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 503 place count 888 transition count 1216
Deduced a syphon composed of 506 places in 1 ms
Iterating global reduction 4 with 21 rules applied. Total rules applied 524 place count 888 transition count 1216
Discarding 285 places :
Symmetric choice reduction at 4 with 285 rule applications. Total rules 809 place count 603 transition count 923
Deduced a syphon composed of 235 places in 1 ms
Iterating global reduction 4 with 285 rules applied. Total rules applied 1094 place count 603 transition count 923
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1105 place count 592 transition count 909
Deduced a syphon composed of 233 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1116 place count 592 transition count 909
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1122 place count 592 transition count 903
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1133 place count 581 transition count 892
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 5 with 11 rules applied. Total rules applied 1144 place count 581 transition count 892
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1145 place count 580 transition count 890
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1146 place count 580 transition count 890
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1147 place count 579 transition count 888
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1148 place count 579 transition count 888
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1150 place count 577 transition count 886
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1152 place count 577 transition count 886
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1153 place count 576 transition count 884
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1154 place count 576 transition count 884
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1155 place count 575 transition count 882
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1156 place count 575 transition count 882
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1157 place count 574 transition count 881
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1158 place count 574 transition count 881
Performed 116 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 338 places in 1 ms
Iterating global reduction 5 with 116 rules applied. Total rules applied 1274 place count 574 transition count 958
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 5 with 45 rules applied. Total rules applied 1319 place count 574 transition count 913
Discarding 112 places :
Symmetric choice reduction at 6 with 112 rule applications. Total rules 1431 place count 462 transition count 790
Deduced a syphon composed of 236 places in 0 ms
Iterating global reduction 6 with 112 rules applied. Total rules applied 1543 place count 462 transition count 790
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1549 place count 456 transition count 781
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 1555 place count 456 transition count 781
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 237 places in 1 ms
Iterating global reduction 6 with 7 rules applied. Total rules applied 1562 place count 456 transition count 781
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1570 place count 456 transition count 773
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1586 place count 440 transition count 753
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 1602 place count 440 transition count 753
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1608 place count 440 transition count 747
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1612 place count 436 transition count 743
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1616 place count 436 transition count 743
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1618 place count 436 transition count 743
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1622 place count 436 transition count 739
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1624 place count 434 transition count 737
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1626 place count 434 transition count 737
Performed 75 Post agglomeration using F-continuation condition with reduction of 127 identical transitions.
Deduced a syphon composed of 296 places in 0 ms
Iterating global reduction 9 with 75 rules applied. Total rules applied 1701 place count 434 transition count 1092
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 9 with 128 rules applied. Total rules applied 1829 place count 434 transition count 964
Discarding 130 places :
Symmetric choice reduction at 10 with 130 rule applications. Total rules 1959 place count 304 transition count 611
Deduced a syphon composed of 175 places in 0 ms
Iterating global reduction 10 with 130 rules applied. Total rules applied 2089 place count 304 transition count 611
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 2104 place count 304 transition count 596
Discarding 26 places :
Symmetric choice reduction at 11 with 26 rule applications. Total rules 2130 place count 278 transition count 542
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 11 with 26 rules applied. Total rules applied 2156 place count 278 transition count 542
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2159 place count 278 transition count 592
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2162 place count 275 transition count 564
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2165 place count 275 transition count 564
Deduced a syphon composed of 149 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 11 with 58 rules applied. Total rules applied 2223 place count 275 transition count 506
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 2228 place count 270 transition count 501
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 11 with 5 rules applied. Total rules applied 2233 place count 270 transition count 501
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2236 place count 270 transition count 561
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2239 place count 267 transition count 546
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2242 place count 267 transition count 546
Deduced a syphon composed of 144 places in 0 ms
Applied a total of 2242 rules in 366 ms. Remains 267 /1510 variables (removed 1243) and now considering 546/1933 (removed 1387) transitions.
[2024-05-21 05:09:57] [INFO ] Redundant transitions in 31 ms returned []
Running 545 sub problems to find dead transitions.
[2024-05-21 05:09:57] [INFO ] Flow matrix only has 489 transitions (discarded 57 similar events)
// Phase 1: matrix 489 rows 267 cols
[2024-05-21 05:09:57] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 05:09:57] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 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 TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem 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 TDEAD155 is UNSAT
Problem TDEAD156 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 TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 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 TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 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 TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 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 TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
At refinement iteration 1 (OVERLAPS) 488/754 variables, 266/266 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/754 variables, 4/270 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/754 variables, 0/270 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 1/755 variables, 1/271 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/755 variables, 0/271 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/756 variables, 1/272 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/272 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/756 variables, 0/272 constraints. Problems are: Problem set: 263 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 756/756 variables, and 272 constraints, problems are : Problem set: 263 solved, 282 unsolved in 22088 ms.
Refiners :[State Equation: 267/267 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 263 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 485/607 variables, 122/122 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 4/126 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/607 variables, 282/408 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 0/408 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 148/755 variables, 145/553 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/755 variables, 0/553 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 1/756 variables, 1/554 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 0/554 constraints. Problems are: Problem set: 263 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/756 variables, 0/554 constraints. Problems are: Problem set: 263 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 756/756 variables, and 554 constraints, problems are : Problem set: 263 solved, 282 unsolved in 26205 ms.
Refiners :[State Equation: 267/267 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 282/545 constraints, Known Traps: 0/0 constraints]
After SMT, in 48549ms problems are : Problem set: 263 solved, 282 unsolved
Search for dead transitions found 263 dead transitions in 48556ms
Found 263 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 263 transitions
Dead transitions reduction (with SMT) removed 263 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 267/1510 places, 283/1933 transitions.
Graph (complete) has 432 edges and 267 vertex of which 123 are kept as prefixes of interest. Removing 144 places using SCC suffix rule.0 ms
Discarding 144 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 123 /267 variables (removed 144) and now considering 283/283 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 123/1510 places, 283/1933 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48980 ms. Remains : 123/1510 places, 283/1933 transitions.
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1933/1933 transitions.
Applied a total of 0 rules in 48 ms. Remains 1510 /1510 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2024-05-21 05:10:45] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 05:10:46] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-21 05:10:46] [INFO ] Invariant cache hit.
[2024-05-21 05:10:46] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-21 05:10:46] [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/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 30026 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
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 30035 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 60562ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60582ms
Finished structural reductions in LTL mode , in 1 iterations and 61849 ms. Remains : 1510/1510 places, 1933/1933 transitions.
Treatment of property CloudReconfiguration-PT-312-LTLFireability-00 finished in 257519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F((p0&&X(F(p1))))) U p2))'
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1550 transition count 1987
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1550 transition count 1987
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 1550 transition count 1985
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 1541 transition count 1976
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 1541 transition count 1976
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 1541 transition count 1975
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 51 place count 1535 transition count 1968
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 1535 transition count 1968
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 1535 transition count 1967
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 1530 transition count 1960
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 1530 transition count 1960
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 1526 transition count 1955
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 1526 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 1526 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 79 place count 1524 transition count 1952
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 1524 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 1522 transition count 1950
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 1522 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 87 place count 1520 transition count 1947
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 1520 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 91 place count 1518 transition count 1943
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 1518 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 1517 transition count 1942
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 1517 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 1517 transition count 1941
Applied a total of 96 rules in 480 ms. Remains 1517 /1562 variables (removed 45) and now considering 1941/1999 (removed 58) transitions.
// Phase 1: matrix 1941 rows 1517 cols
[2024-05-21 05:11:48] [INFO ] Computed 4 invariants in 10 ms
[2024-05-21 05:11:48] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-21 05:11:48] [INFO ] Invariant cache hit.
[2024-05-21 05:11:49] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
Running 1940 sub problems to find dead transitions.
[2024-05-21 05:11:49] [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/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3458 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 1940/1940 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 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 1516/3458 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 0/1940 constraints, Known Traps: 0/0 constraints]
After SMT, in 60521ms problems are : Problem set: 0 solved, 1940 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Starting structural reductions in LTL mode, iteration 1 : 1517/1562 places, 1941/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62223 ms. Remains : 1517/1562 places, 1941/1999 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-02
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-02 finished in 62361 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((p0 U p1)) U (X(X(X(p2))) U G(p3))))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1548 transition count 1985
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1548 transition count 1985
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 1548 transition count 1983
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 1538 transition count 1973
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 1538 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 1538 transition count 1972
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 1531 transition count 1964
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 1531 transition count 1964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 1531 transition count 1963
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 72 place count 1525 transition count 1955
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 1525 transition count 1955
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 83 place count 1520 transition count 1949
Iterating global reduction 3 with 5 rules applied. Total rules applied 88 place count 1520 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 1520 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 92 place count 1517 transition count 1945
Iterating global reduction 4 with 3 rules applied. Total rules applied 95 place count 1517 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 98 place count 1514 transition count 1942
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 1514 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 104 place count 1511 transition count 1937
Iterating global reduction 4 with 3 rules applied. Total rules applied 107 place count 1511 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 1508 transition count 1931
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 1508 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 1506 transition count 1929
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 1506 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 118 place count 1506 transition count 1928
Applied a total of 118 rules in 471 ms. Remains 1506 /1562 variables (removed 56) and now considering 1928/1999 (removed 71) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 05:12:50] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 05:12:50] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-21 05:12:50] [INFO ] Invariant cache hit.
[2024-05-21 05:12:51] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 05:12:51] [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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30032 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 60484ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60503ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1562 places, 1928/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62078 ms. Remains : 1506/1562 places, 1928/1999 transitions.
Stuttering acceptance computed with spot in 735 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p3) p2), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-03
Product exploration explored 100000 steps with 16689 reset in 308 ms.
Product exploration explored 100000 steps with 16680 reset in 276 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.12 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X p3), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (OR p1 p0))), (X (AND p3 (NOT p1) (NOT p0))), (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p0)))), (X (NOT (OR (AND p3 p1) (AND p3 p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p3)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (OR p1 p0)))), (X (X (AND p3 (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p0))))), (X (X (NOT (OR (AND p3 p1) (AND p3 p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 143 ms. Reduced automaton from 19 states, 53 edges and 4 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) p2)]
RANDOM walk for 40000 steps (283 resets) in 123 ms. (322 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (75 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
[2024-05-21 05:13:54] [INFO ] Invariant cache hit.
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) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1495 variables, 2/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 1526 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) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1495 variables, 2/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 1371 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 2910ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 142 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X p3), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (OR p1 p0))), (X (AND p3 (NOT p1) (NOT p0))), (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p0)))), (X (NOT (OR (AND p3 p1) (AND p3 p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p3)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (OR p1 p0)))), (X (X (AND p3 (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND (NOT p3) p1) (AND (NOT p3) p0))))), (X (X (NOT (OR (AND p3 p1) (AND p3 p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p3 p2))), (F (NOT (OR (NOT p3) (NOT p2)))), (F p2), (F (NOT (AND p3 (NOT p2)))), (F (NOT (OR p3 (NOT p2)))), (F (NOT p3))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p3 p2)))
Knowledge based reduction with 19 factoid took 144 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-312-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-312-LTLFireability-03 finished in 67128 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)||G(p1))))'
Support contains 2 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Graph (trivial) has 1906 edges and 1562 vertex of which 698 / 1562 are part of one of the 63 SCC in 3 ms
Free SCC test removed 635 places
Ensure Unique test removed 738 transitions
Reduce isomorphic transitions removed 738 transitions.
Graph (complete) has 1435 edges and 927 vertex of which 918 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 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 506 place count 917 transition count 751
Reduce places removed 504 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 528 rules applied. Total rules applied 1034 place count 413 transition count 727
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1046 place count 401 transition count 727
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1046 place count 401 transition count 681
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1138 place count 355 transition count 681
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1155 place count 338 transition count 655
Iterating global reduction 3 with 17 rules applied. Total rules applied 1172 place count 338 transition count 655
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 1175 place count 338 transition count 652
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1177 place count 336 transition count 652
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1190 place count 323 transition count 633
Iterating global reduction 5 with 13 rules applied. Total rules applied 1203 place count 323 transition count 633
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 5 with 8 rules applied. Total rules applied 1211 place count 323 transition count 625
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1212 place count 322 transition count 625
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1214 place count 320 transition count 621
Iterating global reduction 7 with 2 rules applied. Total rules applied 1216 place count 320 transition count 621
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1218 place count 318 transition count 617
Iterating global reduction 7 with 2 rules applied. Total rules applied 1220 place count 318 transition count 617
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1222 place count 316 transition count 613
Iterating global reduction 7 with 2 rules applied. Total rules applied 1224 place count 316 transition count 613
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1226 place count 314 transition count 609
Iterating global reduction 7 with 2 rules applied. Total rules applied 1228 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1230 place count 312 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1232 place count 312 transition count 605
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1233 place count 311 transition count 598
Iterating global reduction 7 with 1 rules applied. Total rules applied 1234 place count 311 transition count 598
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 1534 place count 161 transition count 361
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1547 place count 161 transition count 348
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1552 place count 156 transition count 341
Iterating global reduction 8 with 5 rules applied. Total rules applied 1557 place count 156 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1558 place count 156 transition count 340
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1580 place count 145 transition count 328
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1592 place count 145 transition count 316
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1628 place count 127 transition count 350
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 10 with 19 rules applied. Total rules applied 1647 place count 127 transition count 331
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1656 place count 118 transition count 313
Iterating global reduction 11 with 9 rules applied. Total rules applied 1665 place count 118 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1671 place count 118 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 12 with 37 rules applied. Total rules applied 1708 place count 118 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1709 place count 117 transition count 269
Applied a total of 1709 rules in 87 ms. Remains 117 /1562 variables (removed 1445) and now considering 269/1999 (removed 1730) transitions.
[2024-05-21 05:13:57] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
// Phase 1: matrix 213 rows 117 cols
[2024-05-21 05:13:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:13:57] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-21 05:13:57] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
[2024-05-21 05:13:57] [INFO ] Invariant cache hit.
[2024-05-21 05:13:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 05:13:57] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [11, 79]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 258 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1562 places, 269/1999 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 267
Applied a total of 1 rules in 7 ms. Remains 113 /115 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2024-05-21 05:13:57] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
// Phase 1: matrix 211 rows 113 cols
[2024-05-21 05:13:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:13:57] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 05:13:57] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:13:57] [INFO ] Invariant cache hit.
[2024-05-21 05:13:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:13:57] [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 : 113/1562 places, 267/1999 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 517 ms. Remains : 113/1562 places, 267/1999 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-04
Stuttering criterion allowed to conclude after 233 steps with 22 reset in 2 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-04 finished in 564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1) U p2))))'
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 1549 transition count 1984
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 1540 transition count 1975
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 1540 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 1540 transition count 1974
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 1534 transition count 1967
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 1534 transition count 1967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 1534 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 65 place count 1529 transition count 1959
Iterating global reduction 3 with 5 rules applied. Total rules applied 70 place count 1529 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 74 place count 1525 transition count 1954
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 1525 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 1525 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 1523 transition count 1951
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 1523 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 1521 transition count 1949
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 1521 transition count 1949
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 89 place count 1519 transition count 1945
Iterating global reduction 4 with 2 rules applied. Total rules applied 91 place count 1519 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 93 place count 1517 transition count 1941
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 1517 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 97 place count 1515 transition count 1939
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 1515 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 1515 transition count 1938
Applied a total of 100 rules in 478 ms. Remains 1515 /1562 variables (removed 47) and now considering 1938/1999 (removed 61) transitions.
// Phase 1: matrix 1938 rows 1515 cols
[2024-05-21 05:13:58] [INFO ] Computed 4 invariants in 18 ms
[2024-05-21 05:13:58] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-21 05:13:58] [INFO ] Invariant cache hit.
[2024-05-21 05:13:59] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 05:13:59] [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/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3453 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3453 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60511ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Starting structural reductions in LTL mode, iteration 1 : 1515/1562 places, 1938/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62234 ms. Remains : 1515/1562 places, 1938/1999 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-05 finished in 62429 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(X(G(p0)))))'
Support contains 1 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1548 transition count 1985
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1548 transition count 1985
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 1548 transition count 1983
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 1538 transition count 1973
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 1538 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 1538 transition count 1972
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 1531 transition count 1964
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 1531 transition count 1964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 1531 transition count 1963
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 72 place count 1525 transition count 1955
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 1525 transition count 1955
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 83 place count 1520 transition count 1949
Iterating global reduction 3 with 5 rules applied. Total rules applied 88 place count 1520 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 1520 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 92 place count 1517 transition count 1945
Iterating global reduction 4 with 3 rules applied. Total rules applied 95 place count 1517 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 98 place count 1514 transition count 1942
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 1514 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 104 place count 1511 transition count 1937
Iterating global reduction 4 with 3 rules applied. Total rules applied 107 place count 1511 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 1508 transition count 1931
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 1508 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 1506 transition count 1929
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 1506 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 118 place count 1506 transition count 1928
Applied a total of 118 rules in 448 ms. Remains 1506 /1562 variables (removed 56) and now considering 1928/1999 (removed 71) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 05:15:00] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 05:15:00] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-21 05:15:00] [INFO ] Invariant cache hit.
[2024-05-21 05:15:01] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 05:15:01] [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 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.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 1.0)
(s694 1.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 1.0)
(s712 0.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 1.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 1.0)
(s1095 1.0)
(s1096 0.0)
(s1097 1.0)
(s1098 0.0)
(s1099 0.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 1.0)
(s1109 0.0)
(s1110 0.0)
(s1111 1.0)
(s1112 1.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 1.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30025 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 60489ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60507ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1562 places, 1928/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62086 ms. Remains : 1506/1562 places, 1928/1999 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-06
Product exploration explored 100000 steps with 715 reset in 230 ms.
Product exploration explored 100000 steps with 718 reset in 185 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 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 134 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (279 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (75 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 371449 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 371449 steps, saw 91462 distinct states, run finished after 3004 ms. (steps per millisecond=123 ) properties seen :0
[2024-05-21 05:16:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 416/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 1604 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 416/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 1258 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 2871ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 104 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 94 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 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 43 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2024-05-21 05:16:09] [INFO ] Invariant cache hit.
[2024-05-21 05:16:09] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-21 05:16:09] [INFO ] Invariant cache hit.
[2024-05-21 05:16:10] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 05:16:10] [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 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.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 1.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 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.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 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.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 1.0)
(s694 1.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 1.0)
(s712 0.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 1.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 timeout
0.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30036 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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30030 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 60502ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60526ms
Finished structural reductions in LTL mode , in 1 iterations and 61726 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.10 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 74 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 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (270 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (77 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 391236 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 391236 steps, saw 97223 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
[2024-05-21 05:17:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 416/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 1625 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 416/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 1265 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 2900ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 91 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=91 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 74 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 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 692 reset in 129 ms.
Product exploration explored 100000 steps with 702 reset in 138 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1839 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1367 edges and 876 vertex of which 867 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 472 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 472 rules applied. Total rules applied 474 place count 867 transition count 1191
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 486 place count 867 transition count 1179
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 486 place count 867 transition count 1192
Deduced a syphon composed of 493 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 507 place count 867 transition count 1192
Discarding 280 places :
Symmetric choice reduction at 2 with 280 rule applications. Total rules 787 place count 587 transition count 902
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 280 rules applied. Total rules applied 1067 place count 587 transition count 902
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1079 place count 575 transition count 886
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1091 place count 575 transition count 886
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1097 place count 575 transition count 880
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1109 place count 563 transition count 868
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1121 place count 563 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1123 place count 561 transition count 864
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1125 place count 561 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1127 place count 559 transition count 860
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1129 place count 559 transition count 860
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1133 place count 555 transition count 856
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1137 place count 555 transition count 856
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1139 place count 553 transition count 852
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1141 place count 553 transition count 852
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1143 place count 551 transition count 848
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1145 place count 551 transition count 848
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1149 place count 547 transition count 842
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1153 place count 547 transition count 842
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1157 place count 543 transition count 826
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1161 place count 543 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1162 place count 543 transition count 826
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1166 place count 539 transition count 822
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1170 place count 539 transition count 822
Performed 105 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 315 places in 0 ms
Iterating global reduction 4 with 105 rules applied. Total rules applied 1275 place count 539 transition count 897
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1314 place count 539 transition count 858
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 1414 place count 439 transition count 748
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 100 rules applied. Total rules applied 1514 place count 439 transition count 748
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1520 place count 433 transition count 739
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1526 place count 433 transition count 739
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1533 place count 433 transition count 739
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1537 place count 433 transition count 735
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1552 place count 418 transition count 716
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1567 place count 418 transition count 716
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1573 place count 418 transition count 710
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1577 place count 414 transition count 706
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1581 place count 414 transition count 706
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1584 place count 414 transition count 706
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1590 place count 414 transition count 700
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1593 place count 411 transition count 697
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1596 place count 411 transition count 697
Performed 70 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 281 places in 1 ms
Iterating global reduction 8 with 70 rules applied. Total rules applied 1666 place count 411 transition count 1010
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1787 place count 411 transition count 889
Discarding 125 places :
Symmetric choice reduction at 9 with 125 rule applications. Total rules 1912 place count 286 transition count 560
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 9 with 125 rules applied. Total rules applied 2037 place count 286 transition count 560
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2052 place count 286 transition count 545
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2079 place count 259 transition count 488
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2106 place count 259 transition count 488
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2109 place count 259 transition count 536
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2112 place count 256 transition count 509
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2115 place count 256 transition count 509
Deduced a syphon composed of 138 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 10 with 45 rules applied. Total rules applied 2160 place count 256 transition count 464
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2164 place count 252 transition count 460
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2168 place count 252 transition count 460
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2171 place count 252 transition count 520
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2174 place count 249 transition count 505
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2177 place count 249 transition count 505
Deduced a syphon composed of 134 places in 1 ms
Applied a total of 2177 rules in 261 ms. Remains 249 /1506 variables (removed 1257) and now considering 505/1928 (removed 1423) transitions.
[2024-05-21 05:17:18] [INFO ] Redundant transitions in 9 ms returned []
Running 504 sub problems to find dead transitions.
[2024-05-21 05:17:18] [INFO ] Flow matrix only has 448 transitions (discarded 57 similar events)
// Phase 1: matrix 448 rows 249 cols
[2024-05-21 05:17:18] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 05:17:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 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 TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 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 TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 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 TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 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 TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
At refinement iteration 1 (OVERLAPS) 447/695 variables, 248/248 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/695 variables, 2/250 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 0/250 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/696 variables, 1/251 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/251 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/697 variables, 1/252 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 0/252 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/697 variables, 0/252 constraints. Problems are: Problem set: 241 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 697/697 variables, and 252 constraints, problems are : Problem set: 241 solved, 263 unsolved in 18822 ms.
Refiners :[State Equation: 249/249 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 241 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 444/558 variables, 114/114 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 2/116 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/558 variables, 263/379 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/379 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 138/696 variables, 135/514 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/696 variables, 0/514 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/697 variables, 1/515 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/697 variables, 0/515 constraints. Problems are: Problem set: 241 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/697 variables, 0/515 constraints. Problems are: Problem set: 241 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 697/697 variables, and 515 constraints, problems are : Problem set: 241 solved, 263 unsolved in 25136 ms.
Refiners :[State Equation: 249/249 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 263/504 constraints, Known Traps: 0/0 constraints]
After SMT, in 44167ms problems are : Problem set: 241 solved, 263 unsolved
Search for dead transitions found 241 dead transitions in 44172ms
Found 241 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 241 transitions
Dead transitions reduction (with SMT) removed 241 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 249/1506 places, 264/1928 transitions.
Graph (complete) has 412 edges and 249 vertex of which 115 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.1 ms
Discarding 134 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 115 /249 variables (removed 134) and now considering 264/264 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1506 places, 264/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44481 ms. Remains : 115/1506 places, 264/1928 transitions.
Support contains 1 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 40 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 05:18:03] [INFO ] Computed 4 invariants in 20 ms
[2024-05-21 05:18:03] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-21 05:18:03] [INFO ] Invariant cache hit.
[2024-05-21 05:18:04] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 05:18:04] [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/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 30029 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 30032 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 60508ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Finished structural reductions in LTL mode , in 1 iterations and 61731 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Treatment of property CloudReconfiguration-PT-312-LTLFireability-06 finished in 244562 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||((p1&&(p2 U (p3||G(p2)))) U (G((p1&&(p2 U (p3||G(p2)))))||(p1&&(p2 U (p3||G(p2)))&&G(p4))))))))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1550 transition count 1987
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1550 transition count 1987
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 1550 transition count 1985
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 34 place count 1542 transition count 1977
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 1542 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 1542 transition count 1976
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 49 place count 1536 transition count 1969
Iterating global reduction 2 with 6 rules applied. Total rules applied 55 place count 1536 transition count 1969
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 1530 transition count 1961
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 1530 transition count 1961
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 1525 transition count 1955
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 1525 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 1525 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 1522 transition count 1951
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 1522 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 1519 transition count 1948
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 1519 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 1516 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 1516 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 1513 transition count 1937
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 1511 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 1511 transition count 1934
Applied a total of 107 rules in 466 ms. Remains 1511 /1562 variables (removed 51) and now considering 1934/1999 (removed 65) transitions.
// Phase 1: matrix 1934 rows 1511 cols
[2024-05-21 05:19:05] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 05:19:05] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-21 05:19:05] [INFO ] Invariant cache hit.
[2024-05-21 05:19:06] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2024-05-21 05:19:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3445 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 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 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 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 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 1)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 1)
(s293 0)
(s294 0)
(s295 1)
(s296 1)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 1)
(s314 1)
(s315 0)
(s316 1)
(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 1)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 timeout
0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3445 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints]
After SMT, in 60518ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60535ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1562 places, 1934/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62231 ms. Remains : 1511/1562 places, 1934/1999 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p3) (NOT p2)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3) (NOT p4)) (AND p0 (NOT p1) (NOT p4))), (NOT p4)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-08
Product exploration explored 100000 steps with 703 reset in 189 ms.
Product exploration explored 100000 steps with 687 reset in 174 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2111 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2 (NOT p4)), (X p2), (X p3), (X (NOT p4)), (X (NOT (OR (AND (NOT p0) p1 p4 p3) (AND (NOT p0) p1 p4 p2)))), (X (NOT (AND (NOT p0) p1 p4 (NOT p3) p2))), (X (OR p0 (AND p1 p3) (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p1 (NOT p4) p3) (AND (NOT p0) p1 (NOT p4) p2)))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (OR (AND (NOT p0) p1 p4 p3) (AND (NOT p0) p1 p4 p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 (NOT p4) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p4 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p4) p3) (AND (NOT p0) p1 (NOT p4) p2))))), (X (X (NOT (OR (AND (NOT p1) p4) (AND p4 (NOT p3) (NOT p2)))))), (X (X (NOT (AND p0 p1 p4 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 p1 p4 p3) (AND p0 p1 p4 p2))))), (X (X (OR p0 (AND p1 p3) (AND p1 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (OR (AND p0 p1 (NOT p4) p3) (AND p0 p1 (NOT p4) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 177 ms. Reduced automaton from 7 states, 19 edges and 5 AP (stutter sensitive) to 6 states, 18 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p3) (NOT p2)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3) (NOT p4)) (AND p0 (NOT p1) (NOT p4))), (NOT p4)]
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (273 resets) in 1099 ms. (36 steps per ms) remains 12/17 properties
BEST_FIRST walk for 40003 steps (74 resets) in 286 ms. (139 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (76 resets) in 594 ms. (67 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (76 resets) in 418 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (75 resets) in 713 ms. (56 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (76 resets) in 437 ms. (91 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (70 resets) in 318 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (80 resets) in 311 ms. (128 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (75 resets) in 292 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (74 resets) in 294 ms. (135 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (76 resets) in 284 ms. (140 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (77 resets) in 297 ms. (134 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (79 resets) in 246 ms. (161 steps per ms) remains 12/12 properties
[2024-05-21 05:20:09] [INFO ] Invariant cache hit.
Problem apf11 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1496/1500 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1924/3424 variables, 1500/1504 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3436/3445 variables, and 1510 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1511 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1496/1500 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1924/3424 variables, 1500/1504 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3424 variables, 11/1515 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3424 variables, 0/1515 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/3426 variables, 1/1516 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3426 variables, 0/1516 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2/3428 variables, 1/1517 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3428 variables, 0/1517 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 2/3430 variables, 1/1518 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3430 variables, 0/1518 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 2/3432 variables, 1/1519 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3432 variables, 0/1519 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 2/3434 variables, 1/1520 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3434 variables, 0/1520 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 2/3436 variables, 1/1521 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3436 variables, 0/1521 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 2/3438 variables, 1/1522 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3438/3445 variables, and 1522 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1511 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 10048ms problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1511/1511 places, 1934/1934 transitions.
Graph (trivial) has 1837 edges and 1511 vertex of which 678 / 1511 are part of one of the 63 SCC in 2 ms
Free SCC test removed 615 places
Drop transitions (Empty/Sink Transition effects.) removed 776 transitions
Reduce isomorphic transitions removed 776 transitions.
Graph (complete) has 1330 edges and 896 vertex of which 887 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 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 887 transition count 655
Reduce places removed 492 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 546 rules applied. Total rules applied 1047 place count 395 transition count 601
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 36 rules applied. Total rules applied 1083 place count 360 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1084 place count 359 transition count 600
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 1084 place count 359 transition count 548
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 1188 place count 307 transition count 548
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1199 place count 296 transition count 532
Iterating global reduction 4 with 11 rules applied. Total rules applied 1210 place count 296 transition count 532
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 1213 place count 296 transition count 529
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1216 place count 293 transition count 529
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1223 place count 286 transition count 521
Iterating global reduction 6 with 7 rules applied. Total rules applied 1230 place count 286 transition count 521
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1236 place count 286 transition count 515
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1237 place count 285 transition count 509
Iterating global reduction 7 with 1 rules applied. Total rules applied 1238 place count 285 transition count 509
Performed 150 Post agglomeration using F-continuation condition with reduction of 95 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 1538 place count 135 transition count 264
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1556 place count 135 transition count 246
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1559 place count 132 transition count 243
Iterating global reduction 8 with 3 rules applied. Total rules applied 1562 place count 132 transition count 243
Performed 14 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 1590 place count 118 transition count 226
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1605 place count 118 transition count 211
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 1607 place count 117 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1609 place count 117 transition count 208
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 1611 place count 116 transition count 207
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1613 place count 116 transition count 205
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 1681 place count 82 transition count 242
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 11 with 47 rules applied. Total rules applied 1728 place count 82 transition count 195
Discarding 23 places :
Symmetric choice reduction at 12 with 23 rule applications. Total rules 1751 place count 59 transition count 164
Iterating global reduction 12 with 23 rules applied. Total rules applied 1774 place count 59 transition count 164
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1787 place count 59 transition count 151
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1792 place count 54 transition count 141
Iterating global reduction 13 with 5 rules applied. Total rules applied 1797 place count 54 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1802 place count 54 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 14 with 20 rules applied. Total rules applied 1822 place count 54 transition count 116
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1824 place count 52 transition count 110
Iterating global reduction 14 with 2 rules applied. Total rules applied 1826 place count 52 transition count 110
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1828 place count 50 transition count 108
Iterating global reduction 14 with 2 rules applied. Total rules applied 1830 place count 50 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1832 place count 50 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1834 place count 50 transition count 104
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1837 place count 50 transition count 101
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 1841 place count 47 transition count 100
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 1843 place count 47 transition count 100
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 1844 place count 47 transition count 99
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1845 place count 46 transition count 98
Iterating global reduction 16 with 1 rules applied. Total rules applied 1846 place count 46 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1847 place count 45 transition count 97
Applied a total of 1847 rules in 73 ms. Remains 45 /1511 variables (removed 1466) and now considering 97/1934 (removed 1837) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 45/1511 places, 97/1934 transitions.
RANDOM walk for 19040 steps (308 resets) in 162 ms. (116 steps per ms) remains 0/11 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 p2 (NOT p4)), (X p2), (X p3), (X (NOT p4)), (X (NOT (OR (AND (NOT p0) p1 p4 p3) (AND (NOT p0) p1 p4 p2)))), (X (NOT (AND (NOT p0) p1 p4 (NOT p3) p2))), (X (OR p0 (AND p1 p3) (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p1 (NOT p4) p3) (AND (NOT p0) p1 (NOT p4) p2)))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (OR (AND (NOT p0) p1 p4 p3) (AND (NOT p0) p1 p4 p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p4)) (AND p0 (NOT p4) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p4 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p4) p3) (AND (NOT p0) p1 (NOT p4) p2))))), (X (X (NOT (OR (AND (NOT p1) p4) (AND p4 (NOT p3) (NOT p2)))))), (X (X (NOT (AND p0 p1 p4 (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 p1 p4 p3) (AND p0 p1 p4 p2))))), (X (X (OR p0 (AND p1 p3) (AND p1 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (OR (AND p0 p1 (NOT p4) p3) (AND p0 p1 (NOT p4) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p1) p3 (NOT p2) (NOT p0) (NOT p4)))]
False Knowledge obtained : [(F (NOT (OR p3 p2))), (F (NOT (AND (OR (NOT p1) (NOT p3) p0 p4) (OR (NOT p1) (NOT p2) p0 p4)))), (F (NOT (OR (AND p1 p3 p0 (NOT p4)) (AND p1 p2 p0 (NOT p4))))), (F (NOT (AND (OR p1 (NOT p4)) (OR p3 p2 (NOT p4))))), (F (NOT (AND (OR (NOT p1) (NOT p3) (NOT p0) (NOT p4)) (OR (NOT p1) (NOT p2) (NOT p0) (NOT p4))))), (F (NOT (OR p3 (NOT p2)))), (F p4), (F (NOT (AND (OR p1 (NOT p0)) (OR p3 p2 (NOT p0))))), (F (NOT (OR (AND p1 p3) (AND p1 p2) p0))), (F (NOT (AND (OR (NOT p1) (NOT p3) p0 (NOT p4)) (OR (NOT p1) (NOT p2) p0 (NOT p4))))), (F (NOT (AND (OR p1 (NOT p0) p4) (OR p3 p2 (NOT p0) p4)))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR (NOT p1) p3 (NOT p2) p0 (NOT p4)))), (F (NOT p0)), (F (NOT p3)), (F (NOT (AND (OR p1 p0) (OR p3 p2 p0))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (AND p1 p3) (AND p1 p2) p0)))
Knowledge based reduction with 30 factoid took 616 ms. Reduced automaton from 6 states, 18 edges and 5 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-312-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-312-LTLFireability-08 finished in 76045 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 U X(X(X(X(p0)))))))))'
Support contains 1 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1549 transition count 1985
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 1539 transition count 1975
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 1539 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1539 transition count 1974
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 1532 transition count 1966
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 1532 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 1532 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 69 place count 1526 transition count 1957
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 1526 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 80 place count 1521 transition count 1951
Iterating global reduction 3 with 5 rules applied. Total rules applied 85 place count 1521 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 1521 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 89 place count 1518 transition count 1947
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 1518 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 95 place count 1515 transition count 1944
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 1515 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 1512 transition count 1939
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 1512 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 107 place count 1509 transition count 1933
Iterating global reduction 4 with 3 rules applied. Total rules applied 110 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 1507 transition count 1931
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 1507 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 1507 transition count 1930
Applied a total of 115 rules in 467 ms. Remains 1507 /1562 variables (removed 55) and now considering 1930/1999 (removed 69) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 05:20:21] [INFO ] Computed 4 invariants in 21 ms
[2024-05-21 05:20:21] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-21 05:20:21] [INFO ] Invariant cache hit.
[2024-05-21 05:20:22] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 05:20:22] [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, 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 30032 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 30045 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 60520ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60537ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1562 places, 1930/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62228 ms. Remains : 1507/1562 places, 1930/1999 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-09
Product exploration explored 100000 steps with 709 reset in 129 ms.
Product exploration explored 100000 steps with 710 reset in 129 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (281 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (73 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 394880 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 394880 steps, saw 98286 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2024-05-21 05:21:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 417/418 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3418 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3420 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3420 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3422 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3437/3437 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1541 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 417/418 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3418 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3418 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3420 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3422 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3437/3437 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1209 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2758ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 593 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=197 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 358 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 45 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2024-05-21 05:21:30] [INFO ] Invariant cache hit.
[2024-05-21 05:21:30] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-21 05:21:30] [INFO ] Invariant cache hit.
[2024-05-21 05:21:31] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 05:21:31] [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
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/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30027 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 60486ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60504ms
Finished structural reductions in LTL mode , in 1 iterations and 61659 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (284 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (76 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 393799 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 393799 steps, saw 97847 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2024-05-21 05:22:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 417/418 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3418 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3420 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3420 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3422 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3437/3437 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1617 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 417/418 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3418 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3418 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3420 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3422 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3437/3437 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1226 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2857ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1505 steps, including 9 resets, run visited all 1 properties in 6 ms. (steps per millisecond=250 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 707 reset in 134 ms.
Product exploration explored 100000 steps with 709 reset in 129 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 1507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Graph (trivial) has 1841 edges and 1507 vertex of which 693 / 1507 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1369 edges and 877 vertex of which 868 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 474 rules applied. Total rules applied 476 place count 868 transition count 1193
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 488 place count 868 transition count 1181
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 488 place count 868 transition count 1194
Deduced a syphon composed of 495 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 509 place count 868 transition count 1194
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 792 place count 585 transition count 901
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1075 place count 585 transition count 901
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1087 place count 573 transition count 885
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1099 place count 573 transition count 885
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1105 place count 573 transition count 879
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1117 place count 561 transition count 867
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1129 place count 561 transition count 867
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1131 place count 559 transition count 863
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 559 transition count 863
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1135 place count 557 transition count 859
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 557 transition count 859
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1141 place count 553 transition count 855
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1145 place count 553 transition count 855
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1147 place count 551 transition count 851
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1149 place count 551 transition count 851
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 549 transition count 847
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 549 transition count 847
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1157 place count 545 transition count 841
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1161 place count 545 transition count 841
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 541 transition count 825
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 541 transition count 825
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1170 place count 541 transition count 825
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1174 place count 537 transition count 821
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1178 place count 537 transition count 821
Performed 105 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 314 places in 0 ms
Iterating global reduction 4 with 105 rules applied. Total rules applied 1283 place count 537 transition count 896
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1322 place count 537 transition count 857
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 1422 place count 437 transition count 747
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 100 rules applied. Total rules applied 1522 place count 437 transition count 747
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1528 place count 431 transition count 738
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1534 place count 431 transition count 738
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 225 places in 1 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1541 place count 431 transition count 738
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1545 place count 431 transition count 734
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1560 place count 416 transition count 715
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1575 place count 416 transition count 715
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1581 place count 416 transition count 709
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1585 place count 412 transition count 705
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1589 place count 412 transition count 705
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1592 place count 412 transition count 705
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1598 place count 412 transition count 699
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1601 place count 409 transition count 696
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1604 place count 409 transition count 696
Performed 70 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 8 with 70 rules applied. Total rules applied 1674 place count 409 transition count 1009
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1795 place count 409 transition count 888
Discarding 125 places :
Symmetric choice reduction at 9 with 125 rule applications. Total rules 1920 place count 284 transition count 559
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 9 with 125 rules applied. Total rules applied 2045 place count 284 transition count 559
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2060 place count 284 transition count 544
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2087 place count 257 transition count 487
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2114 place count 257 transition count 487
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2117 place count 257 transition count 535
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2120 place count 254 transition count 508
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2123 place count 254 transition count 508
Deduced a syphon composed of 137 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 10 with 45 rules applied. Total rules applied 2168 place count 254 transition count 463
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2172 place count 250 transition count 459
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2176 place count 250 transition count 459
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2179 place count 250 transition count 519
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2182 place count 247 transition count 504
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2185 place count 247 transition count 504
Deduced a syphon composed of 133 places in 0 ms
Applied a total of 2185 rules in 163 ms. Remains 247 /1507 variables (removed 1260) and now considering 504/1930 (removed 1426) transitions.
[2024-05-21 05:22:40] [INFO ] Redundant transitions in 3 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-21 05:22:40] [INFO ] Flow matrix only has 447 transitions (discarded 57 similar events)
// Phase 1: matrix 447 rows 247 cols
[2024-05-21 05:22:40] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:22:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 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 TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 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 TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 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 TDEAD373 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 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 TDEAD404 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
At refinement iteration 1 (OVERLAPS) 446/692 variables, 246/246 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/692 variables, 2/248 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/692 variables, 0/248 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/693 variables, 1/249 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 0/249 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 1/694 variables, 1/250 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/694 variables, 0/250 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/694 variables, 0/250 constraints. Problems are: Problem set: 240 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 694/694 variables, and 250 constraints, problems are : Problem set: 240 solved, 263 unsolved in 18022 ms.
Refiners :[State Equation: 247/247 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 240 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 443/556 variables, 113/113 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 2/115 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/556 variables, 263/378 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 0/378 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 137/693 variables, 134/512 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 0/512 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/694 variables, 1/513 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/694 variables, 0/513 constraints. Problems are: Problem set: 240 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/694 variables, 0/513 constraints. Problems are: Problem set: 240 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 694/694 variables, and 513 constraints, problems are : Problem set: 240 solved, 263 unsolved in 25891 ms.
Refiners :[State Equation: 247/247 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 263/503 constraints, Known Traps: 0/0 constraints]
After SMT, in 44125ms problems are : Problem set: 240 solved, 263 unsolved
Search for dead transitions found 240 dead transitions in 44129ms
Found 240 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 240 transitions
Dead transitions reduction (with SMT) removed 240 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 247/1507 places, 264/1930 transitions.
Graph (complete) has 412 edges and 247 vertex of which 114 are kept as prefixes of interest. Removing 133 places using SCC suffix rule.0 ms
Discarding 133 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 114 /247 variables (removed 133) and now considering 264/264 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1507 places, 264/1930 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44305 ms. Remains : 114/1507 places, 264/1930 transitions.
Support contains 1 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 39 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 05:23:24] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 05:23:24] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 05:23:24] [INFO ] Invariant cache hit.
[2024-05-21 05:23:25] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 05:23:25] [INFO ] Invariant cache hit.
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 30036 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
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 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 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 1)
(s202 1)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 1)
(s208 1)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 1)
(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 1)
(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 1)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(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 1)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 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 0)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 0)
(s699 0)
(s700 1)
(s701 1)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 1)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 1)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30035 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 60514ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60533ms
Finished structural reductions in LTL mode , in 1 iterations and 61687 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Treatment of property CloudReconfiguration-PT-312-LTLFireability-09 finished in 245248 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 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 1549 transition count 1984
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 1539 transition count 1974
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 1539 transition count 1974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 1539 transition count 1973
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 1532 transition count 1965
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 1532 transition count 1965
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1532 transition count 1964
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 1526 transition count 1956
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 1526 transition count 1956
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 81 place count 1521 transition count 1950
Iterating global reduction 3 with 5 rules applied. Total rules applied 86 place count 1521 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 1521 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 90 place count 1518 transition count 1946
Iterating global reduction 4 with 3 rules applied. Total rules applied 93 place count 1518 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 96 place count 1515 transition count 1943
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 1515 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 102 place count 1512 transition count 1938
Iterating global reduction 4 with 3 rules applied. Total rules applied 105 place count 1512 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 108 place count 1509 transition count 1932
Iterating global reduction 4 with 3 rules applied. Total rules applied 111 place count 1509 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 1507 transition count 1930
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 1507 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 1507 transition count 1929
Applied a total of 116 rules in 458 ms. Remains 1507 /1562 variables (removed 55) and now considering 1929/1999 (removed 70) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 05:24:26] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 05:24:26] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-21 05:24:26] [INFO ] Invariant cache hit.
[2024-05-21 05:24:27] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 05:24:27] [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 30029 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 30025 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 60483ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60502ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1562 places, 1929/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62086 ms. Remains : 1507/1562 places, 1929/1999 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-10
Product exploration explored 100000 steps with 2414 reset in 142 ms.
Stack based approach found an accepted trace after 62698 steps with 1503 reset with depth 61 and stack size 61 in 92 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-10 finished in 62461 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((p0||F(p1))))'
Support contains 2 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Graph (trivial) has 1906 edges and 1562 vertex of which 692 / 1562 are part of one of the 62 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1440 edges and 932 vertex of which 923 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 507 transitions
Trivial Post-agglo rules discarded 507 transitions
Performed 507 trivial Post agglomeration. Transition count delta: 507
Iterating post reduction 0 with 507 rules applied. Total rules applied 509 place count 922 transition count 753
Reduce places removed 507 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 531 rules applied. Total rules applied 1040 place count 415 transition count 729
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 1053 place count 403 transition count 728
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1054 place count 402 transition count 728
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1054 place count 402 transition count 681
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 1148 place count 355 transition count 681
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1165 place count 338 transition count 655
Iterating global reduction 4 with 17 rules applied. Total rules applied 1182 place count 338 transition count 655
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1185 place count 338 transition count 652
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1187 place count 336 transition count 652
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1200 place count 323 transition count 633
Iterating global reduction 6 with 13 rules applied. Total rules applied 1213 place count 323 transition count 633
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 6 with 8 rules applied. Total rules applied 1221 place count 323 transition count 625
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1222 place count 322 transition count 625
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1224 place count 320 transition count 621
Iterating global reduction 8 with 2 rules applied. Total rules applied 1226 place count 320 transition count 621
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1228 place count 318 transition count 617
Iterating global reduction 8 with 2 rules applied. Total rules applied 1230 place count 318 transition count 617
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1232 place count 316 transition count 613
Iterating global reduction 8 with 2 rules applied. Total rules applied 1234 place count 316 transition count 613
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1236 place count 314 transition count 609
Iterating global reduction 8 with 2 rules applied. Total rules applied 1238 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1240 place count 312 transition count 605
Iterating global reduction 8 with 2 rules applied. Total rules applied 1242 place count 312 transition count 605
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1243 place count 311 transition count 598
Iterating global reduction 8 with 1 rules applied. Total rules applied 1244 place count 311 transition count 598
Performed 151 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 8 with 302 rules applied. Total rules applied 1546 place count 160 transition count 360
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1560 place count 160 transition count 346
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1566 place count 154 transition count 334
Iterating global reduction 9 with 6 rules applied. Total rules applied 1572 place count 154 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1573 place count 154 transition count 333
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1597 place count 142 transition count 320
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1610 place count 142 transition count 307
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 11 with 34 rules applied. Total rules applied 1644 place count 125 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1661 place count 125 transition count 324
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1670 place count 116 transition count 306
Iterating global reduction 12 with 9 rules applied. Total rules applied 1679 place count 116 transition count 306
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1684 place count 116 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 13 with 31 rules applied. Total rules applied 1715 place count 116 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1716 place count 115 transition count 269
Applied a total of 1716 rules in 71 ms. Remains 115 /1562 variables (removed 1447) and now considering 269/1999 (removed 1730) transitions.
[2024-05-21 05:25:28] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
// Phase 1: matrix 213 rows 115 cols
[2024-05-21 05:25:28] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:25:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 05:25:28] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
[2024-05-21 05:25:28] [INFO ] Invariant cache hit.
[2024-05-21 05:25:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:25:28] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [8, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 179 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/1562 places, 269/1999 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 267
Applied a total of 1 rules in 4 ms. Remains 111 /113 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2024-05-21 05:25:28] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
// Phase 1: matrix 211 rows 111 cols
[2024-05-21 05:25:28] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:25:28] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 05:25:28] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:25:28] [INFO ] Invariant cache hit.
[2024-05-21 05:25:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 05:25:28] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1562 places, 267/1999 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 391 ms. Remains : 111/1562 places, 267/1999 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-11
Product exploration explored 100000 steps with 8576 reset in 162 ms.
Product exploration explored 100000 steps with 8681 reset in 175 ms.
Computed a total of 3 stabilizing places and 24 stable transitions
Computed a total of 3 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (4270 resets) in 519 ms. (76 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (711 resets) in 106 ms. (373 steps per ms) remains 1/2 properties
[2024-05-21 05:25:29] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:25:29] [INFO ] Invariant cache hit.
[2024-05-21 05:25:29] [INFO ] State equation strengthened by 2 read => feed constraints.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/55 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/199 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 117/316 variables, 72/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/321 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/321 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/322 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 2/2 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/55 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 144/199 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 117/316 variables, 72/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/321 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/321 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/322 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 179ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 05:25:30] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:25:30] [INFO ] Invariant cache hit.
[2024-05-21 05:25:30] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 05:25:30] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:25:30] [INFO ] Invariant cache hit.
[2024-05-21 05:25:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 05:25:30] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-21 05:25:30] [INFO ] Redundant transitions in 34 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 05:25:30] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:25:30] [INFO ] Invariant cache hit.
[2024-05-21 05:25:30] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 210/318 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 3/321 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/322 variables, and 113 constraints, problems are : Problem set: 0 solved, 256 unsolved in 6325 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 210/318 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 188/298 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 3/321 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 68/369 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/322 variables, and 369 constraints, problems are : Problem set: 0 solved, 256 unsolved in 9157 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 15595ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 15597ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15774 ms. Remains : 111/111 places, 267/267 transitions.
Computed a total of 3 stabilizing places and 24 stable transitions
Computed a total of 3 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (4278 resets) in 352 ms. (113 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (703 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2024-05-21 05:25:46] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:25:46] [INFO ] Invariant cache hit.
[2024-05-21 05:25:46] [INFO ] State equation strengthened by 2 read => feed constraints.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/55 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/199 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 117/316 variables, 72/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/321 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/321 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/322 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 75 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 2/2 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/55 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 144/199 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 117/316 variables, 72/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/321 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/321 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/322 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 187ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 8676 reset in 132 ms.
Product exploration explored 100000 steps with 8642 reset in 139 ms.
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-21 05:25:47] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:25:47] [INFO ] Invariant cache hit.
[2024-05-21 05:25:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 05:25:47] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:25:47] [INFO ] Invariant cache hit.
[2024-05-21 05:25:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 05:25:47] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-21 05:25:47] [INFO ] Redundant transitions in 52 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-21 05:25:47] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2024-05-21 05:25:47] [INFO ] Invariant cache hit.
[2024-05-21 05:25:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 210/318 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 3/321 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/322 variables, and 113 constraints, problems are : Problem set: 0 solved, 256 unsolved in 6296 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 210/318 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 188/298 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 3/321 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 68/369 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/322 variables, and 369 constraints, problems are : Problem set: 0 solved, 256 unsolved in 9622 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 16056ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 16059ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16271 ms. Remains : 111/111 places, 267/267 transitions.
Treatment of property CloudReconfiguration-PT-312-LTLFireability-11 finished in 34857 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 U p1)||G(p2))))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 1549 transition count 1984
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 1540 transition count 1975
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 1540 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 1540 transition count 1974
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 54 place count 1533 transition count 1966
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 1533 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 1533 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 68 place count 1527 transition count 1957
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 1527 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 79 place count 1522 transition count 1951
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 1522 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 1522 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 88 place count 1519 transition count 1947
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 1519 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 94 place count 1516 transition count 1944
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 1516 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 100 place count 1513 transition count 1939
Iterating global reduction 4 with 3 rules applied. Total rules applied 103 place count 1513 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 106 place count 1510 transition count 1933
Iterating global reduction 4 with 3 rules applied. Total rules applied 109 place count 1510 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 111 place count 1508 transition count 1931
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 1508 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 1508 transition count 1930
Applied a total of 114 rules in 472 ms. Remains 1508 /1562 variables (removed 54) and now considering 1930/1999 (removed 69) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-21 05:26:03] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 05:26:04] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-21 05:26:04] [INFO ] Invariant cache hit.
[2024-05-21 05:26:05] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 05:26:05] [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 30040 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
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 30041 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 60509ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60529ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1562 places, 1930/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62255 ms. Remains : 1508/1562 places, 1930/1999 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-13 finished in 62458 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((X(p0) U (p1||G(F(!p2)))))))'
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1549 transition count 1986
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1549 transition count 1986
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1549 transition count 1985
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 1539 transition count 1975
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 1539 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1539 transition count 1974
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 1532 transition count 1966
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 1532 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 1532 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 69 place count 1526 transition count 1957
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 1526 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 80 place count 1521 transition count 1951
Iterating global reduction 3 with 5 rules applied. Total rules applied 85 place count 1521 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 1521 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 89 place count 1518 transition count 1947
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 1518 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 95 place count 1515 transition count 1944
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 1515 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 1512 transition count 1939
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 1512 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 107 place count 1509 transition count 1933
Iterating global reduction 4 with 3 rules applied. Total rules applied 110 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 1507 transition count 1931
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 1507 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 1507 transition count 1930
Applied a total of 115 rules in 481 ms. Remains 1507 /1562 variables (removed 55) and now considering 1930/1999 (removed 69) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 05:27:06] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 05:27:06] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-21 05:27:06] [INFO ] Invariant cache hit.
[2024-05-21 05:27:07] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 05:27:07] [INFO ] Invariant cache hit.
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 30034 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
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/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30029 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 60504ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60521ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1562 places, 1930/1999 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62185 ms. Remains : 1507/1562 places, 1930/1999 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-14
Product exploration explored 100000 steps with 695 reset in 134 ms.
Product exploration explored 100000 steps with 699 reset in 141 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 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 (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 130 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (282 resets) in 647 ms. (61 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (42 resets) in 101 ms. (392 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (44 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-05-21 05:28:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1092/1095 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1095 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 401/1496 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3418 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3420 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3420 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3422 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3437/3437 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1521 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1092/1095 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1095 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 401/1496 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3418 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3418 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3420 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3422 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3437/3437 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1823 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3365ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 389 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=194 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) p1))), (F p2), (F p0), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 11 factoid took 284 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 4 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 43 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2024-05-21 05:28:12] [INFO ] Invariant cache hit.
[2024-05-21 05:28:13] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-21 05:28:13] [INFO ] Invariant cache hit.
[2024-05-21 05:28:14] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 05:28:14] [INFO ] Invariant cache hit.
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 30032 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 30030 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 60486ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60501ms
Finished structural reductions in LTL mode , in 1 iterations and 61684 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 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 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 118 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (274 resets) in 308 ms. (129 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (41 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2024-05-21 05:29:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1092/1095 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1095 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 401/1496 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3418 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3420 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3420 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3422 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3437/3437 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1578 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1092/1095 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1095 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 401/1496 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3418 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3418 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3420 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3422 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3437/3437 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1873 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3478ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 389 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=194 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) p1))), (F p2), (F p0), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 11 factoid took 267 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 704 reset in 133 ms.
Product exploration explored 100000 steps with 692 reset in 136 ms.
Support contains 4 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 43 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2024-05-21 05:29:19] [INFO ] Invariant cache hit.
[2024-05-21 05:29:19] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 05:29:19] [INFO ] Invariant cache hit.
[2024-05-21 05:29:20] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 05:29:20] [INFO ] Invariant cache hit.
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 30029 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 30031 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 60494ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60510ms
Finished structural reductions in LTL mode , in 1 iterations and 61700 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Treatment of property CloudReconfiguration-PT-312-LTLFireability-14 finished in 195376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Graph (trivial) has 1908 edges and 1562 vertex of which 698 / 1562 are part of one of the 63 SCC in 1 ms
Free SCC test removed 635 places
Ensure Unique test removed 738 transitions
Reduce isomorphic transitions removed 738 transitions.
Graph (complete) has 1435 edges and 927 vertex of which 918 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 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 506 rules applied. Total rules applied 508 place count 917 transition count 749
Reduce places removed 506 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 530 rules applied. Total rules applied 1038 place count 411 transition count 725
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1050 place count 399 transition count 725
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1050 place count 399 transition count 679
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 1142 place count 353 transition count 679
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1159 place count 336 transition count 653
Iterating global reduction 3 with 17 rules applied. Total rules applied 1176 place count 336 transition count 653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 1179 place count 336 transition count 650
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1181 place count 334 transition count 650
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1194 place count 321 transition count 631
Iterating global reduction 5 with 13 rules applied. Total rules applied 1207 place count 321 transition count 631
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 5 with 8 rules applied. Total rules applied 1215 place count 321 transition count 623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1216 place count 320 transition count 623
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1218 place count 318 transition count 619
Iterating global reduction 7 with 2 rules applied. Total rules applied 1220 place count 318 transition count 619
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1222 place count 316 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 1224 place count 316 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1226 place count 314 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1228 place count 314 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1230 place count 312 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1232 place count 312 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1234 place count 310 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1236 place count 310 transition count 603
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1237 place count 309 transition count 596
Iterating global reduction 7 with 1 rules applied. Total rules applied 1238 place count 309 transition count 596
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 1538 place count 159 transition count 359
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1552 place count 159 transition count 345
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1558 place count 153 transition count 333
Iterating global reduction 8 with 6 rules applied. Total rules applied 1564 place count 153 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1565 place count 153 transition count 332
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1589 place count 141 transition count 319
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1602 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 10 with 34 rules applied. Total rules applied 1636 place count 124 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 1653 place count 124 transition count 323
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1662 place count 115 transition count 305
Iterating global reduction 11 with 9 rules applied. Total rules applied 1671 place count 115 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1677 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 12 with 36 rules applied. Total rules applied 1713 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1714 place count 114 transition count 262
Applied a total of 1714 rules in 74 ms. Remains 114 /1562 variables (removed 1448) and now considering 262/1999 (removed 1737) transitions.
[2024-05-21 05:30:21] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 114 cols
[2024-05-21 05:30:21] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 05:30:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 05:30:21] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2024-05-21 05:30:21] [INFO ] Invariant cache hit.
[2024-05-21 05:30:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 05:30:21] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [8, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 152 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1562 places, 262/1999 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 260
Applied a total of 1 rules in 6 ms. Remains 110 /112 variables (removed 2) and now considering 260/262 (removed 2) transitions.
[2024-05-21 05:30:21] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 110 cols
[2024-05-21 05:30:21] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 05:30:21] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 05:30:21] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-21 05:30:21] [INFO ] Invariant cache hit.
[2024-05-21 05:30:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 05:30:21] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1562 places, 260/1999 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 363 ms. Remains : 110/1562 places, 260/1999 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-15
Stuttering criterion allowed to conclude after 2180 steps with 185 reset in 5 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-312-LTLFireability-15 finished in 453 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)||(p1 U (G(p1)||(p1&&(p0 U (G(p0)||(p0&&G(p2)))))))))))'
Found a Shortening insensitive property : CloudReconfiguration-PT-312-LTLFireability-00
Stuttering acceptance computed with spot in 267 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)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Graph (trivial) has 1901 edges and 1562 vertex of which 680 / 1562 are part of one of the 62 SCC in 1 ms
Free SCC test removed 618 places
Ensure Unique test removed 715 transitions
Reduce isomorphic transitions removed 715 transitions.
Graph (complete) has 1458 edges and 944 vertex of which 935 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 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 514 transitions
Trivial Post-agglo rules discarded 514 transitions
Performed 514 trivial Post agglomeration. Transition count delta: 514
Iterating post reduction 0 with 514 rules applied. Total rules applied 516 place count 934 transition count 764
Reduce places removed 514 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 540 rules applied. Total rules applied 1056 place count 420 transition count 738
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 1072 place count 407 transition count 735
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 1077 place count 405 transition count 732
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1080 place count 404 transition count 730
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1081 place count 403 transition count 730
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 47 Pre rules applied. Total rules applied 1081 place count 403 transition count 683
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 1175 place count 356 transition count 683
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1191 place count 340 transition count 659
Iterating global reduction 6 with 16 rules applied. Total rules applied 1207 place count 340 transition count 659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 3 rules applied. Total rules applied 1210 place count 340 transition count 656
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1212 place count 338 transition count 656
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1224 place count 326 transition count 639
Iterating global reduction 8 with 12 rules applied. Total rules applied 1236 place count 326 transition count 639
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 1244 place count 326 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1245 place count 325 transition count 631
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1246 place count 324 transition count 629
Iterating global reduction 10 with 1 rules applied. Total rules applied 1247 place count 324 transition count 629
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1248 place count 323 transition count 627
Iterating global reduction 10 with 1 rules applied. Total rules applied 1249 place count 323 transition count 627
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1250 place count 322 transition count 625
Iterating global reduction 10 with 1 rules applied. Total rules applied 1251 place count 322 transition count 625
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1252 place count 321 transition count 623
Iterating global reduction 10 with 1 rules applied. Total rules applied 1253 place count 321 transition count 623
Performed 153 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 10 with 306 rules applied. Total rules applied 1559 place count 168 transition count 383
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 1576 place count 168 transition count 366
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1581 place count 163 transition count 359
Iterating global reduction 11 with 5 rules applied. Total rules applied 1586 place count 163 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1587 place count 163 transition count 358
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 12 with 22 rules applied. Total rules applied 1609 place count 152 transition count 346
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1622 place count 152 transition count 333
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1623 place count 151 transition count 331
Iterating global reduction 13 with 1 rules applied. Total rules applied 1624 place count 151 transition count 331
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 38 rules applied. Total rules applied 1662 place count 132 transition count 372
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 13 with 25 rules applied. Total rules applied 1687 place count 132 transition count 347
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1696 place count 123 transition count 329
Iterating global reduction 14 with 9 rules applied. Total rules applied 1705 place count 123 transition count 329
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1711 place count 123 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1712 place count 122 transition count 322
Applied a total of 1712 rules in 80 ms. Remains 122 /1562 variables (removed 1440) and now considering 322/1999 (removed 1677) transitions.
[2024-05-21 05:30:22] [INFO ] Flow matrix only has 265 transitions (discarded 57 similar events)
// Phase 1: matrix 265 rows 122 cols
[2024-05-21 05:30:22] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:30:22] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 05:30:22] [INFO ] Flow matrix only has 265 transitions (discarded 57 similar events)
[2024-05-21 05:30:22] [INFO ] Invariant cache hit.
[2024-05-21 05:30:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 05:30:22] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [16, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 178 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 120/1562 places, 322/1999 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 118 transition count 320
Applied a total of 1 rules in 6 ms. Remains 118 /120 variables (removed 2) and now considering 320/322 (removed 2) transitions.
[2024-05-21 05:30:22] [INFO ] Flow matrix only has 263 transitions (discarded 57 similar events)
// Phase 1: matrix 263 rows 118 cols
[2024-05-21 05:30:22] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:30:22] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 05:30:22] [INFO ] Flow matrix only has 263 transitions (discarded 57 similar events)
[2024-05-21 05:30:22] [INFO ] Invariant cache hit.
[2024-05-21 05:30:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 05:30:22] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 118/1562 places, 320/1999 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 411 ms. Remains : 118/1562 places, 320/1999 transitions.
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-00
Product exploration explored 100000 steps with 8655 reset in 205 ms.
Product exploration explored 100000 steps with 8706 reset in 259 ms.
Computed a total of 3 stabilizing places and 26 stable transitions
Computed a total of 3 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 104 ms. Reduced automaton from 5 states, 28 edges and 3 AP (stutter sensitive) to 5 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 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)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4221 resets) in 814 ms. (49 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40004 steps (649 resets) in 31 ms. (1250 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (339 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (130 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (429 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
[2024-05-21 05:30:23] [INFO ] Flow matrix only has 263 transitions (discarded 57 similar events)
[2024-05-21 05:30:23] [INFO ] Invariant cache hit.
[2024-05-21 05:30:23] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/24 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 141/165 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 375/381 variables, and 114 constraints, problems are : Problem set: 3 solved, 0 unsolved in 80 ms.
Refiners :[State Equation: 113/118 constraints, ReadFeed: 1/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p1)), (G (OR p0 (NOT p2) p1)), (G (OR p0 p2 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 26 factoid took 525 ms. Reduced automaton from 5 states, 28 edges and 3 AP (stutter sensitive) to 5 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 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)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 200 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)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 320/320 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-05-21 05:30:24] [INFO ] Flow matrix only has 263 transitions (discarded 57 similar events)
[2024-05-21 05:30:24] [INFO ] Invariant cache hit.
[2024-05-21 05:30:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 05:30:24] [INFO ] Flow matrix only has 263 transitions (discarded 57 similar events)
[2024-05-21 05:30:24] [INFO ] Invariant cache hit.
[2024-05-21 05:30:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 05:30:24] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-05-21 05:30:24] [INFO ] Flow matrix only has 263 transitions (discarded 57 similar events)
[2024-05-21 05:30:24] [INFO ] Invariant cache hit.
[2024-05-21 05:30:24] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 262/377 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 3/380 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 0/380 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/381 variables, and 125 constraints, problems are : Problem set: 0 solved, 309 unsolved in 8578 ms.
Refiners :[State Equation: 118/118 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 262/377 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 232/354 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 3/380 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 77/434 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/380 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/381 variables, and 434 constraints, problems are : Problem set: 0 solved, 309 unsolved in 12080 ms.
Refiners :[State Equation: 118/118 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
After SMT, in 20794ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 20797ms
Finished structural reductions in LTL mode , in 1 iterations and 20937 ms. Remains : 118/118 places, 320/320 transitions.
Computed a total of 3 stabilizing places and 26 stable transitions
Computed a total of 3 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 134 ms. Reduced automaton from 5 states, 25 edges and 3 AP (stutter sensitive) to 5 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 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)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4218 resets) in 490 ms. (81 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40004 steps (308 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (109 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (234 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
[2024-05-21 05:30:46] [INFO ] Flow matrix only has 263 transitions (discarded 57 similar events)
[2024-05-21 05:30:46] [INFO ] Invariant cache hit.
[2024-05-21 05:30:46] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/24 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 141/165 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 375/381 variables, and 114 constraints, problems are : Problem set: 3 solved, 0 unsolved in 89 ms.
Refiners :[State Equation: 113/118 constraints, ReadFeed: 1/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p1))))), (G (OR p0 p2 p1)), (G (OR p0 (NOT p2) p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 24 factoid took 661 ms. Reduced automaton from 5 states, 25 edges and 3 AP (stutter sensitive) to 5 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 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)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 209 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)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 215 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)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8707 reset in 189 ms.
Product exploration explored 100000 steps with 8732 reset in 202 ms.
Applying partial POR strategy [true, true, true, true, false]
Stuttering acceptance computed with spot in 176 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)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 320/320 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 118 transition count 278
Applied a total of 42 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 278/320 (removed 42) transitions.
[2024-05-21 05:30:48] [INFO ] Redundant transitions in 191 ms returned []
Running 267 sub problems to find dead transitions.
[2024-05-21 05:30:48] [INFO ] Flow matrix only has 221 transitions (discarded 57 similar events)
// Phase 1: matrix 221 rows 118 cols
[2024-05-21 05:30:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 05:30:48] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 220/335 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 3/338 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 0/338 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/339 variables, and 122 constraints, problems are : Problem set: 0 solved, 267 unsolved in 6952 ms.
Refiners :[State Equation: 118/118 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 220/335 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 195/314 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 3/338 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 72/389 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/339 variables, and 389 constraints, problems are : Problem set: 0 solved, 267 unsolved in 9928 ms.
Refiners :[State Equation: 118/118 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints]
After SMT, in 17000ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 17003ms
Starting structural reductions in SI_LTL mode, iteration 1 : 118/118 places, 278/320 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17213 ms. Remains : 118/118 places, 278/320 transitions.
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 320/320 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-05-21 05:31:05] [INFO ] Flow matrix only has 263 transitions (discarded 57 similar events)
// Phase 1: matrix 263 rows 118 cols
[2024-05-21 05:31:05] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:31:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 05:31:05] [INFO ] Flow matrix only has 263 transitions (discarded 57 similar events)
[2024-05-21 05:31:05] [INFO ] Invariant cache hit.
[2024-05-21 05:31:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 05:31:05] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-05-21 05:31:05] [INFO ] Flow matrix only has 263 transitions (discarded 57 similar events)
[2024-05-21 05:31:05] [INFO ] Invariant cache hit.
[2024-05-21 05:31:05] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 262/377 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 3/380 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 0/380 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/381 variables, and 125 constraints, problems are : Problem set: 0 solved, 309 unsolved in 8682 ms.
Refiners :[State Equation: 118/118 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 262/377 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 7/122 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 232/354 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 3/380 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 77/434 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/380 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/381 variables, and 434 constraints, problems are : Problem set: 0 solved, 309 unsolved in 11995 ms.
Refiners :[State Equation: 118/118 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
After SMT, in 20814ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 20817ms
Finished structural reductions in LTL mode , in 1 iterations and 20964 ms. Remains : 118/118 places, 320/320 transitions.
Treatment of property CloudReconfiguration-PT-312-LTLFireability-00 finished in 64942 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(X(G(p0)))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-312-LTLFireability-06
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Graph (trivial) has 1908 edges and 1562 vertex of which 698 / 1562 are part of one of the 63 SCC in 1 ms
Free SCC test removed 635 places
Ensure Unique test removed 738 transitions
Reduce isomorphic transitions removed 738 transitions.
Graph (complete) has 1435 edges and 927 vertex of which 918 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 505 transitions
Trivial Post-agglo rules discarded 505 transitions
Performed 505 trivial Post agglomeration. Transition count delta: 505
Iterating post reduction 0 with 505 rules applied. Total rules applied 507 place count 917 transition count 750
Reduce places removed 505 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 529 rules applied. Total rules applied 1036 place count 412 transition count 726
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1049 place count 400 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1050 place count 399 transition count 725
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1050 place count 399 transition count 679
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 1142 place count 353 transition count 679
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1159 place count 336 transition count 653
Iterating global reduction 4 with 17 rules applied. Total rules applied 1176 place count 336 transition count 653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1179 place count 336 transition count 650
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1181 place count 334 transition count 650
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1194 place count 321 transition count 631
Iterating global reduction 6 with 13 rules applied. Total rules applied 1207 place count 321 transition count 631
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 6 with 8 rules applied. Total rules applied 1215 place count 321 transition count 623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1216 place count 320 transition count 623
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1218 place count 318 transition count 619
Iterating global reduction 8 with 2 rules applied. Total rules applied 1220 place count 318 transition count 619
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1222 place count 316 transition count 615
Iterating global reduction 8 with 2 rules applied. Total rules applied 1224 place count 316 transition count 615
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1226 place count 314 transition count 611
Iterating global reduction 8 with 2 rules applied. Total rules applied 1228 place count 314 transition count 611
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1230 place count 312 transition count 607
Iterating global reduction 8 with 2 rules applied. Total rules applied 1232 place count 312 transition count 607
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1234 place count 310 transition count 603
Iterating global reduction 8 with 2 rules applied. Total rules applied 1236 place count 310 transition count 603
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1237 place count 309 transition count 596
Iterating global reduction 8 with 1 rules applied. Total rules applied 1238 place count 309 transition count 596
Performed 150 Post agglomeration using F-continuation condition with reduction of 88 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 8 with 300 rules applied. Total rules applied 1538 place count 159 transition count 358
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1552 place count 159 transition count 344
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1558 place count 153 transition count 332
Iterating global reduction 9 with 6 rules applied. Total rules applied 1564 place count 153 transition count 332
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1565 place count 153 transition count 331
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1589 place count 141 transition count 318
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1602 place count 141 transition count 305
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1636 place count 124 transition count 339
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1653 place count 124 transition count 322
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1662 place count 115 transition count 304
Iterating global reduction 12 with 9 rules applied. Total rules applied 1671 place count 115 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1677 place count 115 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1678 place count 114 transition count 297
Applied a total of 1678 rules in 67 ms. Remains 114 /1562 variables (removed 1448) and now considering 297/1999 (removed 1702) transitions.
[2024-05-21 05:31:26] [INFO ] Flow matrix only has 240 transitions (discarded 57 similar events)
// Phase 1: matrix 240 rows 114 cols
[2024-05-21 05:31:26] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 05:31:26] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 05:31:26] [INFO ] Flow matrix only has 240 transitions (discarded 57 similar events)
[2024-05-21 05:31:26] [INFO ] Invariant cache hit.
[2024-05-21 05:31:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 05:31:27] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [8, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 183 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 112/1562 places, 297/1999 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 295
Applied a total of 1 rules in 4 ms. Remains 110 /112 variables (removed 2) and now considering 295/297 (removed 2) transitions.
[2024-05-21 05:31:27] [INFO ] Flow matrix only has 238 transitions (discarded 57 similar events)
// Phase 1: matrix 238 rows 110 cols
[2024-05-21 05:31:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 05:31:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 05:31:27] [INFO ] Flow matrix only has 238 transitions (discarded 57 similar events)
[2024-05-21 05:31:27] [INFO ] Invariant cache hit.
[2024-05-21 05:31:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 05:31:27] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 110/1562 places, 295/1999 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 393 ms. Remains : 110/1562 places, 295/1999 transitions.
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-06
Entered a terminal (fully accepting) state of product in 181 steps with 14 reset in 1 ms.
Treatment of property CloudReconfiguration-PT-312-LTLFireability-06 finished in 653 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-06 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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 U X(X(X(X(p0)))))))))'
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((p0||F(p1))))'
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((X(p0) U (p1||G(F(!p2)))))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-312-LTLFireability-14
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1562/1562 places, 1999/1999 transitions.
Graph (trivial) has 1901 edges and 1562 vertex of which 694 / 1562 are part of one of the 63 SCC in 2 ms
Free SCC test removed 631 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1440 edges and 931 vertex of which 922 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 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 921 transition count 757
Reduce places removed 503 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 525 rules applied. Total rules applied 1030 place count 418 transition count 735
Reduce places removed 11 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 15 rules applied. Total rules applied 1045 place count 407 transition count 731
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1049 place count 403 transition count 731
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1049 place count 403 transition count 684
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1143 place count 356 transition count 684
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1159 place count 340 transition count 659
Iterating global reduction 4 with 16 rules applied. Total rules applied 1175 place count 340 transition count 659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1178 place count 340 transition count 656
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1180 place count 338 transition count 656
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1192 place count 326 transition count 638
Iterating global reduction 6 with 12 rules applied. Total rules applied 1204 place count 326 transition count 638
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 6 with 7 rules applied. Total rules applied 1211 place count 326 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1212 place count 325 transition count 631
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1214 place count 323 transition count 627
Iterating global reduction 8 with 2 rules applied. Total rules applied 1216 place count 323 transition count 627
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1218 place count 321 transition count 623
Iterating global reduction 8 with 2 rules applied. Total rules applied 1220 place count 321 transition count 623
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1222 place count 319 transition count 619
Iterating global reduction 8 with 2 rules applied. Total rules applied 1224 place count 319 transition count 619
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1226 place count 317 transition count 615
Iterating global reduction 8 with 2 rules applied. Total rules applied 1228 place count 317 transition count 615
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1230 place count 315 transition count 611
Iterating global reduction 8 with 2 rules applied. Total rules applied 1232 place count 315 transition count 611
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1233 place count 314 transition count 604
Iterating global reduction 8 with 1 rules applied. Total rules applied 1234 place count 314 transition count 604
Performed 151 Post agglomeration using F-continuation condition with reduction of 88 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 8 with 302 rules applied. Total rules applied 1536 place count 163 transition count 365
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1549 place count 163 transition count 352
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1554 place count 158 transition count 345
Iterating global reduction 9 with 5 rules applied. Total rules applied 1559 place count 158 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1560 place count 158 transition count 344
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1582 place count 147 transition count 332
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1594 place count 147 transition count 320
Performed 19 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 38 rules applied. Total rules applied 1632 place count 128 transition count 354
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1651 place count 128 transition count 335
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1660 place count 119 transition count 317
Iterating global reduction 12 with 9 rules applied. Total rules applied 1669 place count 119 transition count 317
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1675 place count 119 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1676 place count 118 transition count 310
Applied a total of 1676 rules in 63 ms. Remains 118 /1562 variables (removed 1444) and now considering 310/1999 (removed 1689) transitions.
[2024-05-21 05:31:27] [INFO ] Flow matrix only has 254 transitions (discarded 56 similar events)
// Phase 1: matrix 254 rows 118 cols
[2024-05-21 05:31:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:31:27] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 05:31:27] [INFO ] Flow matrix only has 254 transitions (discarded 56 similar events)
[2024-05-21 05:31:27] [INFO ] Invariant cache hit.
[2024-05-21 05:31:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 05:31:27] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [11, 79]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 165 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 116/1562 places, 310/1999 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 308
Applied a total of 1 rules in 8 ms. Remains 114 /116 variables (removed 2) and now considering 308/310 (removed 2) transitions.
[2024-05-21 05:31:27] [INFO ] Flow matrix only has 252 transitions (discarded 56 similar events)
// Phase 1: matrix 252 rows 114 cols
[2024-05-21 05:31:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 05:31:28] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 05:31:28] [INFO ] Flow matrix only has 252 transitions (discarded 56 similar events)
[2024-05-21 05:31:28] [INFO ] Invariant cache hit.
[2024-05-21 05:31:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 05:31:28] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 114/1562 places, 308/1999 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 369 ms. Remains : 114/1562 places, 308/1999 transitions.
Running random walk in product with property : CloudReconfiguration-PT-312-LTLFireability-14
Stuttering criterion allowed to conclude after 3458 steps with 260 reset in 6 ms.
Treatment of property CloudReconfiguration-PT-312-LTLFireability-14 finished in 598 ms.
FORMULA CloudReconfiguration-PT-312-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-21 05:31:28] [INFO ] Flatten gal took : 65 ms
[2024-05-21 05:31:28] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-21 05:31:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1562 places, 1999 transitions and 4173 arcs took 12 ms.
Total runtime 1515926 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudReconfiguration-PT-312

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1562
TRANSITIONS: 1999
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.004s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2868
MODEL NAME: /home/mcc/execution/411/model
1562 places, 1999 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudReconfiguration-PT-312-LTLFireability-00 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-312-LTLFireability-06 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-312-LTLFireability-09 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-312-LTLFireability-11 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-312-LTLFireability-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716270457417

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory