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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 19:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 11 19:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 19:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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 661K 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-317-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-317-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716273160037

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-317
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 06:32:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 06:32:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 06:32:41] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-05-21 06:32:41] [INFO ] Transformed 2587 places.
[2024-05-21 06:32:41] [INFO ] Transformed 3099 transitions.
[2024-05-21 06:32:41] [INFO ] Found NUPN structural information;
[2024-05-21 06:32:41] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 289 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 3 formulas.
FORMULA CloudReconfiguration-PT-317-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-317-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-317-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 2587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Discarding 516 places :
Symmetric choice reduction at 0 with 516 rule applications. Total rules 516 place count 2071 transition count 2583
Iterating global reduction 0 with 516 rules applied. Total rules applied 1032 place count 2071 transition count 2583
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1060 place count 2071 transition count 2555
Discarding 235 places :
Symmetric choice reduction at 1 with 235 rule applications. Total rules 1295 place count 1836 transition count 2320
Iterating global reduction 1 with 235 rules applied. Total rules applied 1530 place count 1836 transition count 2320
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 1618 place count 1748 transition count 2232
Iterating global reduction 1 with 88 rules applied. Total rules applied 1706 place count 1748 transition count 2232
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 1721 place count 1748 transition count 2217
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1770 place count 1699 transition count 2168
Iterating global reduction 2 with 49 rules applied. Total rules applied 1819 place count 1699 transition count 2168
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1828 place count 1699 transition count 2159
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1867 place count 1660 transition count 2115
Iterating global reduction 3 with 39 rules applied. Total rules applied 1906 place count 1660 transition count 2115
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1934 place count 1632 transition count 2087
Iterating global reduction 3 with 28 rules applied. Total rules applied 1962 place count 1632 transition count 2087
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1988 place count 1606 transition count 2061
Iterating global reduction 3 with 26 rules applied. Total rules applied 2014 place count 1606 transition count 2061
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2040 place count 1580 transition count 2035
Iterating global reduction 3 with 26 rules applied. Total rules applied 2066 place count 1580 transition count 2035
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 2089 place count 1557 transition count 1997
Iterating global reduction 3 with 23 rules applied. Total rules applied 2112 place count 1557 transition count 1997
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2119 place count 1550 transition count 1984
Iterating global reduction 3 with 7 rules applied. Total rules applied 2126 place count 1550 transition count 1984
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2133 place count 1543 transition count 1974
Iterating global reduction 3 with 7 rules applied. Total rules applied 2140 place count 1543 transition count 1974
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2143 place count 1543 transition count 1971
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2146 place count 1540 transition count 1968
Iterating global reduction 4 with 3 rules applied. Total rules applied 2149 place count 1540 transition count 1968
Applied a total of 2149 rules in 1646 ms. Remains 1540 /2587 variables (removed 1047) and now considering 1968/3099 (removed 1131) transitions.
// Phase 1: matrix 1968 rows 1540 cols
[2024-05-21 06:32:43] [INFO ] Computed 4 invariants in 33 ms
[2024-05-21 06:32:44] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-21 06:32:44] [INFO ] Invariant cache hit.
[2024-05-21 06:32:45] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
Running 1967 sub problems to find dead transitions.
[2024-05-21 06:32:45] [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 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.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 1.0)
(s46 1.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 1.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 1.0)
(s131 1.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1539 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1539/3508 variables, and 4 constraints, problems are : Problem set: 0 solved, 1967 unsolved in 30078 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1540 constraints, PredecessorRefiner: 1967/1967 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1967 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1539 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1539/3508 variables, and 4 constraints, problems are : Problem set: 0 solved, 1967 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1540 constraints, PredecessorRefiner: 0/1967 constraints, Known Traps: 0/0 constraints]
After SMT, in 60846ms problems are : Problem set: 0 solved, 1967 unsolved
Search for dead transitions found 0 dead transitions in 60887ms
Starting structural reductions in LTL mode, iteration 1 : 1540/2587 places, 1968/3099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64414 ms. Remains : 1540/2587 places, 1968/3099 transitions.
Support contains 25 out of 1540 places after structural reductions.
[2024-05-21 06:33:46] [INFO ] Flatten gal took : 131 ms
[2024-05-21 06:33:46] [INFO ] Flatten gal took : 76 ms
[2024-05-21 06:33:46] [INFO ] Input system was already deterministic with 1968 transitions.
RANDOM walk for 40000 steps (420 resets) in 2149 ms. (18 steps per ms) remains 18/24 properties
BEST_FIRST walk for 4003 steps (19 resets) in 94 ms. (42 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (18 resets) in 100 ms. (39 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (11 resets) in 114 ms. (34 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 63 ms. (62 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 67 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (20 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (12 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (15 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (16 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (11 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
[2024-05-21 06:33:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1511/1529 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1529 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1958/3487 variables, 1529/1533 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3487 variables, 0/1533 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/3489 variables, 1/1534 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3489 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/3491 variables, 1/1535 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3491 variables, 0/1535 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 2/3493 variables, 1/1536 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3493 variables, 0/1536 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 2/3495 variables, 1/1537 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3495 variables, 0/1537 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 2/3497 variables, 1/1538 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3497/3508 variables, and 1538 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1534/1540 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1511/1529 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1529 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1958/3487 variables, 1529/1533 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3487 variables, 18/1551 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3487 variables, 0/1551 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 2/3489 variables, 1/1552 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3489 variables, 0/1552 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 2/3491 variables, 1/1553 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3491 variables, 0/1553 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 2/3493 variables, 1/1554 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3493 variables, 0/1554 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 2/3495 variables, 1/1555 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3495 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SMT process timed out in 10052ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 1540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1840 edges and 1540 vertex of which 648 / 1540 are part of one of the 61 SCC in 12 ms
Free SCC test removed 587 places
Drop transitions (Empty/Sink Transition effects.) removed 740 transitions
Reduce isomorphic transitions removed 740 transitions.
Graph (complete) has 1411 edges and 953 vertex of which 944 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 520 rules applied. Total rules applied 522 place count 944 transition count 704
Reduce places removed 513 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 567 rules applied. Total rules applied 1089 place count 431 transition count 650
Reduce places removed 35 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 38 rules applied. Total rules applied 1127 place count 396 transition count 647
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1130 place count 393 transition count 647
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1130 place count 393 transition count 597
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1230 place count 343 transition count 597
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1235 place count 338 transition count 590
Iterating global reduction 4 with 5 rules applied. Total rules applied 1240 place count 338 transition count 590
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1241 place count 338 transition count 589
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1242 place count 337 transition count 589
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1245 place count 334 transition count 586
Iterating global reduction 6 with 3 rules applied. Total rules applied 1248 place count 334 transition count 586
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1251 place count 334 transition count 583
Performed 162 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 162 places in 0 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 7 with 324 rules applied. Total rules applied 1575 place count 172 transition count 329
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 1598 place count 172 transition count 306
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1601 place count 169 transition count 303
Iterating global reduction 8 with 3 rules applied. Total rules applied 1604 place count 169 transition count 303
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1605 place count 168 transition count 302
Iterating global reduction 8 with 1 rules applied. Total rules applied 1606 place count 168 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1607 place count 168 transition count 301
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 1625 place count 159 transition count 291
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1638 place count 159 transition count 278
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 10 with 2 rules applied. Total rules applied 1640 place count 158 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1642 place count 158 transition count 275
Performed 39 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 11 with 78 rules applied. Total rules applied 1720 place count 119 transition count 318
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 11 with 31 rules applied. Total rules applied 1751 place count 119 transition count 287
Discarding 19 places :
Symmetric choice reduction at 12 with 19 rule applications. Total rules 1770 place count 100 transition count 249
Iterating global reduction 12 with 19 rules applied. Total rules applied 1789 place count 100 transition count 249
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 1797 place count 100 transition count 241
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 1800 place count 97 transition count 235
Iterating global reduction 13 with 3 rules applied. Total rules applied 1803 place count 97 transition count 235
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1806 place count 97 transition count 232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 1808 place count 96 transition count 251
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 14 with 11 rules applied. Total rules applied 1819 place count 96 transition count 240
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 1825 place count 96 transition count 234
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 1832 place count 90 transition count 233
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 90 transition count 231
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 1838 place count 90 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1839 place count 90 transition count 230
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1840 place count 90 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1841 place count 89 transition count 229
Applied a total of 1841 rules in 238 ms. Remains 89 /1540 variables (removed 1451) and now considering 229/1968 (removed 1739) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 89/1540 places, 229/1968 transitions.
RANDOM walk for 40000 steps (366 resets) in 2117 ms. (18 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40003 steps (85 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2024-05-21 06:33:58] [INFO ] Flow matrix only has 215 transitions (discarded 14 similar events)
// Phase 1: matrix 215 rows 89 cols
[2024-05-21 06:33:58] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 06:33:58] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 27/304 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/89 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 36ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA CloudReconfiguration-PT-317-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2153 edges and 1540 vertex of which 1531 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.29 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(p0) U p1))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1871 edges and 1540 vertex of which 689 / 1540 are part of one of the 62 SCC in 4 ms
Free SCC test removed 627 places
Ensure Unique test removed 729 transitions
Reduce isomorphic transitions removed 729 transitions.
Graph (complete) has 1420 edges and 913 vertex of which 904 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 498 transitions
Trivial Post-agglo rules discarded 498 transitions
Performed 498 trivial Post agglomeration. Transition count delta: 498
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 903 transition count 735
Reduce places removed 498 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 521 rules applied. Total rules applied 1021 place count 405 transition count 712
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 1034 place count 394 transition count 710
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1036 place count 392 transition count 710
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1036 place count 392 transition count 662
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1132 place count 344 transition count 662
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1145 place count 331 transition count 642
Iterating global reduction 4 with 13 rules applied. Total rules applied 1158 place count 331 transition count 642
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1159 place count 331 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1160 place count 330 transition count 641
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1160 place count 330 transition count 640
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1162 place count 329 transition count 640
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1172 place count 319 transition count 626
Iterating global reduction 6 with 10 rules applied. Total rules applied 1182 place count 319 transition count 626
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1186 place count 319 transition count 622
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1188 place count 317 transition count 618
Iterating global reduction 7 with 2 rules applied. Total rules applied 1190 place count 317 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1192 place count 315 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1194 place count 315 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1196 place count 313 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1198 place count 313 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1200 place count 311 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1202 place count 311 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1204 place count 309 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1206 place count 309 transition count 602
Performed 143 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 1492 place count 166 transition count 376
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1506 place count 166 transition count 362
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1512 place count 160 transition count 354
Iterating global reduction 8 with 6 rules applied. Total rules applied 1518 place count 160 transition count 354
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1521 place count 157 transition count 347
Iterating global reduction 8 with 3 rules applied. Total rules applied 1524 place count 157 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1526 place count 157 transition count 345
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1548 place count 146 transition count 332
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1561 place count 146 transition count 319
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1597 place count 128 transition count 365
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 1615 place count 128 transition count 347
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1624 place count 119 transition count 329
Iterating global reduction 11 with 9 rules applied. Total rules applied 1633 place count 119 transition count 329
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1639 place count 119 transition count 323
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 1676 place count 119 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1677 place count 118 transition count 285
Applied a total of 1677 rules in 135 ms. Remains 118 /1540 variables (removed 1422) and now considering 285/1968 (removed 1683) transitions.
[2024-05-21 06:33:59] [INFO ] Flow matrix only has 227 transitions (discarded 58 similar events)
// Phase 1: matrix 227 rows 118 cols
[2024-05-21 06:33:59] [INFO ] Computed 0 invariants in 4 ms
[2024-05-21 06:33:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 06:33:59] [INFO ] Flow matrix only has 227 transitions (discarded 58 similar events)
[2024-05-21 06:33:59] [INFO ] Invariant cache hit.
[2024-05-21 06:33:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 06:33:59] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 196 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1540 places, 285/1968 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 284
Applied a total of 2 rules in 7 ms. Remains 116 /117 variables (removed 1) and now considering 284/285 (removed 1) transitions.
[2024-05-21 06:33:59] [INFO ] Flow matrix only has 226 transitions (discarded 58 similar events)
// Phase 1: matrix 226 rows 116 cols
[2024-05-21 06:33:59] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:33:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 06:33:59] [INFO ] Flow matrix only has 226 transitions (discarded 58 similar events)
[2024-05-21 06:33:59] [INFO ] Invariant cache hit.
[2024-05-21 06:33:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 06:33:59] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1540 places, 284/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 507 ms. Remains : 116/1540 places, 284/1968 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-317-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLFireability-00 finished in 887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&F(p1))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1524 transition count 1952
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1524 transition count 1952
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 1524 transition count 1949
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 1518 transition count 1943
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 1518 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1516 transition count 1941
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1516 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1515 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1509 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1508 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1508 transition count 1932
Applied a total of 68 rules in 654 ms. Remains 1508 /1540 variables (removed 32) and now considering 1932/1968 (removed 36) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2024-05-21 06:34:00] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 06:34:00] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 06:34:00] [INFO ] Invariant cache hit.
[2024-05-21 06:34:01] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-21 06:34:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 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 1)
(s236 1)
(s237 0)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 0)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 1)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(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 1)
(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 1)
(s694 1)
(s695 1)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 1)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 1)
(s707 1)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 1)
(s713 1)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 1)
(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 1)
(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 timeout
0)
(s822 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60657ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60688ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1540 places, 1932/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62434 ms. Remains : 1508/1540 places, 1932/1968 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 384 ms.
Product exploration explored 100000 steps with 33333 reset in 322 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2115 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 30 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-317-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-317-LTLFireability-01 finished in 63431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p0)&&F(p1))))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1526 transition count 1954
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1526 transition count 1954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 1526 transition count 1951
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 1521 transition count 1946
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 1521 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1519 transition count 1944
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1519 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 1519 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1518 transition count 1942
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1518 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1517 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1517 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1516 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1515 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1935
Applied a total of 62 rules in 615 ms. Remains 1511 /1540 variables (removed 29) and now considering 1935/1968 (removed 33) transitions.
// Phase 1: matrix 1935 rows 1511 cols
[2024-05-21 06:35:03] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 06:35:04] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-21 06:35:04] [INFO ] Invariant cache hit.
[2024-05-21 06:35:05] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2024-05-21 06:35:05] [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/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30052 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints]
After SMT, in 60584ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60601ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1540 places, 1935/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62440 ms. Remains : 1511/1540 places, 1935/1968 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-317-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLFireability-05 finished in 62717 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 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1871 edges and 1540 vertex of which 689 / 1540 are part of one of the 62 SCC in 3 ms
Free SCC test removed 627 places
Ensure Unique test removed 730 transitions
Reduce isomorphic transitions removed 730 transitions.
Graph (complete) has 1419 edges and 913 vertex of which 904 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 497 transitions
Trivial Post-agglo rules discarded 497 transitions
Performed 497 trivial Post agglomeration. Transition count delta: 497
Iterating post reduction 0 with 497 rules applied. Total rules applied 499 place count 903 transition count 735
Reduce places removed 497 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 520 rules applied. Total rules applied 1019 place count 406 transition count 712
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1031 place count 395 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1032 place count 394 transition count 711
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1032 place count 394 transition count 662
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1130 place count 345 transition count 662
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1144 place count 331 transition count 640
Iterating global reduction 4 with 14 rules applied. Total rules applied 1158 place count 331 transition count 640
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1159 place count 331 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1160 place count 330 transition count 639
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1160 place count 330 transition count 638
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1162 place count 329 transition count 638
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1172 place count 319 transition count 624
Iterating global reduction 6 with 10 rules applied. Total rules applied 1182 place count 319 transition count 624
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1186 place count 319 transition count 620
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1188 place count 317 transition count 616
Iterating global reduction 7 with 2 rules applied. Total rules applied 1190 place count 317 transition count 616
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1192 place count 315 transition count 612
Iterating global reduction 7 with 2 rules applied. Total rules applied 1194 place count 315 transition count 612
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1196 place count 313 transition count 608
Iterating global reduction 7 with 2 rules applied. Total rules applied 1198 place count 313 transition count 608
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1200 place count 311 transition count 604
Iterating global reduction 7 with 2 rules applied. Total rules applied 1202 place count 311 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1204 place count 309 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1206 place count 309 transition count 600
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1207 place count 308 transition count 593
Iterating global reduction 7 with 1 rules applied. Total rules applied 1208 place count 308 transition count 593
Performed 142 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1492 place count 166 transition count 369
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1503 place count 166 transition count 358
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1509 place count 160 transition count 350
Iterating global reduction 8 with 6 rules applied. Total rules applied 1515 place count 160 transition count 350
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1518 place count 157 transition count 343
Iterating global reduction 8 with 3 rules applied. Total rules applied 1521 place count 157 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1523 place count 157 transition count 341
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 9 with 24 rules applied. Total rules applied 1547 place count 145 transition count 327
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1561 place count 145 transition count 313
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -46
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 1597 place count 127 transition count 359
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 1615 place count 127 transition count 341
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1624 place count 118 transition count 323
Iterating global reduction 11 with 9 rules applied. Total rules applied 1633 place count 118 transition count 323
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1639 place count 118 transition count 317
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 1675 place count 118 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1676 place count 117 transition count 280
Applied a total of 1676 rules in 153 ms. Remains 117 /1540 variables (removed 1423) and now considering 280/1968 (removed 1688) transitions.
[2024-05-21 06:36:06] [INFO ] Flow matrix only has 222 transitions (discarded 58 similar events)
// Phase 1: matrix 222 rows 117 cols
[2024-05-21 06:36:06] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:36:06] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 06:36:06] [INFO ] Flow matrix only has 222 transitions (discarded 58 similar events)
[2024-05-21 06:36:06] [INFO ] Invariant cache hit.
[2024-05-21 06:36:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:36:06] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1540 places, 280/1968 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 279
Applied a total of 2 rules in 6 ms. Remains 115 /116 variables (removed 1) and now considering 279/280 (removed 1) transitions.
[2024-05-21 06:36:06] [INFO ] Flow matrix only has 221 transitions (discarded 58 similar events)
// Phase 1: matrix 221 rows 115 cols
[2024-05-21 06:36:06] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:36:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 06:36:06] [INFO ] Flow matrix only has 221 transitions (discarded 58 similar events)
[2024-05-21 06:36:06] [INFO ] Invariant cache hit.
[2024-05-21 06:36:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:36:06] [INFO ] Implicit Places using invariants and state equation in 117 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 : 115/1540 places, 279/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 489 ms. Remains : 115/1540 places, 279/1968 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-06
Product exploration explored 100000 steps with 13176 reset in 217 ms.
Product exploration explored 100000 steps with 13074 reset in 228 ms.
Computed a total of 6 stabilizing places and 34 stable transitions
Computed a total of 6 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 147 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (6299 resets) in 446 ms. (89 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (1610 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
[2024-05-21 06:36:07] [INFO ] Flow matrix only has 221 transitions (discarded 58 similar events)
[2024-05-21 06:36:07] [INFO ] Invariant cache hit.
[2024-05-21 06:36:07] [INFO ] State equation strengthened by 4 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) 72/80 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/238 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 94/332 variables, 61/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/335 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/336 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/336 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[State Equation: 115/115 constraints, ReadFeed: 4/4 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) 72/80 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 158/238 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 94/332 variables, 61/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/335 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/336 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/336 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[State Equation: 115/115 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 453 steps, including 133 resets, run visited all 1 properties in 2 ms. (steps per millisecond=226 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 335 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 279/279 transitions.
Applied a total of 0 rules in 11 ms. Remains 115 /115 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-05-21 06:36:08] [INFO ] Flow matrix only has 221 transitions (discarded 58 similar events)
[2024-05-21 06:36:08] [INFO ] Invariant cache hit.
[2024-05-21 06:36:08] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 06:36:08] [INFO ] Flow matrix only has 221 transitions (discarded 58 similar events)
[2024-05-21 06:36:08] [INFO ] Invariant cache hit.
[2024-05-21 06:36:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:36:08] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-21 06:36:08] [INFO ] Redundant transitions in 47 ms returned []
Running 274 sub problems to find dead transitions.
[2024-05-21 06:36:08] [INFO ] Flow matrix only has 221 transitions (discarded 58 similar events)
[2024-05-21 06:36:08] [INFO ] Invariant cache hit.
[2024-05-21 06:36:08] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 220/334 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/335 variables, 1/118 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/118 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/119 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/119 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/119 constraints. Problems are: Problem set: 15 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 119 constraints, problems are : Problem set: 15 solved, 259 unsolved in 9660 ms.
Refiners :[State Equation: 115/115 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 220/334 variables, 114/114 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 3/117 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 259/376 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/376 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 1/335 variables, 1/377 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/377 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 1/336 variables, 1/378 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/378 constraints. Problems are: Problem set: 15 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/378 constraints. Problems are: Problem set: 15 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 378 constraints, problems are : Problem set: 15 solved, 259 unsolved in 15038 ms.
Refiners :[State Equation: 115/115 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 259/274 constraints, Known Traps: 0/0 constraints]
After SMT, in 24862ms problems are : Problem set: 15 solved, 259 unsolved
Search for dead transitions found 15 dead transitions in 24865ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 115/115 places, 264/279 transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 108 transition count 246
Applied a total of 7 rules in 6 ms. Remains 108 /115 variables (removed 7) and now considering 246/264 (removed 18) transitions.
[2024-05-21 06:36:33] [INFO ] Flow matrix only has 194 transitions (discarded 52 similar events)
// Phase 1: matrix 194 rows 108 cols
[2024-05-21 06:36:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 06:36:33] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 06:36:33] [INFO ] Flow matrix only has 194 transitions (discarded 52 similar events)
[2024-05-21 06:36:33] [INFO ] Invariant cache hit.
[2024-05-21 06:36:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:36:33] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/115 places, 246/279 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25406 ms. Remains : 108/115 places, 246/279 transitions.
Computed a total of 6 stabilizing places and 19 stable transitions
Computed a total of 6 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 162 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (6247 resets) in 254 ms. (156 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (1598 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2024-05-21 06:36:33] [INFO ] Flow matrix only has 194 transitions (discarded 52 similar events)
[2024-05-21 06:36:33] [INFO ] Invariant cache hit.
[2024-05-21 06:36:33] [INFO ] State equation strengthened by 4 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) 58/66 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/198 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 97/295 variables, 58/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/301 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/302 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/302 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[State Equation: 108/108 constraints, ReadFeed: 4/4 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) 58/66 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 132/198 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 97/295 variables, 58/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/301 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/302 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/302 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[State Equation: 108/108 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 228ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 113 steps, including 9 resets, run visited all 1 properties in 1 ms. (steps per millisecond=113 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 383 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13325 reset in 119 ms.
Product exploration explored 100000 steps with 13330 reset in 189 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 246/246 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2024-05-21 06:36:34] [INFO ] Flow matrix only has 194 transitions (discarded 52 similar events)
[2024-05-21 06:36:34] [INFO ] Invariant cache hit.
[2024-05-21 06:36:34] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 06:36:34] [INFO ] Flow matrix only has 194 transitions (discarded 52 similar events)
[2024-05-21 06:36:34] [INFO ] Invariant cache hit.
[2024-05-21 06:36:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:36:35] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-21 06:36:35] [INFO ] Redundant transitions in 217 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-21 06:36:35] [INFO ] Flow matrix only has 194 transitions (discarded 52 similar events)
[2024-05-21 06:36:35] [INFO ] Invariant cache hit.
[2024-05-21 06:36:35] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 193/300 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 1/301 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 1/302 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 112 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7762 ms.
Refiners :[State Equation: 108/108 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 193/300 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 241/351 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 1/301 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 1/302 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/302 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 353 constraints, problems are : Problem set: 0 solved, 241 unsolved in 12757 ms.
Refiners :[State Equation: 108/108 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 20677ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 20681ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21178 ms. Remains : 108/108 places, 246/246 transitions.
Treatment of property CloudReconfiguration-PT-317-LTLFireability-06 finished in 50224 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||X(p1))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1525 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1525 transition count 1953
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 1525 transition count 1950
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 1519 transition count 1944
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 1519 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1517 transition count 1942
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1517 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 1517 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1516 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1515 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1509 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1509 transition count 1933
Applied a total of 66 rules in 717 ms. Remains 1509 /1540 variables (removed 31) and now considering 1933/1968 (removed 35) transitions.
// Phase 1: matrix 1933 rows 1509 cols
[2024-05-21 06:36:57] [INFO ] Computed 4 invariants in 12 ms
[2024-05-21 06:36:57] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-21 06:36:57] [INFO ] Invariant cache hit.
[2024-05-21 06:36:58] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-21 06:36:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3442 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/1509 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/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 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 1)
(s165 1)
(s166 1)
(s167 0)
(s168 1)
(s169 1)
(s170 1)
(s171 0)
(s172 1)
(s173 1)
(s174 1)
(s175 0)
(s176 1)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 1)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 1)
(s291 0)
(s292 0)
(s293 1)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 1)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 1)
(s308 1)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(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 0)
(s698 0)
(s699 0)
(s700 1)
(s701 1)
(s702 1)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 1)
(s709 1)
(s710 0)
(s711 0)
(s712 1)
(s713 0)
(s714 0)
(s715 1)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 1)
(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 1)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 0)
(s1107 0)
(s1108 1)
(s1109 1)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 1)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 1)
(s1127 1)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 0)
(s1297 0)
(s1298 0)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 0)
(s1303 0)
(s1304 0)
(s1305 0)
(s1306 0)
(s1307 0)
(s1308 0)
(s1309 0)
(s1310 0)
(s1311 0)
(s1312 0)
(s1313 0)
(s1314 0)
(s1315 0)
(s1316 0)
(s1317 0)
(s1318 0)
(s1319 0)
(s1320 0)
(s1321 0)
(s1322 0)
(s1323 0)
(s1324 0)
(s1325 0)
(s1326 0)
(s1327 0)
(s1328 0)
(s1329 0)
(s1330 0)
(s1331 0)
(s1332 0)
(s1333 0)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 0)
(s1338 0)
(s1339 0)
(s1340 0)
(s1341 0)
(s1342 0)
(s1343 0)
(s1344 0)
(s1345 0)
(s1346 0)
(s1347 0)
(s1348 0)
(s1349 0)
(s1350 0)
(s1351 0)
(s1352 0)
(s1353 0)
(s1354 0)
(s1355 0)
(s1356 0)
(s1357 0)
(s1358 0)
(s1359 0)
(s1360 0)
(s1361 0)
(s1362 0)
(s1363 0)
(s1364 0)
(s1365 0)
(s1366 0)
(s1367 0)
(s1368 0)
(s1369 0)
(s1370 0)
(s1371 0)
(s1372 0)
(s1373 0)
(s1374 0)
(s1375 0)
(s1376 0)
(s1377 0)
(s1378 0)
(s1379 0)
(s1380 0)
(s1381 0)
(s1382 0)
(s1383 0)
(s1384 0)
(s1385 0)
(s1386 0)
(s1387 0)
(s1388 0)
(s1389 0)
(s1390 0)
(s1391 0)
(s1392 0)
(s1393 0)
(s1394 0)
(s1395 0)
(s1396 0)
(s1397 0)
(s1398 0)
(s1399 0)
(s1400 0)
(s1401 0)
(s1402 0)
(s1403 0)
(s1404 0)
(s1405 0)
(s1406 0)
(s1407 0)
(s1408 0)
(s1409 0)
(s1410 0)
(s1411 0)
(s1412 0)
(s1413 0)
(s1414 0)
(s1415 0)
(s1416 0)
(s1417 0)
(s1418 0)
(s1419 0)
(s1420 0)
(s1421 0)
(s1422 0)
(s1423 0)
(s1424 0)
(s1425 0)
(s1426 0)
(s1427 0)
(s1428 0)
(s1429 0)
(s1430 0)
(s1431 0)
(s1432 0)
(s1433 0)
(s1434 0)
(s1435 0)
(s1436 0)
(s1437 0)
(s1438 0)
(s1439 0)
(s1440 0)
(s1441 0)
(s1442 0)
(s1443 0)
(s1444 0)
(s1445 0)
(s1446 0)
(s1447 0)
(s1448 0)
(s1449 0)
(s1450 0)
(s1451 0)
(s1452 0)
(s1453 0)
(s1454 0)
(s1455 0)
(s1456 0)
(s1457 0)
(s1458 0)
(s1459 0)
(s1460 0)
(s1461 0)
(s1462 0)
(s1463 0)
(s1464 0)
(s1465 0)
(s1466 0)
(s1467 0)
(s1468 0)
(s1469 0)
(s1470 0)
(s1471 0)
(s1472 0)
(s1473 0)
(s1474 0)
(s1475 0)
(s1476 0)
(s1477 0)
(s1478 0)
(s1479 0)
(s1480 0)
(s1481 0)
(s1482 0)
(s1483 0)
(s1484 0)
(s1485 0)
(s1486 0)
(s1487 0)
(s1488 0)
(s1489 0)
(s1490 0)
(s1491 0)
(s1492 0)
(s1493 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints]
After SMT, in 60539ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1540 places, 1933/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62468 ms. Remains : 1509/1540 places, 1933/1968 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-07
Product exploration explored 100000 steps with 1102 reset in 139 ms.
Product exploration explored 100000 steps with 1079 reset in 150 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2116 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 180 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (426 resets) in 191 ms. (208 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (139 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (166 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
[2024-05-21 06:37:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 291/293 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1498 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3421 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3423 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3423 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3425 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3442/3442 variables, and 1513 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1941 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 291/293 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1498 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3421 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 2/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3435 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3435 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3439 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3439 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3441 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3441 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3442 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3442 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3442 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3442/3442 variables, and 1515 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2003 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3967ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 338 ms.
Support contains 2 out of 1509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Graph (trivial) has 1837 edges and 1509 vertex of which 687 / 1509 are part of one of the 63 SCC in 1 ms
Free SCC test removed 624 places
Drop transitions (Empty/Sink Transition effects.) removed 786 transitions
Reduce isomorphic transitions removed 786 transitions.
Graph (complete) has 1325 edges and 885 vertex of which 876 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 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 876 transition count 647
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 549 rules applied. Total rules applied 1047 place count 387 transition count 587
Reduce places removed 39 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 2 with 41 rules applied. Total rules applied 1088 place count 348 transition count 585
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1090 place count 347 transition count 584
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1090 place count 347 transition count 534
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1190 place count 297 transition count 534
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1201 place count 286 transition count 518
Iterating global reduction 4 with 11 rules applied. Total rules applied 1212 place count 286 transition count 518
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 1215 place count 286 transition count 515
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1218 place count 283 transition count 515
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1225 place count 276 transition count 507
Iterating global reduction 6 with 7 rules applied. Total rules applied 1232 place count 276 transition count 507
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1238 place count 276 transition count 501
Performed 142 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1522 place count 134 transition count 263
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1538 place count 134 transition count 247
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1541 place count 131 transition count 244
Iterating global reduction 8 with 3 rules applied. Total rules applied 1544 place count 131 transition count 244
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1570 place count 118 transition count 228
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1586 place count 118 transition count 212
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 1588 place count 117 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1590 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 10 with 2 rules applied. Total rules applied 1592 place count 116 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1594 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 11 with 2 rules applied. Total rules applied 1596 place count 115 transition count 205
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1597 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 12 with 68 rules applied. Total rules applied 1665 place count 81 transition count 248
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 12 with 38 rules applied. Total rules applied 1703 place count 81 transition count 210
Discarding 22 places :
Symmetric choice reduction at 13 with 22 rule applications. Total rules 1725 place count 59 transition count 174
Iterating global reduction 13 with 22 rules applied. Total rules applied 1747 place count 59 transition count 174
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 1760 place count 59 transition count 161
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1766 place count 53 transition count 149
Iterating global reduction 14 with 6 rules applied. Total rules applied 1772 place count 53 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1778 place count 53 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 15 with 10 rules applied. Total rules applied 1788 place count 53 transition count 133
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1789 place count 52 transition count 130
Iterating global reduction 15 with 1 rules applied. Total rules applied 1790 place count 52 transition count 130
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1791 place count 51 transition count 129
Iterating global reduction 15 with 1 rules applied. Total rules applied 1792 place count 51 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1794 place count 51 transition count 127
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 1795 place count 51 transition count 126
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 1799 place count 51 transition count 122
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1805 place count 47 transition count 120
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 1806 place count 47 transition count 119
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1808 place count 47 transition count 119
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 1809 place count 47 transition count 118
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1810 place count 46 transition count 117
Iterating global reduction 17 with 1 rules applied. Total rules applied 1811 place count 46 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1812 place count 45 transition count 116
Applied a total of 1812 rules in 80 ms. Remains 45 /1509 variables (removed 1464) and now considering 116/1933 (removed 1817) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 45/1509 places, 116/1933 transitions.
RANDOM walk for 305 steps (5 resets) in 5 ms. (50 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 295 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Applied a total of 0 rules in 48 ms. Remains 1509 /1509 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
[2024-05-21 06:38:04] [INFO ] Invariant cache hit.
[2024-05-21 06:38:04] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-21 06:38:04] [INFO ] Invariant cache hit.
[2024-05-21 06:38:05] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-21 06:38:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 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/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 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 1)
(s207 1)
(s208 1)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 1)
(s217 0)
(s218 1)
(s219 1)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 1)
(s291 0)
(s292 0)
(s293 1)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 1)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 1)
(s308 1)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(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 0)
(s698 0)
(s699 0)
(s700 1)
(s701 1)
(s702 1)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 1)
(s709 1)
(s710 0)
(s711 0)
(s712 1)
(s713 0)
(s714 0)
(s715 1)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 1)
(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 1)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3442 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/1509 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints]
After SMT, in 60493ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60511ms
Finished structural reductions in LTL mode , in 1 iterations and 61707 ms. Remains : 1509/1509 places, 1933/1933 transitions.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2116 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (438 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (153 resets) in 134 ms. (296 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (145 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (160 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
[2024-05-21 06:39:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 291/293 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1498 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3421 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3423 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3423 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3425 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3425 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3427 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3427 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3429 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3442/3442 variables, and 1513 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1924 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 291/293 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1498 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1923/3421 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 2/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3435 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3435 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3439 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3439 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3441 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3441 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3442 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3442 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3442 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3442/3442 variables, and 1515 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3973ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 336 ms.
Support contains 2 out of 1509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Graph (trivial) has 1837 edges and 1509 vertex of which 687 / 1509 are part of one of the 63 SCC in 1 ms
Free SCC test removed 624 places
Drop transitions (Empty/Sink Transition effects.) removed 786 transitions
Reduce isomorphic transitions removed 786 transitions.
Graph (complete) has 1325 edges and 885 vertex of which 876 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 876 transition count 647
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 549 rules applied. Total rules applied 1047 place count 387 transition count 587
Reduce places removed 39 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 2 with 41 rules applied. Total rules applied 1088 place count 348 transition count 585
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1090 place count 347 transition count 584
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1090 place count 347 transition count 534
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1190 place count 297 transition count 534
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1201 place count 286 transition count 518
Iterating global reduction 4 with 11 rules applied. Total rules applied 1212 place count 286 transition count 518
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 1215 place count 286 transition count 515
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1218 place count 283 transition count 515
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1225 place count 276 transition count 507
Iterating global reduction 6 with 7 rules applied. Total rules applied 1232 place count 276 transition count 507
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1238 place count 276 transition count 501
Performed 142 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 284 rules applied. Total rules applied 1522 place count 134 transition count 263
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1538 place count 134 transition count 247
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1541 place count 131 transition count 244
Iterating global reduction 8 with 3 rules applied. Total rules applied 1544 place count 131 transition count 244
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1570 place count 118 transition count 228
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1586 place count 118 transition count 212
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 1588 place count 117 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1590 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 10 with 2 rules applied. Total rules applied 1592 place count 116 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1594 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 11 with 2 rules applied. Total rules applied 1596 place count 115 transition count 205
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1597 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 12 with 68 rules applied. Total rules applied 1665 place count 81 transition count 248
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 12 with 38 rules applied. Total rules applied 1703 place count 81 transition count 210
Discarding 22 places :
Symmetric choice reduction at 13 with 22 rule applications. Total rules 1725 place count 59 transition count 174
Iterating global reduction 13 with 22 rules applied. Total rules applied 1747 place count 59 transition count 174
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 1760 place count 59 transition count 161
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1766 place count 53 transition count 149
Iterating global reduction 14 with 6 rules applied. Total rules applied 1772 place count 53 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1778 place count 53 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 15 with 10 rules applied. Total rules applied 1788 place count 53 transition count 133
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1789 place count 52 transition count 130
Iterating global reduction 15 with 1 rules applied. Total rules applied 1790 place count 52 transition count 130
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1791 place count 51 transition count 129
Iterating global reduction 15 with 1 rules applied. Total rules applied 1792 place count 51 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1794 place count 51 transition count 127
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 1795 place count 51 transition count 126
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 1799 place count 51 transition count 122
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1805 place count 47 transition count 120
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 1806 place count 47 transition count 119
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1808 place count 47 transition count 119
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 1809 place count 47 transition count 118
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1810 place count 46 transition count 117
Iterating global reduction 17 with 1 rules applied. Total rules applied 1811 place count 46 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1812 place count 45 transition count 116
Applied a total of 1812 rules in 50 ms. Remains 45 /1509 variables (removed 1464) and now considering 116/1933 (removed 1817) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 45/1509 places, 116/1933 transitions.
RANDOM walk for 177 steps (2 resets) in 6 ms. (25 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 284 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1085 reset in 160 ms.
Product exploration explored 100000 steps with 1074 reset in 162 ms.
Support contains 2 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1933/1933 transitions.
Applied a total of 0 rules in 48 ms. Remains 1509 /1509 variables (removed 0) and now considering 1933/1933 (removed 0) transitions.
[2024-05-21 06:39:12] [INFO ] Invariant cache hit.
[2024-05-21 06:39:12] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 06:39:12] [INFO ] Invariant cache hit.
[2024-05-21 06:39:13] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-21 06:39:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3442 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/1509 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/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints]
After SMT, in 60539ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60557ms
Finished structural reductions in LTL mode , in 1 iterations and 61800 ms. Remains : 1509/1509 places, 1933/1933 transitions.
Treatment of property CloudReconfiguration-PT-317-LTLFireability-07 finished in 197808 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||X(X(G(p1)))) U p2))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1870 edges and 1540 vertex of which 694 / 1540 are part of one of the 62 SCC in 2 ms
Free SCC test removed 632 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1413 edges and 908 vertex of which 899 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 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 898 transition count 731
Reduce places removed 495 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 518 rules applied. Total rules applied 1015 place count 403 transition count 708
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1026 place count 392 transition count 708
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1026 place count 392 transition count 661
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1120 place count 345 transition count 661
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1132 place count 333 transition count 643
Iterating global reduction 3 with 12 rules applied. Total rules applied 1144 place count 333 transition count 643
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1145 place count 333 transition count 642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1146 place count 332 transition count 642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1146 place count 332 transition count 641
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1148 place count 331 transition count 641
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1157 place count 322 transition count 629
Iterating global reduction 5 with 9 rules applied. Total rules applied 1166 place count 322 transition count 629
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1170 place count 322 transition count 625
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1171 place count 321 transition count 623
Iterating global reduction 6 with 1 rules applied. Total rules applied 1172 place count 321 transition count 623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1173 place count 320 transition count 621
Iterating global reduction 6 with 1 rules applied. Total rules applied 1174 place count 320 transition count 621
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1175 place count 319 transition count 619
Iterating global reduction 6 with 1 rules applied. Total rules applied 1176 place count 319 transition count 619
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1177 place count 318 transition count 617
Iterating global reduction 6 with 1 rules applied. Total rules applied 1178 place count 318 transition count 617
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1179 place count 317 transition count 615
Iterating global reduction 6 with 1 rules applied. Total rules applied 1180 place count 317 transition count 615
Performed 144 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 6 with 288 rules applied. Total rules applied 1468 place count 173 transition count 387
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1481 place count 173 transition count 374
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1487 place count 167 transition count 366
Iterating global reduction 7 with 6 rules applied. Total rules applied 1493 place count 167 transition count 366
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1496 place count 164 transition count 359
Iterating global reduction 7 with 3 rules applied. Total rules applied 1499 place count 164 transition count 359
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1501 place count 164 transition count 357
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1523 place count 153 transition count 345
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1535 place count 153 transition count 333
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1536 place count 152 transition count 331
Iterating global reduction 9 with 1 rules applied. Total rules applied 1537 place count 152 transition count 331
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 1577 place count 132 transition count 381
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1599 place count 132 transition count 359
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1608 place count 123 transition count 341
Iterating global reduction 10 with 9 rules applied. Total rules applied 1617 place count 123 transition count 341
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1623 place count 123 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 11 with 42 rules applied. Total rules applied 1665 place count 123 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1666 place count 122 transition count 292
Applied a total of 1666 rules in 82 ms. Remains 122 /1540 variables (removed 1418) and now considering 292/1968 (removed 1676) transitions.
[2024-05-21 06:40:14] [INFO ] Flow matrix only has 232 transitions (discarded 60 similar events)
// Phase 1: matrix 232 rows 122 cols
[2024-05-21 06:40:14] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:40:14] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 06:40:14] [INFO ] Flow matrix only has 232 transitions (discarded 60 similar events)
[2024-05-21 06:40:14] [INFO ] Invariant cache hit.
[2024-05-21 06:40:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 06:40:14] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/1540 places, 292/1968 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 291
Applied a total of 2 rules in 5 ms. Remains 120 /121 variables (removed 1) and now considering 291/292 (removed 1) transitions.
[2024-05-21 06:40:14] [INFO ] Flow matrix only has 231 transitions (discarded 60 similar events)
// Phase 1: matrix 231 rows 120 cols
[2024-05-21 06:40:14] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 06:40:14] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 06:40:14] [INFO ] Flow matrix only has 231 transitions (discarded 60 similar events)
[2024-05-21 06:40:14] [INFO ] Invariant cache hit.
[2024-05-21 06:40:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 06:40:14] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/1540 places, 291/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 422 ms. Remains : 120/1540 places, 291/1968 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-317-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLFireability-08 finished in 729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1525 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1525 transition count 1953
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 1525 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 1520 transition count 1945
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 1520 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1519 transition count 1944
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1519 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 1519 transition count 1943
Applied a total of 46 rules in 203 ms. Remains 1519 /1540 variables (removed 21) and now considering 1943/1968 (removed 25) transitions.
// Phase 1: matrix 1943 rows 1519 cols
[2024-05-21 06:40:15] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 06:40:15] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 06:40:15] [INFO ] Invariant cache hit.
[2024-05-21 06:40:16] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
Running 1942 sub problems to find dead transitions.
[2024-05-21 06:40:16] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.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 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1518/3462 variables, and 4 constraints, problems are : Problem set: 0 solved, 1942 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 1942/1942 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1942 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1518/3462 variables, and 4 constraints, problems are : Problem set: 0 solved, 1942 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 0/1942 constraints, Known Traps: 0/0 constraints]
After SMT, in 60536ms problems are : Problem set: 0 solved, 1942 unsolved
Search for dead transitions found 0 dead transitions in 60554ms
Starting structural reductions in LTL mode, iteration 1 : 1519/1540 places, 1943/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61950 ms. Remains : 1519/1540 places, 1943/1968 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-10
Product exploration explored 100000 steps with 1075 reset in 197 ms.
Product exploration explored 100000 steps with 1076 reset in 217 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2128 edges and 1519 vertex of which 1510 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (414 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (156 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 421703 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 1
Probabilistic random walk after 421703 steps, saw 112481 distinct states, run finished after 3005 ms. (steps per millisecond=140 ) properties seen :0
[2024-05-21 06:41:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 429/430 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1508 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1933/3441 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3449 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3451 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3451 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3453 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3453 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3455 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3457 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3457 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3459 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3459 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3461 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3461 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3462 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3462 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3462 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3462/3462 variables, and 1523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1282 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 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) 429/430 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1508 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1933/3441 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3441 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3445 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3447 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3449 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3451 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3451 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3453 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3453 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3455 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3455 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3457 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3457 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3459 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3459 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3461 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3461 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3462 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3462 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3462 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3462/3462 variables, and 1524 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1344 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2641ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 177 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=88 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-317-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-317-LTLFireability-10 finished in 68463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1525 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1525 transition count 1953
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 1525 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 1520 transition count 1945
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 1520 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1519 transition count 1944
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1519 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1518 transition count 1943
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1518 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1517 transition count 1942
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1517 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1516 transition count 1941
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1515 transition count 1940
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1514 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1513 transition count 1938
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1512 transition count 1937
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1512 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1511 transition count 1936
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1511 transition count 1936
Applied a total of 61 rules in 574 ms. Remains 1511 /1540 variables (removed 29) and now considering 1936/1968 (removed 32) transitions.
// Phase 1: matrix 1936 rows 1511 cols
[2024-05-21 06:41:23] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 06:41:24] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-21 06:41:24] [INFO ] Invariant cache hit.
[2024-05-21 06:41:25] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2024-05-21 06:41:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints]
After SMT, in 60512ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1540 places, 1936/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62296 ms. Remains : 1511/1540 places, 1936/1968 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-11
Product exploration explored 100000 steps with 1076 reset in 143 ms.
Product exploration explored 100000 steps with 1092 reset in 142 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2119 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 335 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (431 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (155 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 432529 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 432529 steps, saw 115807 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2024-05-21 06:42:29] [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) 294/295 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1500 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1926/3426 variables, 1500/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3447/3447 variables, and 1515 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1678 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 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) 294/295 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1500 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1926/3426 variables, 1500/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3447 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3447/3447 variables, and 1516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1446 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3143ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 1511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1511/1511 places, 1936/1936 transitions.
Graph (trivial) has 1843 edges and 1511 vertex of which 693 / 1511 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1318 edges and 881 vertex of which 872 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 872 transition count 640
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 546 rules applied. Total rules applied 1044 place count 383 transition count 583
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1081 place count 346 transition count 583
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 1081 place count 346 transition count 533
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1181 place count 296 transition count 533
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1192 place count 285 transition count 517
Iterating global reduction 3 with 11 rules applied. Total rules applied 1203 place count 285 transition count 517
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1206 place count 285 transition count 514
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1209 place count 282 transition count 514
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1216 place count 275 transition count 506
Iterating global reduction 5 with 7 rules applied. Total rules applied 1223 place count 275 transition count 506
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1229 place count 275 transition count 500
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1230 place count 274 transition count 494
Iterating global reduction 6 with 1 rules applied. Total rules applied 1231 place count 274 transition count 494
Performed 144 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 6 with 288 rules applied. Total rules applied 1519 place count 130 transition count 254
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1534 place count 130 transition count 239
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1537 place count 127 transition count 236
Iterating global reduction 7 with 3 rules applied. Total rules applied 1540 place count 127 transition count 236
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1566 place count 114 transition count 220
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1581 place count 114 transition count 205
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1583 place count 113 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1585 place count 113 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1587 place count 112 transition count 201
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1589 place count 112 transition count 199
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 10 with 68 rules applied. Total rules applied 1657 place count 78 transition count 243
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 10 with 48 rules applied. Total rules applied 1705 place count 78 transition count 195
Discarding 23 places :
Symmetric choice reduction at 11 with 23 rule applications. Total rules 1728 place count 55 transition count 165
Iterating global reduction 11 with 23 rules applied. Total rules applied 1751 place count 55 transition count 165
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1765 place count 55 transition count 151
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1771 place count 49 transition count 139
Iterating global reduction 12 with 6 rules applied. Total rules applied 1777 place count 49 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1783 place count 49 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 1803 place count 49 transition count 113
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1805 place count 47 transition count 107
Iterating global reduction 13 with 2 rules applied. Total rules applied 1807 place count 47 transition count 107
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1809 place count 45 transition count 105
Iterating global reduction 13 with 2 rules applied. Total rules applied 1811 place count 45 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1815 place count 45 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1817 place count 45 transition count 99
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 1820 place count 45 transition count 96
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 14 with 4 rules applied. Total rules applied 1824 place count 42 transition count 95
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1826 place count 42 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1827 place count 42 transition count 94
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1828 place count 41 transition count 93
Iterating global reduction 15 with 1 rules applied. Total rules applied 1829 place count 41 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1830 place count 40 transition count 92
Applied a total of 1830 rules in 64 ms. Remains 40 /1511 variables (removed 1471) and now considering 92/1936 (removed 1844) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 40/1511 places, 92/1936 transitions.
RANDOM walk for 52 steps (3 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1511/1511 places, 1936/1936 transitions.
Applied a total of 0 rules in 48 ms. Remains 1511 /1511 variables (removed 0) and now considering 1936/1936 (removed 0) transitions.
[2024-05-21 06:42:33] [INFO ] Invariant cache hit.
[2024-05-21 06:42:33] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-21 06:42:33] [INFO ] Invariant cache hit.
[2024-05-21 06:42:34] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2024-05-21 06:42:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 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 1510/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints]
After SMT, in 60549ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60565ms
Finished structural reductions in LTL mode , in 1 iterations and 61836 ms. Remains : 1511/1511 places, 1936/1936 transitions.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2119 edges and 1511 vertex of which 1502 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (435 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (151 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 441691 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 441691 steps, saw 119436 distinct states, run finished after 3004 ms. (steps per millisecond=147 ) properties seen :0
[2024-05-21 06:43:38] [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) 294/295 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1500 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1926/3426 variables, 1500/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3447/3447 variables, and 1515 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1688 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 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) 294/295 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1500 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1500 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1926/3426 variables, 1500/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3447 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3447/3447 variables, and 1516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1404 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3126ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11523 steps, including 150 resets, run visited all 1 properties in 18 ms. (steps per millisecond=640 )
Parikh walk visited 1 properties in 18 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1076 reset in 136 ms.
Product exploration explored 100000 steps with 1044 reset in 132 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1511/1511 places, 1936/1936 transitions.
Graph (trivial) has 1843 edges and 1511 vertex of which 693 / 1511 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 1381 edges and 881 vertex of which 872 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 475 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 475 rules applied. Total rules applied 477 place count 872 transition count 1199
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 489 place count 872 transition count 1187
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 489 place count 872 transition count 1201
Deduced a syphon composed of 496 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 510 place count 872 transition count 1201
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 793 place count 589 transition count 908
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1076 place count 589 transition count 908
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1088 place count 577 transition count 892
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1100 place count 577 transition count 892
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1106 place count 577 transition count 886
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1118 place count 565 transition count 874
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1130 place count 565 transition count 874
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1132 place count 563 transition count 870
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1134 place count 563 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1136 place count 561 transition count 866
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1138 place count 561 transition count 866
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1142 place count 557 transition count 862
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1146 place count 557 transition count 862
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1147 place count 556 transition count 860
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1148 place count 556 transition count 860
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1149 place count 555 transition count 858
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1150 place count 555 transition count 858
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1152 place count 553 transition count 855
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1154 place count 553 transition count 855
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1156 place count 551 transition count 847
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1158 place count 551 transition count 847
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1160 place count 549 transition count 845
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1162 place count 549 transition count 845
Performed 107 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 319 places in 0 ms
Iterating global reduction 3 with 107 rules applied. Total rules applied 1269 place count 549 transition count 920
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 1310 place count 549 transition count 879
Discarding 101 places :
Symmetric choice reduction at 4 with 101 rule applications. Total rules 1411 place count 448 transition count 768
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 4 with 101 rules applied. Total rules applied 1512 place count 448 transition count 768
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1518 place count 442 transition count 759
Deduced a syphon composed of 222 places in 1 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1524 place count 442 transition count 759
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1531 place count 442 transition count 759
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1536 place count 442 transition count 754
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1551 place count 427 transition count 735
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1566 place count 427 transition count 735
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1572 place count 427 transition count 729
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1576 place count 423 transition count 725
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1580 place count 423 transition count 725
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1583 place count 423 transition count 725
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1589 place count 423 transition count 719
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1592 place count 420 transition count 716
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1595 place count 420 transition count 716
Performed 72 Post agglomeration using F-continuation condition with reduction of 125 identical transitions.
Deduced a syphon composed of 286 places in 0 ms
Iterating global reduction 7 with 72 rules applied. Total rules applied 1667 place count 420 transition count 1046
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 7 with 125 rules applied. Total rules applied 1792 place count 420 transition count 921
Discarding 128 places :
Symmetric choice reduction at 8 with 128 rule applications. Total rules 1920 place count 292 transition count 580
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 8 with 128 rules applied. Total rules applied 2048 place count 292 transition count 580
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 2063 place count 292 transition count 565
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 2090 place count 265 transition count 508
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 9 with 27 rules applied. Total rules applied 2117 place count 265 transition count 508
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2120 place count 265 transition count 556
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2123 place count 262 transition count 529
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2126 place count 262 transition count 529
Deduced a syphon composed of 140 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 9 with 51 rules applied. Total rules applied 2177 place count 262 transition count 478
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2181 place count 258 transition count 474
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2185 place count 258 transition count 474
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2188 place count 258 transition count 546
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2191 place count 255 transition count 531
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2194 place count 255 transition count 531
Deduced a syphon composed of 136 places in 0 ms
Applied a total of 2194 rules in 327 ms. Remains 255 /1511 variables (removed 1256) and now considering 531/1936 (removed 1405) transitions.
[2024-05-21 06:43:43] [INFO ] Redundant transitions in 4 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-21 06:43:43] [INFO ] Flow matrix only has 472 transitions (discarded 59 similar events)
// Phase 1: matrix 472 rows 255 cols
[2024-05-21 06:43:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:43:43] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 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 TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 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 TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 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 TDEAD404 is UNSAT
Problem TDEAD405 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 TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
At refinement iteration 1 (OVERLAPS) 471/725 variables, 254/254 constraints. Problems are: Problem set: 244 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/725 variables, 4/258 constraints. Problems are: Problem set: 244 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/725 variables, 0/258 constraints. Problems are: Problem set: 244 solved, 286 unsolved
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/726 variables, 1/259 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/259 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 1/727 variables, 1/260 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/727 variables, 0/260 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/727 variables, 0/260 constraints. Problems are: Problem set: 259 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 727/727 variables, and 260 constraints, problems are : Problem set: 259 solved, 271 unsolved in 19740 ms.
Refiners :[State Equation: 255/255 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 259 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 468/586 variables, 118/118 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 4/122 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 271/393 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/586 variables, 0/393 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 140/726 variables, 137/530 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/530 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/727 variables, 1/531 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/727 variables, 0/531 constraints. Problems are: Problem set: 259 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/727 variables, 0/531 constraints. Problems are: Problem set: 259 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 727/727 variables, and 531 constraints, problems are : Problem set: 259 solved, 271 unsolved in 26829 ms.
Refiners :[State Equation: 255/255 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 271/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 46790ms problems are : Problem set: 259 solved, 271 unsolved
Search for dead transitions found 259 dead transitions in 46806ms
Found 259 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 259 transitions
Dead transitions reduction (with SMT) removed 259 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 255/1511 places, 272/1936 transitions.
Graph (complete) has 419 edges and 255 vertex of which 119 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.0 ms
Discarding 136 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 112 transition count 254
Applied a total of 8 rules in 6 ms. Remains 112 /255 variables (removed 143) and now considering 254/272 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1511 places, 254/1936 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47149 ms. Remains : 112/1511 places, 254/1936 transitions.
Support contains 1 out of 1511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1511/1511 places, 1936/1936 transitions.
Applied a total of 0 rules in 52 ms. Remains 1511 /1511 variables (removed 0) and now considering 1936/1936 (removed 0) transitions.
// Phase 1: matrix 1936 rows 1511 cols
[2024-05-21 06:44:29] [INFO ] Computed 4 invariants in 9 ms
[2024-05-21 06:44:30] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-21 06:44:30] [INFO ] Invariant cache hit.
[2024-05-21 06:44:31] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2024-05-21 06:44: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/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints]
After SMT, in 60510ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60526ms
Finished structural reductions in LTL mode , in 1 iterations and 62052 ms. Remains : 1511/1511 places, 1936/1936 transitions.
Treatment of property CloudReconfiguration-PT-317-LTLFireability-11 finished in 248651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&X(p1)))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1525 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1525 transition count 1953
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 1525 transition count 1951
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 1519 transition count 1945
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 1519 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 1517 transition count 1943
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 1517 transition count 1943
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 1517 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 1516 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 1515 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1514 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1513 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1512 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1512 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1511 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1511 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1510 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1510 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1509 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1509 transition count 1934
Applied a total of 65 rules in 614 ms. Remains 1509 /1540 variables (removed 31) and now considering 1934/1968 (removed 34) transitions.
// Phase 1: matrix 1934 rows 1509 cols
[2024-05-21 06:45:32] [INFO ] Computed 4 invariants in 8 ms
[2024-05-21 06:45:33] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-21 06:45:33] [INFO ] Invariant cache hit.
[2024-05-21 06:45:33] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2024-05-21 06:45:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 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/1508 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 1)
(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 1)
(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 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 0)
(s275 0)
(s276 1)
(s277 1)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 1)
(s290 1)
(s291 0)
(s292 0)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(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 1)
(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 0)
(s698 0)
(s699 0)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 1)
(s713 0)
(s714 0)
(s715 0)
(s716 1)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 1)
(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 1)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 0)
(s1100 0)
(s1101 1)
(s1102 0)
(s1103 1)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 1)
(s1109 1)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 1)
(s1114 1)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 1)
(s1122 1)
(s1123 0)
(s1124 0)
(s1125 1)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 timeout
0)
(s1240 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints]
After SMT, in 60512ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1540 places, 1934/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62493 ms. Remains : 1509/1540 places, 1934/1968 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-12
Stuttering criterion allowed to conclude after 176 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-317-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLFireability-12 finished in 62622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1525 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1525 transition count 1953
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 1525 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 1520 transition count 1945
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 1520 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1518 transition count 1943
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1518 transition count 1943
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 1518 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1517 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1517 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1516 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1515 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1510 transition count 1934
Applied a total of 64 rules in 507 ms. Remains 1510 /1540 variables (removed 30) and now considering 1934/1968 (removed 34) transitions.
// Phase 1: matrix 1934 rows 1510 cols
[2024-05-21 06:46:35] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 06:46:35] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-21 06:46:35] [INFO ] Invariant cache hit.
[2024-05-21 06:46:36] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2024-05-21 06:46:36] [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 1.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 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.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 1.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 1.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 1.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 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 timeout
1.0)
(s400 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, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 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/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints]
After SMT, in 60519ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1540 places, 1934/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62181 ms. Remains : 1510/1540 places, 1934/1968 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-317-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLFireability-13 finished in 62347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1874 edges and 1540 vertex of which 696 / 1540 are part of one of the 63 SCC in 1 ms
Free SCC test removed 633 places
Ensure Unique test removed 737 transitions
Reduce isomorphic transitions removed 737 transitions.
Graph (complete) has 1412 edges and 907 vertex of which 898 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 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 897 transition count 729
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 519 rules applied. Total rules applied 1017 place count 401 transition count 706
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1029 place count 390 transition count 705
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1030 place count 389 transition count 705
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1030 place count 389 transition count 658
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 1124 place count 342 transition count 658
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1138 place count 328 transition count 636
Iterating global reduction 4 with 14 rules applied. Total rules applied 1152 place count 328 transition count 636
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1153 place count 328 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1154 place count 327 transition count 635
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1154 place count 327 transition count 634
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1156 place count 326 transition count 634
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1166 place count 316 transition count 620
Iterating global reduction 6 with 10 rules applied. Total rules applied 1176 place count 316 transition count 620
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1180 place count 316 transition count 616
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1182 place count 314 transition count 612
Iterating global reduction 7 with 2 rules applied. Total rules applied 1184 place count 314 transition count 612
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1186 place count 312 transition count 608
Iterating global reduction 7 with 2 rules applied. Total rules applied 1188 place count 312 transition count 608
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1190 place count 310 transition count 604
Iterating global reduction 7 with 2 rules applied. Total rules applied 1192 place count 310 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1194 place count 308 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1196 place count 308 transition count 600
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1198 place count 306 transition count 596
Iterating global reduction 7 with 2 rules applied. Total rules applied 1200 place count 306 transition count 596
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1201 place count 305 transition count 589
Iterating global reduction 7 with 1 rules applied. Total rules applied 1202 place count 305 transition count 589
Performed 141 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 7 with 282 rules applied. Total rules applied 1484 place count 164 transition count 366
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1495 place count 164 transition count 355
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1501 place count 158 transition count 347
Iterating global reduction 8 with 6 rules applied. Total rules applied 1507 place count 158 transition count 347
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1510 place count 155 transition count 340
Iterating global reduction 8 with 3 rules applied. Total rules applied 1513 place count 155 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1515 place count 155 transition count 338
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 9 with 24 rules applied. Total rules applied 1539 place count 143 transition count 324
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1553 place count 143 transition count 310
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -46
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 1587 place count 126 transition count 356
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 1604 place count 126 transition count 339
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1613 place count 117 transition count 321
Iterating global reduction 11 with 9 rules applied. Total rules applied 1622 place count 117 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1628 place count 117 transition count 315
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 1664 place count 117 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1665 place count 116 transition count 278
Applied a total of 1665 rules in 78 ms. Remains 116 /1540 variables (removed 1424) and now considering 278/1968 (removed 1690) transitions.
[2024-05-21 06:47:36] [INFO ] Flow matrix only has 219 transitions (discarded 59 similar events)
// Phase 1: matrix 219 rows 116 cols
[2024-05-21 06:47:36] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 06:47:37] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 06:47:37] [INFO ] Flow matrix only has 219 transitions (discarded 59 similar events)
[2024-05-21 06:47:37] [INFO ] Invariant cache hit.
[2024-05-21 06:47:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:47:37] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 179 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1540 places, 278/1968 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 277
Applied a total of 2 rules in 5 ms. Remains 114 /115 variables (removed 1) and now considering 277/278 (removed 1) transitions.
[2024-05-21 06:47:37] [INFO ] Flow matrix only has 218 transitions (discarded 59 similar events)
// Phase 1: matrix 218 rows 114 cols
[2024-05-21 06:47:37] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 06:47:37] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 06:47:37] [INFO ] Flow matrix only has 218 transitions (discarded 59 similar events)
[2024-05-21 06:47:37] [INFO ] Invariant cache hit.
[2024-05-21 06:47:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:47:37] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1540 places, 277/1968 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 435 ms. Remains : 114/1540 places, 277/1968 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-14
Product exploration explored 100000 steps with 13266 reset in 139 ms.
Product exploration explored 100000 steps with 13138 reset in 114 ms.
Computed a total of 6 stabilizing places and 34 stable transitions
Computed a total of 6 stabilizing places and 34 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 38081 steps (5956 resets) in 62 ms. (604 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 277/277 transitions.
Applied a total of 0 rules in 7 ms. Remains 114 /114 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-05-21 06:47:38] [INFO ] Flow matrix only has 218 transitions (discarded 59 similar events)
[2024-05-21 06:47:38] [INFO ] Invariant cache hit.
[2024-05-21 06:47:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 06:47:38] [INFO ] Flow matrix only has 218 transitions (discarded 59 similar events)
[2024-05-21 06:47:38] [INFO ] Invariant cache hit.
[2024-05-21 06:47:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:47:38] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-21 06:47:38] [INFO ] Redundant transitions in 24 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-21 06:47:38] [INFO ] Flow matrix only has 218 transitions (discarded 59 similar events)
[2024-05-21 06:47:38] [INFO ] Invariant cache hit.
[2024-05-21 06:47:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 217/330 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/331 variables, 1/117 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/117 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 1/332 variables, 1/118 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/118 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 0/332 variables, 0/118 constraints. Problems are: Problem set: 15 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 118 constraints, problems are : Problem set: 15 solved, 257 unsolved in 9049 ms.
Refiners :[State Equation: 114/114 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 217/330 variables, 113/113 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 3/116 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 257/373 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/373 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 1/331 variables, 1/374 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/374 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 1/332 variables, 1/375 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/375 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/332 variables, 0/375 constraints. Problems are: Problem set: 15 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 375 constraints, problems are : Problem set: 15 solved, 257 unsolved in 15741 ms.
Refiners :[State Equation: 114/114 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 257/272 constraints, Known Traps: 0/0 constraints]
After SMT, in 24923ms problems are : Problem set: 15 solved, 257 unsolved
Search for dead transitions found 15 dead transitions in 24926ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 114/114 places, 262/277 transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 107 transition count 244
Applied a total of 7 rules in 10 ms. Remains 107 /114 variables (removed 7) and now considering 244/262 (removed 18) transitions.
[2024-05-21 06:48:03] [INFO ] Flow matrix only has 191 transitions (discarded 53 similar events)
// Phase 1: matrix 191 rows 107 cols
[2024-05-21 06:48:03] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:48:03] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 06:48:03] [INFO ] Flow matrix only has 191 transitions (discarded 53 similar events)
[2024-05-21 06:48:03] [INFO ] Invariant cache hit.
[2024-05-21 06:48:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:48:03] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/114 places, 244/277 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25287 ms. Remains : 107/114 places, 244/277 transitions.
Computed a total of 6 stabilizing places and 19 stable transitions
Computed a total of 6 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 26200 steps (4057 resets) in 42 ms. (609 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13149 reset in 104 ms.
Product exploration explored 100000 steps with 13233 reset in 110 ms.
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 244/244 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2024-05-21 06:48:04] [INFO ] Flow matrix only has 191 transitions (discarded 53 similar events)
[2024-05-21 06:48:04] [INFO ] Invariant cache hit.
[2024-05-21 06:48:04] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 06:48:04] [INFO ] Flow matrix only has 191 transitions (discarded 53 similar events)
[2024-05-21 06:48:04] [INFO ] Invariant cache hit.
[2024-05-21 06:48:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 06:48:04] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-21 06:48:04] [INFO ] Redundant transitions in 16 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-21 06:48:04] [INFO ] Flow matrix only has 191 transitions (discarded 53 similar events)
[2024-05-21 06:48:04] [INFO ] Invariant cache hit.
[2024-05-21 06:48:04] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 190/296 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 1/297 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 1/298 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 0/298 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 111 constraints, problems are : Problem set: 0 solved, 239 unsolved in 7409 ms.
Refiners :[State Equation: 107/107 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 190/296 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 239/348 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 1/297 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 350 constraints, problems are : Problem set: 0 solved, 239 unsolved in 11816 ms.
Refiners :[State Equation: 107/107 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints]
After SMT, in 19324ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 19327ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19496 ms. Remains : 107/107 places, 244/244 transitions.
Treatment of property CloudReconfiguration-PT-317-LTLFireability-14 finished in 46931 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((p0||F(G(p1)))))))'
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1526 transition count 1954
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1526 transition count 1954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 1526 transition count 1951
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 1520 transition count 1945
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 1520 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1518 transition count 1943
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1518 transition count 1943
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 1518 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1517 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1517 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1516 transition count 1940
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1515 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1514 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1513 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1512 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1510 transition count 1934
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1510 transition count 1934
Applied a total of 64 rules in 507 ms. Remains 1510 /1540 variables (removed 30) and now considering 1934/1968 (removed 34) transitions.
// Phase 1: matrix 1934 rows 1510 cols
[2024-05-21 06:48:24] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 06:48:24] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 06:48:24] [INFO ] Invariant cache hit.
[2024-05-21 06:48:25] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2024-05-21 06:48:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 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/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 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 1509/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints]
After SMT, in 60531ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60547ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1540 places, 1934/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62243 ms. Remains : 1510/1540 places, 1934/1968 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-15
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-317-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-317-LTLFireability-15 finished in 62483 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))))'
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||X(p1))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-317-LTLFireability-07
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1871 edges and 1540 vertex of which 694 / 1540 are part of one of the 63 SCC in 2 ms
Free SCC test removed 631 places
Ensure Unique test removed 731 transitions
Reduce isomorphic transitions removed 731 transitions.
Graph (complete) has 1418 edges and 909 vertex of which 900 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 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 899 transition count 735
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 521 rules applied. Total rules applied 1019 place count 403 transition count 710
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 1033 place count 391 transition count 708
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 3 with 3 rules applied. Total rules applied 1036 place count 390 transition count 706
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1038 place count 389 transition count 705
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 47 Pre rules applied. Total rules applied 1038 place count 389 transition count 658
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 1132 place count 342 transition count 658
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1145 place count 329 transition count 638
Iterating global reduction 5 with 13 rules applied. Total rules applied 1158 place count 329 transition count 638
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 1 rules applied. Total rules applied 1159 place count 329 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1160 place count 328 transition count 637
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1160 place count 328 transition count 636
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1162 place count 327 transition count 636
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1171 place count 318 transition count 624
Iterating global reduction 7 with 9 rules applied. Total rules applied 1180 place count 318 transition count 624
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1184 place count 318 transition count 620
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1185 place count 317 transition count 618
Iterating global reduction 8 with 1 rules applied. Total rules applied 1186 place count 317 transition count 618
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1187 place count 316 transition count 616
Iterating global reduction 8 with 1 rules applied. Total rules applied 1188 place count 316 transition count 616
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1189 place count 315 transition count 614
Iterating global reduction 8 with 1 rules applied. Total rules applied 1190 place count 315 transition count 614
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1191 place count 314 transition count 612
Iterating global reduction 8 with 1 rules applied. Total rules applied 1192 place count 314 transition count 612
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1193 place count 313 transition count 610
Iterating global reduction 8 with 1 rules applied. Total rules applied 1194 place count 313 transition count 610
Performed 141 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 8 with 282 rules applied. Total rules applied 1476 place count 172 transition count 387
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1489 place count 172 transition count 374
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1494 place count 167 transition count 368
Iterating global reduction 9 with 5 rules applied. Total rules applied 1499 place count 167 transition count 368
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1501 place count 165 transition count 366
Iterating global reduction 9 with 2 rules applied. Total rules applied 1503 place count 165 transition count 366
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1505 place count 165 transition count 364
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 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 1527 place count 154 transition count 351
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1541 place count 154 transition count 337
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1542 place count 153 transition count 335
Iterating global reduction 11 with 1 rules applied. Total rules applied 1543 place count 153 transition count 335
Performed 20 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 11 with 40 rules applied. Total rules applied 1583 place count 133 transition count 384
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1604 place count 133 transition count 363
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1613 place count 124 transition count 345
Iterating global reduction 12 with 9 rules applied. Total rules applied 1622 place count 124 transition count 345
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1628 place count 124 transition count 339
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1629 place count 123 transition count 338
Applied a total of 1629 rules in 93 ms. Remains 123 /1540 variables (removed 1417) and now considering 338/1968 (removed 1630) transitions.
[2024-05-21 06:49:26] [INFO ] Flow matrix only has 277 transitions (discarded 61 similar events)
// Phase 1: matrix 277 rows 123 cols
[2024-05-21 06:49:26] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 06:49:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 06:49:26] [INFO ] Flow matrix only has 277 transitions (discarded 61 similar events)
[2024-05-21 06:49:26] [INFO ] Invariant cache hit.
[2024-05-21 06:49:26] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 06:49:26] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 184 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 122/1540 places, 338/1968 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 337
Applied a total of 2 rules in 5 ms. Remains 121 /122 variables (removed 1) and now considering 337/338 (removed 1) transitions.
[2024-05-21 06:49:26] [INFO ] Flow matrix only has 276 transitions (discarded 61 similar events)
// Phase 1: matrix 276 rows 121 cols
[2024-05-21 06:49:26] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:49:26] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 06:49:26] [INFO ] Flow matrix only has 276 transitions (discarded 61 similar events)
[2024-05-21 06:49:26] [INFO ] Invariant cache hit.
[2024-05-21 06:49:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 06:49:27] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 121/1540 places, 337/1968 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 452 ms. Remains : 121/1540 places, 337/1968 transitions.
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-07
Product exploration explored 100000 steps with 13180 reset in 127 ms.
Product exploration explored 100000 steps with 13142 reset in 136 ms.
Computed a total of 6 stabilizing places and 34 stable transitions
Computed a total of 6 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 28669 steps (4457 resets) in 330 ms. (86 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 337/337 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 337/337 (removed 0) transitions.
[2024-05-21 06:49:28] [INFO ] Flow matrix only has 276 transitions (discarded 61 similar events)
[2024-05-21 06:49:28] [INFO ] Invariant cache hit.
[2024-05-21 06:49:28] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 06:49:28] [INFO ] Flow matrix only has 276 transitions (discarded 61 similar events)
[2024-05-21 06:49:28] [INFO ] Invariant cache hit.
[2024-05-21 06:49:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 06:49:28] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-21 06:49:28] [INFO ] Flow matrix only has 276 transitions (discarded 61 similar events)
[2024-05-21 06:49:28] [INFO ] Invariant cache hit.
[2024-05-21 06:49:28] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (OVERLAPS) 275/395 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/396 variables, 1/129 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/129 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 6 (OVERLAPS) 1/397 variables, 1/130 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/130 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 8 (OVERLAPS) 0/397 variables, 0/130 constraints. Problems are: Problem set: 15 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 130 constraints, problems are : Problem set: 15 solved, 317 unsolved in 12157 ms.
Refiners :[State Equation: 121/121 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 275/395 variables, 120/120 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 8/128 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 317/445 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/445 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 5 (OVERLAPS) 1/396 variables, 1/446 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/446 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/447 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/447 constraints. Problems are: Problem set: 15 solved, 317 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/447 constraints. Problems are: Problem set: 15 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 447 constraints, problems are : Problem set: 15 solved, 317 unsolved in 18712 ms.
Refiners :[State Equation: 121/121 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 317/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 31076ms problems are : Problem set: 15 solved, 317 unsolved
Search for dead transitions found 15 dead transitions in 31080ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 121/121 places, 322/337 transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 23 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 114 transition count 299
Applied a total of 7 rules in 8 ms. Remains 114 /121 variables (removed 7) and now considering 299/322 (removed 23) transitions.
[2024-05-21 06:49:59] [INFO ] Flow matrix only has 244 transitions (discarded 55 similar events)
// Phase 1: matrix 244 rows 114 cols
[2024-05-21 06:49:59] [INFO ] Computed 0 invariants in 4 ms
[2024-05-21 06:49:59] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 06:49:59] [INFO ] Flow matrix only has 244 transitions (discarded 55 similar events)
[2024-05-21 06:49:59] [INFO ] Invariant cache hit.
[2024-05-21 06:49:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 06:49:59] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 114/121 places, 299/337 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31516 ms. Remains : 114/121 places, 299/337 transitions.
Computed a total of 6 stabilizing places and 19 stable transitions
Computed a total of 6 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 33513 steps (5155 resets) in 380 ms. (87 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 194 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 13133 reset in 114 ms.
Product exploration explored 100000 steps with 13106 reset in 119 ms.
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 299/299 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-05-21 06:50:00] [INFO ] Flow matrix only has 244 transitions (discarded 55 similar events)
[2024-05-21 06:50:00] [INFO ] Invariant cache hit.
[2024-05-21 06:50:00] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 06:50:00] [INFO ] Flow matrix only has 244 transitions (discarded 55 similar events)
[2024-05-21 06:50:00] [INFO ] Invariant cache hit.
[2024-05-21 06:50:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 06:50:00] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-21 06:50:00] [INFO ] Flow matrix only has 244 transitions (discarded 55 similar events)
[2024-05-21 06:50:00] [INFO ] Invariant cache hit.
[2024-05-21 06:50:00] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 243/356 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 1/357 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 1/358 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 0/358 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 123 constraints, problems are : Problem set: 0 solved, 294 unsolved in 10303 ms.
Refiners :[State Equation: 114/114 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 243/356 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 294/415 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 1/357 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 1/358 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 417 constraints, problems are : Problem set: 0 solved, 294 unsolved in 14792 ms.
Refiners :[State Equation: 114/114 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
After SMT, in 25243ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 25246ms
Finished structural reductions in LTL mode , in 1 iterations and 25425 ms. Remains : 114/114 places, 299/299 transitions.
Treatment of property CloudReconfiguration-PT-317-LTLFireability-07 finished in 59816 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))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-317-LTLFireability-11
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1540 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1540/1540 places, 1968/1968 transitions.
Graph (trivial) has 1874 edges and 1540 vertex of which 698 / 1540 are part of one of the 63 SCC in 1 ms
Free SCC test removed 635 places
Ensure Unique test removed 739 transitions
Reduce isomorphic transitions removed 739 transitions.
Graph (complete) has 1410 edges and 905 vertex of which 896 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 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 895 transition count 727
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 519 rules applied. Total rules applied 1017 place count 399 transition count 704
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1028 place count 388 transition count 704
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1028 place count 388 transition count 657
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1122 place count 341 transition count 657
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1136 place count 327 transition count 635
Iterating global reduction 3 with 14 rules applied. Total rules applied 1150 place count 327 transition count 635
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1151 place count 327 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1152 place count 326 transition count 634
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1152 place count 326 transition count 633
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1154 place count 325 transition count 633
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1164 place count 315 transition count 619
Iterating global reduction 5 with 10 rules applied. Total rules applied 1174 place count 315 transition count 619
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1178 place count 315 transition count 615
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1180 place count 313 transition count 611
Iterating global reduction 6 with 2 rules applied. Total rules applied 1182 place count 313 transition count 611
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1184 place count 311 transition count 607
Iterating global reduction 6 with 2 rules applied. Total rules applied 1186 place count 311 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1187 place count 310 transition count 605
Iterating global reduction 6 with 1 rules applied. Total rules applied 1188 place count 310 transition count 605
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1189 place count 309 transition count 603
Iterating global reduction 6 with 1 rules applied. Total rules applied 1190 place count 309 transition count 603
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1191 place count 308 transition count 601
Iterating global reduction 6 with 1 rules applied. Total rules applied 1192 place count 308 transition count 601
Performed 141 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 6 with 282 rules applied. Total rules applied 1474 place count 167 transition count 378
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1487 place count 167 transition count 365
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1493 place count 161 transition count 357
Iterating global reduction 7 with 6 rules applied. Total rules applied 1499 place count 161 transition count 357
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1502 place count 158 transition count 350
Iterating global reduction 7 with 3 rules applied. Total rules applied 1505 place count 158 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1507 place count 158 transition count 348
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1531 place count 146 transition count 334
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1544 place count 146 transition count 321
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1545 place count 145 transition count 319
Iterating global reduction 9 with 1 rules applied. Total rules applied 1546 place count 145 transition count 319
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1580 place count 128 transition count 371
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 1603 place count 128 transition count 348
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1612 place count 119 transition count 330
Iterating global reduction 10 with 9 rules applied. Total rules applied 1621 place count 119 transition count 330
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1627 place count 119 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1628 place count 118 transition count 323
Applied a total of 1628 rules in 59 ms. Remains 118 /1540 variables (removed 1422) and now considering 323/1968 (removed 1645) transitions.
[2024-05-21 06:50:26] [INFO ] Flow matrix only has 264 transitions (discarded 59 similar events)
// Phase 1: matrix 264 rows 118 cols
[2024-05-21 06:50:26] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 06:50:26] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-21 06:50:26] [INFO ] Flow matrix only has 264 transitions (discarded 59 similar events)
[2024-05-21 06:50:26] [INFO ] Invariant cache hit.
[2024-05-21 06:50:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 06:50:27] [INFO ] Implicit Places using invariants and state equation in 197 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 587 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/1540 places, 323/1968 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 322
Applied a total of 2 rules in 4 ms. Remains 116 /117 variables (removed 1) and now considering 322/323 (removed 1) transitions.
[2024-05-21 06:50:27] [INFO ] Flow matrix only has 263 transitions (discarded 59 similar events)
// Phase 1: matrix 263 rows 116 cols
[2024-05-21 06:50:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 06:50:27] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-21 06:50:27] [INFO ] Flow matrix only has 263 transitions (discarded 59 similar events)
[2024-05-21 06:50:27] [INFO ] Invariant cache hit.
[2024-05-21 06:50:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 06:50:27] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 116/1540 places, 322/1968 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 979 ms. Remains : 116/1540 places, 322/1968 transitions.
Running random walk in product with property : CloudReconfiguration-PT-317-LTLFireability-11
Entered a terminal (fully accepting) state of product in 28475 steps with 3784 reset in 33 ms.
Treatment of property CloudReconfiguration-PT-317-LTLFireability-11 finished in 1237 ms.
FORMULA CloudReconfiguration-PT-317-LTLFireability-11 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' '!(G(F(p0)))'
[2024-05-21 06:50:27] [INFO ] Flatten gal took : 136 ms
[2024-05-21 06:50:27] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 06:50:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1540 places, 1968 transitions and 4117 arcs took 12 ms.
Total runtime 1066534 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudReconfiguration-PT-317

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1540
TRANSITIONS: 1968
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.000s]


SAVING FILE /home/mcc/execution/409/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: 1858
MODEL NAME: /home/mcc/execution/409/model
1540 places, 1968 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-317-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudReconfiguration-PT-317-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudReconfiguration-PT-317-LTLFireability-06 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-317-LTLFireability-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716274798359

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

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

MEDDLY ERROR: Insufficient memory