About the Execution of ITS-Tools for CloudReconfiguration-PT-316
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3923.668 | 1202268.00 | 1803288.00 | 2986.40 | FFFTFFFFTFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r092-tall-171624188900235.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 itstools
Input is CloudReconfiguration-PT-316, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624188900235
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 19:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 19:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 19:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-316-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716277600099
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-316
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 07:46:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 07:46:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:46:41] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2024-05-21 07:46:41] [INFO ] Transformed 2585 places.
[2024-05-21 07:46:41] [INFO ] Transformed 3095 transitions.
[2024-05-21 07:46:41] [INFO ] Found NUPN structural information;
[2024-05-21 07:46:41] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 513 places :
Symmetric choice reduction at 0 with 513 rule applications. Total rules 513 place count 2072 transition count 2582
Iterating global reduction 0 with 513 rules applied. Total rules applied 1026 place count 2072 transition count 2582
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1055 place count 2072 transition count 2553
Discarding 235 places :
Symmetric choice reduction at 1 with 235 rule applications. Total rules 1290 place count 1837 transition count 2318
Iterating global reduction 1 with 235 rules applied. Total rules applied 1525 place count 1837 transition count 2318
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 1610 place count 1752 transition count 2233
Iterating global reduction 1 with 85 rules applied. Total rules applied 1695 place count 1752 transition count 2233
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1711 place count 1752 transition count 2217
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1753 place count 1710 transition count 2175
Iterating global reduction 2 with 42 rules applied. Total rules applied 1795 place count 1710 transition count 2175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1801 place count 1710 transition count 2169
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1834 place count 1677 transition count 2132
Iterating global reduction 3 with 33 rules applied. Total rules applied 1867 place count 1677 transition count 2132
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1892 place count 1652 transition count 2107
Iterating global reduction 3 with 25 rules applied. Total rules applied 1917 place count 1652 transition count 2107
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1941 place count 1628 transition count 2083
Iterating global reduction 3 with 24 rules applied. Total rules applied 1965 place count 1628 transition count 2083
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1988 place count 1605 transition count 2060
Iterating global reduction 3 with 23 rules applied. Total rules applied 2011 place count 1605 transition count 2060
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 2031 place count 1585 transition count 2027
Iterating global reduction 3 with 20 rules applied. Total rules applied 2051 place count 1585 transition count 2027
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2058 place count 1578 transition count 2015
Iterating global reduction 3 with 7 rules applied. Total rules applied 2065 place count 1578 transition count 2015
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2072 place count 1571 transition count 2006
Iterating global reduction 3 with 7 rules applied. Total rules applied 2079 place count 1571 transition count 2006
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2082 place count 1571 transition count 2003
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2084 place count 1569 transition count 2001
Iterating global reduction 4 with 2 rules applied. Total rules applied 2086 place count 1569 transition count 2001
Applied a total of 2086 rules in 2517 ms. Remains 1569 /2585 variables (removed 1016) and now considering 2001/3095 (removed 1094) transitions.
// Phase 1: matrix 2001 rows 1569 cols
[2024-05-21 07:46:44] [INFO ] Computed 4 invariants in 32 ms
[2024-05-21 07:46:45] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-05-21 07:46:45] [INFO ] Invariant cache hit.
[2024-05-21 07:46:47] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 2239 ms to find 0 implicit places.
Running 2000 sub problems to find dead transitions.
[2024-05-21 07:46:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1568 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1568/3570 variables, and 4 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30098 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1569 constraints, PredecessorRefiner: 2000/2000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1568 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1568/3570 variables, and 4 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1569 constraints, PredecessorRefiner: 0/2000 constraints, Known Traps: 0/0 constraints]
After SMT, in 61147ms problems are : Problem set: 0 solved, 2000 unsolved
Search for dead transitions found 0 dead transitions in 61226ms
Starting structural reductions in LTL mode, iteration 1 : 1569/2585 places, 2001/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66045 ms. Remains : 1569/2585 places, 2001/3095 transitions.
Support contains 40 out of 1569 places after structural reductions.
[2024-05-21 07:47:48] [INFO ] Flatten gal took : 202 ms
[2024-05-21 07:47:49] [INFO ] Flatten gal took : 86 ms
[2024-05-21 07:47:49] [INFO ] Input system was already deterministic with 2001 transitions.
Support contains 38 out of 1569 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (318 resets) in 2863 ms. (13 steps per ms) remains 16/20 properties
BEST_FIRST walk for 4002 steps (9 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 90 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (12 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (11 resets) in 90 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (12 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 104 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (11 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (11 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
[2024-05-21 07:47:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1528/1558 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1558 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1991/3549 variables, 1558/1562 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3549 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 2/3551 variables, 1/1563 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3551 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2/3553 variables, 1/1564 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3553 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 2/3555 variables, 1/1565 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3555 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 2/3557 variables, 1/1566 constraints. Problems are: Problem set: 0 solved, 16 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 3557/3570 variables, and 1566 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1562/1569 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1528/1558 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1558 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1991/3549 variables, 1558/1562 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3549 variables, 16/1578 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3549 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 2/3551 variables, 1/1579 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3551 variables, 0/1579 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 2/3553 variables, 1/1580 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3553 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 2/3555 variables, 1/1581 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3555 variables, 0/1581 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 2/3557 variables, 1/1582 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3557 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 2/3559 variables, 1/1583 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3559/3570 variables, and 1583 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1563/1569 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 10080ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 1569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Graph (trivial) has 1851 edges and 1569 vertex of which 656 / 1569 are part of one of the 61 SCC in 8 ms
Free SCC test removed 595 places
Drop transitions (Empty/Sink Transition effects.) removed 749 transitions
Reduce isomorphic transitions removed 749 transitions.
Graph (complete) has 1425 edges and 974 vertex of which 965 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 516 transitions
Trivial Post-agglo rules discarded 516 transitions
Performed 516 trivial Post agglomeration. Transition count delta: 516
Iterating post reduction 0 with 523 rules applied. Total rules applied 525 place count 965 transition count 725
Reduce places removed 516 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 563 rules applied. Total rules applied 1088 place count 449 transition count 678
Reduce places removed 29 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 31 rules applied. Total rules applied 1119 place count 420 transition count 676
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 3 with 8 rules applied. Total rules applied 1127 place count 419 transition count 669
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1135 place count 412 transition count 668
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 50 Pre rules applied. Total rules applied 1135 place count 412 transition count 618
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 1235 place count 362 transition count 618
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1242 place count 355 transition count 610
Iterating global reduction 5 with 7 rules applied. Total rules applied 1249 place count 355 transition count 610
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 1250 place count 355 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1251 place count 354 transition count 609
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1257 place count 348 transition count 603
Iterating global reduction 7 with 6 rules applied. Total rules applied 1263 place count 348 transition count 603
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1269 place count 348 transition count 597
Performed 161 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 8 with 322 rules applied. Total rules applied 1591 place count 187 transition count 344
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 1611 place count 187 transition count 324
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1614 place count 184 transition count 321
Iterating global reduction 9 with 3 rules applied. Total rules applied 1617 place count 184 transition count 321
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1639 place count 173 transition count 309
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1651 place count 173 transition count 297
Performed 39 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 10 with 78 rules applied. Total rules applied 1729 place count 134 transition count 337
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 1756 place count 134 transition count 310
Discarding 17 places :
Symmetric choice reduction at 11 with 17 rule applications. Total rules 1773 place count 117 transition count 276
Iterating global reduction 11 with 17 rules applied. Total rules applied 1790 place count 117 transition count 276
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1795 place count 117 transition count 271
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1799 place count 113 transition count 263
Iterating global reduction 12 with 4 rules applied. Total rules applied 1803 place count 113 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1805 place count 113 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 13 with 18 rules applied. Total rules applied 1823 place count 113 transition count 243
Free-agglomeration rule applied 7 times.
Iterating global reduction 13 with 7 rules applied. Total rules applied 1830 place count 113 transition count 236
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 1837 place count 106 transition count 236
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 1842 place count 106 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1843 place count 105 transition count 235
Applied a total of 1843 rules in 376 ms. Remains 105 /1569 variables (removed 1464) and now considering 235/2001 (removed 1766) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 105/1569 places, 235/2001 transitions.
RANDOM walk for 40000 steps (443 resets) in 990 ms. (40 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40003 steps (109 resets) in 158 ms. (251 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
[2024-05-21 07:48:01] [INFO ] Flow matrix only has 222 transitions (discarded 13 similar events)
// Phase 1: matrix 222 rows 105 cols
[2024-05-21 07:48:01] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 07:48:01] [INFO ] State equation strengthened by 4 read => feed constraints.
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) 45/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/162 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/222 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:48:01] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/241 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 308/327 variables, and 98 constraints, problems are : Problem set: 1 solved, 0 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 3/4 constraints, State Equation: 92/105 constraints, ReadFeed: 2/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 230ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2179 edges and 1569 vertex of which 1560 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.27 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Graph (trivial) has 1910 edges and 1569 vertex of which 706 / 1569 are part of one of the 63 SCC in 3 ms
Free SCC test removed 643 places
Ensure Unique test removed 747 transitions
Reduce isomorphic transitions removed 747 transitions.
Graph (complete) has 1426 edges and 926 vertex of which 917 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 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 515 place count 916 transition count 735
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 537 rules applied. Total rules applied 1052 place count 403 transition count 711
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 1064 place count 392 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1065 place count 391 transition count 710
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1065 place count 391 transition count 665
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1155 place count 346 transition count 665
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1168 place count 333 transition count 646
Iterating global reduction 4 with 13 rules applied. Total rules applied 1181 place count 333 transition count 646
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 1182 place count 333 transition count 645
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1183 place count 332 transition count 645
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1192 place count 323 transition count 633
Iterating global reduction 6 with 9 rules applied. Total rules applied 1201 place count 323 transition count 633
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1207 place count 323 transition count 627
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1208 place count 322 transition count 625
Iterating global reduction 7 with 1 rules applied. Total rules applied 1209 place count 322 transition count 625
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1210 place count 321 transition count 623
Iterating global reduction 7 with 1 rules applied. Total rules applied 1211 place count 321 transition count 623
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1212 place count 320 transition count 621
Iterating global reduction 7 with 1 rules applied. Total rules applied 1213 place count 320 transition count 621
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1214 place count 319 transition count 619
Iterating global reduction 7 with 1 rules applied. Total rules applied 1215 place count 319 transition count 619
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1216 place count 318 transition count 617
Iterating global reduction 7 with 1 rules applied. Total rules applied 1217 place count 318 transition count 617
Performed 151 Post agglomeration using F-continuation condition with reduction of 91 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 7 with 302 rules applied. Total rules applied 1519 place count 167 transition count 375
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1534 place count 167 transition count 360
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1540 place count 161 transition count 351
Iterating global reduction 8 with 6 rules applied. Total rules applied 1546 place count 161 transition count 351
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1547 place count 160 transition count 349
Iterating global reduction 8 with 1 rules applied. Total rules applied 1548 place count 160 transition count 349
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1549 place count 159 transition count 347
Iterating global reduction 8 with 1 rules applied. Total rules applied 1550 place count 159 transition count 347
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1551 place count 158 transition count 345
Iterating global reduction 8 with 1 rules applied. Total rules applied 1552 place count 158 transition count 345
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1553 place count 157 transition count 343
Iterating global reduction 8 with 1 rules applied. Total rules applied 1554 place count 157 transition count 343
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1574 place count 147 transition count 332
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1584 place count 147 transition count 322
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1586 place count 145 transition count 316
Iterating global reduction 9 with 2 rules applied. Total rules applied 1588 place count 145 transition count 316
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 9 with 2 rules applied. Total rules applied 1590 place count 144 transition count 315
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1591 place count 143 transition count 309
Iterating global reduction 9 with 1 rules applied. Total rules applied 1592 place count 143 transition count 309
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -35
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 1626 place count 126 transition count 344
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 1644 place count 126 transition count 326
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1653 place count 117 transition count 308
Iterating global reduction 10 with 9 rules applied. Total rules applied 1662 place count 117 transition count 308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1667 place count 117 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 11 with 35 rules applied. Total rules applied 1702 place count 117 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1703 place count 116 transition count 267
Applied a total of 1703 rules in 188 ms. Remains 116 /1569 variables (removed 1453) and now considering 267/2001 (removed 1734) transitions.
[2024-05-21 07:48:02] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 116 cols
[2024-05-21 07:48:02] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 07:48:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 07:48:02] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2024-05-21 07:48:02] [INFO ] Invariant cache hit.
[2024-05-21 07:48:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 07:48:02] [INFO ] Implicit Places using invariants and state equation in 358 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 455 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1569 places, 267/2001 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 265
Applied a total of 2 rules in 7 ms. Remains 112 /114 variables (removed 2) and now considering 265/267 (removed 2) transitions.
[2024-05-21 07:48:02] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 112 cols
[2024-05-21 07:48:02] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 07:48:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 07:48:02] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-21 07:48:02] [INFO ] Invariant cache hit.
[2024-05-21 07:48:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 07:48:02] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1569 places, 265/2001 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 984 ms. Remains : 112/1569 places, 265/2001 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-00 finished in 1188 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))&&F(p1))))'
Support contains 3 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1545 transition count 1977
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1545 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1545 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 1530 transition count 1959
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 1530 transition count 1959
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 1530 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 1524 transition count 1950
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 1524 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 1524 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 1521 transition count 1946
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 1518 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 1518 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 1515 transition count 1939
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 1509 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 1507 transition count 1929
Applied a total of 129 rules in 581 ms. Remains 1507 /1569 variables (removed 62) and now considering 1929/2001 (removed 72) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 07:48:03] [INFO ] Computed 4 invariants in 11 ms
[2024-05-21 07:48:04] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-21 07:48:04] [INFO ] Invariant cache hit.
[2024-05-21 07:48:05] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 07:48:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60860ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60878ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1569 places, 1929/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62899 ms. Remains : 1507/1569 places, 1929/2001 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-01 finished in 63119 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 3 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Graph (trivial) has 1907 edges and 1569 vertex of which 695 / 1569 are part of one of the 63 SCC in 4 ms
Free SCC test removed 632 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1440 edges and 937 vertex of which 928 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 519 transitions
Trivial Post-agglo rules discarded 519 transitions
Performed 519 trivial Post agglomeration. Transition count delta: 519
Iterating post reduction 0 with 519 rules applied. Total rules applied 521 place count 927 transition count 743
Reduce places removed 519 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 540 rules applied. Total rules applied 1061 place count 408 transition count 722
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 1072 place count 398 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1073 place count 397 transition count 721
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1073 place count 397 transition count 675
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1165 place count 351 transition count 675
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1178 place count 338 transition count 657
Iterating global reduction 4 with 13 rules applied. Total rules applied 1191 place count 338 transition count 657
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 1192 place count 338 transition count 656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1193 place count 337 transition count 656
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1202 place count 328 transition count 644
Iterating global reduction 6 with 9 rules applied. Total rules applied 1211 place count 328 transition count 644
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1217 place count 328 transition count 638
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1219 place count 326 transition count 634
Iterating global reduction 7 with 2 rules applied. Total rules applied 1221 place count 326 transition count 634
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1222 place count 325 transition count 632
Iterating global reduction 7 with 1 rules applied. Total rules applied 1223 place count 325 transition count 632
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1224 place count 324 transition count 630
Iterating global reduction 7 with 1 rules applied. Total rules applied 1225 place count 324 transition count 630
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1226 place count 323 transition count 628
Iterating global reduction 7 with 1 rules applied. Total rules applied 1227 place count 323 transition count 628
Performed 151 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 7 with 302 rules applied. Total rules applied 1529 place count 172 transition count 390
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 1546 place count 172 transition count 373
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1552 place count 166 transition count 364
Iterating global reduction 8 with 6 rules applied. Total rules applied 1558 place count 166 transition count 364
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1559 place count 165 transition count 362
Iterating global reduction 8 with 1 rules applied. Total rules applied 1560 place count 165 transition count 362
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1561 place count 164 transition count 360
Iterating global reduction 8 with 1 rules applied. Total rules applied 1562 place count 164 transition count 360
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1563 place count 163 transition count 358
Iterating global reduction 8 with 1 rules applied. Total rules applied 1564 place count 163 transition count 358
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1565 place count 162 transition count 356
Iterating global reduction 8 with 1 rules applied. Total rules applied 1566 place count 162 transition count 356
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1590 place count 150 transition count 343
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1603 place count 150 transition count 330
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1604 place count 149 transition count 328
Iterating global reduction 9 with 1 rules applied. Total rules applied 1605 place count 149 transition count 328
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1643 place count 130 transition count 368
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 1668 place count 130 transition count 343
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 1678 place count 120 transition count 320
Iterating global reduction 10 with 10 rules applied. Total rules applied 1688 place count 120 transition count 320
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1694 place count 120 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 11 with 38 rules applied. Total rules applied 1732 place count 120 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1733 place count 119 transition count 275
Applied a total of 1733 rules in 105 ms. Remains 119 /1569 variables (removed 1450) and now considering 275/2001 (removed 1726) transitions.
[2024-05-21 07:49:06] [INFO ] Flow matrix only has 218 transitions (discarded 57 similar events)
// Phase 1: matrix 218 rows 119 cols
[2024-05-21 07:49:06] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 07:49:06] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 07:49:06] [INFO ] Flow matrix only has 218 transitions (discarded 57 similar events)
[2024-05-21 07:49:06] [INFO ] Invariant cache hit.
[2024-05-21 07:49:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:49:06] [INFO ] Implicit Places using invariants and state equation in 148 ms returned [12, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 283 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1569 places, 275/2001 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 273
Applied a total of 2 rules in 6 ms. Remains 115 /117 variables (removed 2) and now considering 273/275 (removed 2) transitions.
[2024-05-21 07:49:06] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
// Phase 1: matrix 216 rows 115 cols
[2024-05-21 07:49:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 07:49:06] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 07:49:06] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-21 07:49:06] [INFO ] Invariant cache hit.
[2024-05-21 07:49:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 07:49:07] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1569 places, 273/2001 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 784 ms. Remains : 115/1569 places, 273/2001 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-02
Product exploration explored 100000 steps with 9595 reset in 244 ms.
Product exploration explored 100000 steps with 9664 reset in 158 ms.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4776 resets) in 705 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (374 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 28176 steps, run visited all 1 properties in 56 ms. (steps per millisecond=503 )
Probabilistic random walk after 28176 steps, saw 6921 distinct states, run finished after 58 ms. (steps per millisecond=485 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 273/273 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2024-05-21 07:49:08] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-21 07:49:08] [INFO ] Invariant cache hit.
[2024-05-21 07:49:08] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 07:49:08] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-21 07:49:08] [INFO ] Invariant cache hit.
[2024-05-21 07:49:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 07:49:08] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-21 07:49:08] [INFO ] Redundant transitions in 63 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-21 07:49:08] [INFO ] Flow matrix only has 216 transitions (discarded 57 similar events)
[2024-05-21 07:49:08] [INFO ] Invariant cache hit.
[2024-05-21 07:49:08] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 215/328 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/330 variables, 2/118 constraints. Problems are: Problem set: 5 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/118 constraints. Problems are: Problem set: 5 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 0/330 variables, 0/118 constraints. Problems are: Problem set: 5 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 118 constraints, problems are : Problem set: 5 solved, 260 unsolved in 6847 ms.
Refiners :[State Equation: 115/115 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 215/328 variables, 113/113 constraints. Problems are: Problem set: 5 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 3/116 constraints. Problems are: Problem set: 5 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 191/307 constraints. Problems are: Problem set: 5 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/307 constraints. Problems are: Problem set: 5 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 2/330 variables, 2/309 constraints. Problems are: Problem set: 5 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 69/378 constraints. Problems are: Problem set: 5 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/378 constraints. Problems are: Problem set: 5 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/378 constraints. Problems are: Problem set: 5 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 378 constraints, problems are : Problem set: 5 solved, 260 unsolved in 9050 ms.
Refiners :[State Equation: 115/115 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 260/265 constraints, Known Traps: 0/0 constraints]
After SMT, in 16054ms problems are : Problem set: 5 solved, 260 unsolved
Search for dead transitions found 5 dead transitions in 16059ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 115/115 places, 268/273 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 250
Applied a total of 7 rules in 4 ms. Remains 108 /115 variables (removed 7) and now considering 250/268 (removed 18) transitions.
[2024-05-21 07:49:24] [INFO ] Flow matrix only has 197 transitions (discarded 53 similar events)
// Phase 1: matrix 197 rows 108 cols
[2024-05-21 07:49:24] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 07:49:24] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-21 07:49:24] [INFO ] Flow matrix only has 197 transitions (discarded 53 similar events)
[2024-05-21 07:49:24] [INFO ] Invariant cache hit.
[2024-05-21 07:49:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 07:49:24] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/115 places, 250/273 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16598 ms. Remains : 108/115 places, 250/273 transitions.
Computed a total of 3 stabilizing places and 12 stable transitions
Computed a total of 3 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4888 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (266 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 28176 steps, run visited all 1 properties in 37 ms. (steps per millisecond=761 )
Probabilistic random walk after 28176 steps, saw 6921 distinct states, run finished after 49 ms. (steps per millisecond=575 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 266 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9734 reset in 137 ms.
Product exploration explored 100000 steps with 9744 reset in 122 ms.
Built C files in :
/tmp/ltsmin4916010017774117473
[2024-05-21 07:49:25] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2024-05-21 07:49:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:49:26] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2024-05-21 07:49:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:49:26] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2024-05-21 07:49:26] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 07:49:26] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4916010017774117473
Running compilation step : cd /tmp/ltsmin4916010017774117473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 797 ms.
Running link step : cd /tmp/ltsmin4916010017774117473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4916010017774117473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4107139587763909296.hoa' '--buchi-type=spotba'
LTSmin run took 9931 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-02 finished in 30662 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))'
Support contains 2 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1545 transition count 1977
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1545 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1545 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 1530 transition count 1959
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 1530 transition count 1959
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 1530 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 1524 transition count 1950
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 1524 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 1524 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 1521 transition count 1946
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 1518 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 1518 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 1515 transition count 1939
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 1509 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 1507 transition count 1929
Applied a total of 129 rules in 490 ms. Remains 1507 /1569 variables (removed 62) and now considering 1929/2001 (removed 72) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 07:49:37] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 07:49:37] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 07:49:37] [INFO ] Invariant cache hit.
[2024-05-21 07:49:38] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 07:49:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "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 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60570ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60586ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1569 places, 1929/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62236 ms. Remains : 1507/1569 places, 1929/2001 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 479 ms.
Product exploration explored 100000 steps with 50000 reset in 500 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-316-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-03 finished in 63464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Graph (trivial) has 1905 edges and 1569 vertex of which 688 / 1569 are part of one of the 62 SCC in 2 ms
Free SCC test removed 626 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1446 edges and 943 vertex of which 934 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 524 transitions
Trivial Post-agglo rules discarded 524 transitions
Performed 524 trivial Post agglomeration. Transition count delta: 524
Iterating post reduction 0 with 524 rules applied. Total rules applied 526 place count 933 transition count 744
Reduce places removed 524 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 550 rules applied. Total rules applied 1076 place count 409 transition count 718
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 1090 place count 397 transition count 716
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1091 place count 396 transition count 716
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1091 place count 396 transition count 670
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1183 place count 350 transition count 670
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1196 place count 337 transition count 652
Iterating global reduction 4 with 13 rules applied. Total rules applied 1209 place count 337 transition count 652
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 1210 place count 337 transition count 651
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1211 place count 336 transition count 651
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1220 place count 327 transition count 639
Iterating global reduction 6 with 9 rules applied. Total rules applied 1229 place count 327 transition count 639
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1235 place count 327 transition count 633
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1237 place count 325 transition count 629
Iterating global reduction 7 with 2 rules applied. Total rules applied 1239 place count 325 transition count 629
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1240 place count 324 transition count 627
Iterating global reduction 7 with 1 rules applied. Total rules applied 1241 place count 324 transition count 627
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1242 place count 323 transition count 625
Iterating global reduction 7 with 1 rules applied. Total rules applied 1243 place count 323 transition count 625
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1244 place count 322 transition count 623
Iterating global reduction 7 with 1 rules applied. Total rules applied 1245 place count 322 transition count 623
Performed 150 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 7 with 300 rules applied. Total rules applied 1545 place count 172 transition count 386
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1561 place count 172 transition count 370
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1566 place count 167 transition count 363
Iterating global reduction 8 with 5 rules applied. Total rules applied 1571 place count 167 transition count 363
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1572 place count 166 transition count 361
Iterating global reduction 8 with 1 rules applied. Total rules applied 1573 place count 166 transition count 361
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1574 place count 165 transition count 359
Iterating global reduction 8 with 1 rules applied. Total rules applied 1575 place count 165 transition count 359
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1576 place count 164 transition count 357
Iterating global reduction 8 with 1 rules applied. Total rules applied 1577 place count 164 transition count 357
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1578 place count 163 transition count 355
Iterating global reduction 8 with 1 rules applied. Total rules applied 1579 place count 163 transition count 355
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 1601 place count 152 transition count 343
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1613 place count 152 transition count 331
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1614 place count 151 transition count 329
Iterating global reduction 9 with 1 rules applied. Total rules applied 1615 place count 151 transition count 329
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1653 place count 132 transition count 367
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 9 with 23 rules applied. Total rules applied 1676 place count 132 transition count 344
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1685 place count 123 transition count 326
Iterating global reduction 10 with 9 rules applied. Total rules applied 1694 place count 123 transition count 326
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1700 place count 123 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 11 with 40 rules applied. Total rules applied 1740 place count 123 transition count 280
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1741 place count 123 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1742 place count 122 transition count 279
Applied a total of 1742 rules in 145 ms. Remains 122 /1569 variables (removed 1447) and now considering 279/2001 (removed 1722) transitions.
[2024-05-21 07:50:40] [INFO ] Flow matrix only has 223 transitions (discarded 56 similar events)
// Phase 1: matrix 223 rows 122 cols
[2024-05-21 07:50:40] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 07:50:40] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 07:50:40] [INFO ] Flow matrix only has 223 transitions (discarded 56 similar events)
[2024-05-21 07:50:40] [INFO ] Invariant cache hit.
[2024-05-21 07:50:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 07:50:40] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [16, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 324 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/1569 places, 279/2001 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 118 transition count 277
Applied a total of 2 rules in 6 ms. Remains 118 /120 variables (removed 2) and now considering 277/279 (removed 2) transitions.
[2024-05-21 07:50:40] [INFO ] Flow matrix only has 221 transitions (discarded 56 similar events)
// Phase 1: matrix 221 rows 118 cols
[2024-05-21 07:50:40] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 07:50:41] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-21 07:50:41] [INFO ] Flow matrix only has 221 transitions (discarded 56 similar events)
[2024-05-21 07:50:41] [INFO ] Invariant cache hit.
[2024-05-21 07:50:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:50:41] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/1569 places, 277/2001 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 887 ms. Remains : 118/1569 places, 277/2001 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-04 finished in 1007 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 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1545 transition count 1977
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1545 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1545 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 1530 transition count 1959
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 1530 transition count 1959
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 1530 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 1524 transition count 1950
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 1524 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 1524 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 1521 transition count 1946
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 1518 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 1518 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 1515 transition count 1939
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1511 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 1509 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 1507 transition count 1929
Applied a total of 129 rules in 523 ms. Remains 1507 /1569 variables (removed 62) and now considering 1929/2001 (removed 72) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-21 07:50:41] [INFO ] Computed 4 invariants in 8 ms
[2024-05-21 07:50:42] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-21 07:50:42] [INFO ] Invariant cache hit.
[2024-05-21 07:50:43] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 07:50:43] [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 0.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 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.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 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 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.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 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.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 1.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
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 1)
(s201 1)
(s202 0)
(s203 0)
(s204 1)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(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 1)
(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 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(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 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60551ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60567ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1569 places, 1929/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62381 ms. Remains : 1507/1569 places, 1929/2001 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-06
Product exploration explored 100000 steps with 775 reset in 145 ms.
Entered a terminal (fully accepting) state of product in 28906 steps with 214 reset in 44 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-06 finished in 62703 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(X(p1))))||G(p2)))'
Support contains 5 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1548 transition count 1980
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1548 transition count 1980
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 1535 transition count 1965
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 1535 transition count 1965
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 71 place count 1535 transition count 1962
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 1530 transition count 1957
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 1530 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 1530 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 1528 transition count 1954
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 1528 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 1526 transition count 1952
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 1526 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 1524 transition count 1949
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 1524 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 1523 transition count 1948
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 1523 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 1522 transition count 1947
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 1522 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 1521 transition count 1945
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 1521 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1520 transition count 1943
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1520 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1519 transition count 1942
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1519 transition count 1942
Applied a total of 104 rules in 475 ms. Remains 1519 /1569 variables (removed 50) and now considering 1942/2001 (removed 59) transitions.
// Phase 1: matrix 1942 rows 1519 cols
[2024-05-21 07:51:44] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 07:51:44] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-21 07:51:44] [INFO ] Invariant cache hit.
[2024-05-21 07:51:45] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
Running 1941 sub problems to find dead transitions.
[2024-05-21 07:51:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1518/3461 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30052 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 1941/1941 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1941 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 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 1)
(s235 1)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 1)
(s242 0)
(s243 0)
(s244 1)
(s245 1)
(s246 0)
(s247 1)
(s248 0)
(s249 1)
(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 1)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 1)
(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 0)
(s295 1)
(s296 1)
(s297 0)
(s298 0)
(s299 1)
(s300 1)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 1)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 1)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 1)
(s723 0)
(s724 0)
(s725 0)
(s726 1)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 1)
(s733 0)
(s734 0)
(s735 0)
(s736 1)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 1)
(s1108 0)
(s1109 0)
(s1110 1)
(s1111 0)
(s1112 0)
(s1113 1)
(s1114 1)
(s1115 1)
(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 1)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 1)
(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 1)
(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 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1518/3461 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 0/1941 constraints, Known Traps: 0/0 constraints]
After SMT, in 60545ms problems are : Problem set: 0 solved, 1941 unsolved
Search for dead transitions found 0 dead transitions in 60562ms
Starting structural reductions in LTL mode, iteration 1 : 1519/1569 places, 1942/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62204 ms. Remains : 1519/1569 places, 1942/2001 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-07
Product exploration explored 100000 steps with 25075 reset in 319 ms.
Product exploration explored 100000 steps with 24890 reset in 330 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2119 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 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 153 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
RANDOM walk for 40000 steps (311 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (95 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (98 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 334359 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 2
Probabilistic random walk after 334359 steps, saw 86802 distinct states, run finished after 3005 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-21 07:52:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1101/1105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 403/1508 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1932/3440 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3454 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3454 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3456 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3456 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3458 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3458 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3460 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3460 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3461 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3461 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3461 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3461/3461 variables, and 1523 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1803 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1101/1105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 403/1508 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1932/3440 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3440 variables, 2/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3440 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3442 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3442 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3444 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3444 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3446 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3446 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3448 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3448 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3450 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3450 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3452 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3452 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3454 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3454 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3456 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3456 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3458 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3458 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3460 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3460 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3461 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3461 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3461 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3461/3461 variables, and 1525 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2126 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3964ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 115 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=38 )
Parikh walk visited 2 properties in 9 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 12 factoid took 188 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 4 out of 1519 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1519/1519 places, 1942/1942 transitions.
Applied a total of 0 rules in 38 ms. Remains 1519 /1519 variables (removed 0) and now considering 1942/1942 (removed 0) transitions.
[2024-05-21 07:52:55] [INFO ] Invariant cache hit.
[2024-05-21 07:52:55] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-21 07:52:55] [INFO ] Invariant cache hit.
[2024-05-21 07:52:56] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Running 1941 sub problems to find dead transitions.
[2024-05-21 07:52:56] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1518/3461 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 1941/1941 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1941 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 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 1518/3461 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 0/1941 constraints, Known Traps: 0/0 constraints]
After SMT, in 60542ms problems are : Problem set: 0 solved, 1941 unsolved
Search for dead transitions found 0 dead transitions in 60575ms
Finished structural reductions in LTL mode , in 1 iterations and 61805 ms. Remains : 1519/1519 places, 1942/1942 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2119 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 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
RANDOM walk for 40000 steps (307 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (91 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (82 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 360697 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 2
Probabilistic random walk after 360697 steps, saw 92007 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-21 07:54:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1101/1105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 403/1508 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1932/3440 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3454 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3454 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3456 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3456 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3458 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3458 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3460 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3460 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3461 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3461 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3461 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3461/3461 variables, and 1523 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1795 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1101/1105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 403/1508 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1932/3440 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3440 variables, 2/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3440 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3442 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3442 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3444 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3444 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3446 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3446 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3448 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3448 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3450 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3450 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3452 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3452 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3454 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3454 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3456 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3456 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3458 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3458 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3460 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3460 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3461 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3461 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3461 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3461/3461 variables, and 1525 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2133 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3939ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 115 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=57 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 19985 reset in 310 ms.
Product exploration explored 100000 steps with 20007 reset in 321 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 4 out of 1519 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1519/1519 places, 1942/1942 transitions.
Graph (trivial) has 1848 edges and 1519 vertex of which 693 / 1519 are part of one of the 63 SCC in 3 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 889 vertex of which 880 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 482 rules applied. Total rules applied 484 place count 880 transition count 1205
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 496 place count 880 transition count 1193
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 496 place count 880 transition count 1206
Deduced a syphon composed of 503 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 517 place count 880 transition count 1206
Discarding 291 places :
Symmetric choice reduction at 2 with 291 rule applications. Total rules 808 place count 589 transition count 906
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 291 rules applied. Total rules applied 1099 place count 589 transition count 906
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1111 place count 577 transition count 890
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1123 place count 577 transition count 890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1129 place count 577 transition count 884
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1141 place count 565 transition count 872
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1153 place count 565 transition count 872
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1155 place count 563 transition count 868
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1157 place count 563 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1159 place count 561 transition count 864
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1161 place count 561 transition count 864
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 557 transition count 860
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 557 transition count 860
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1171 place count 555 transition count 856
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1173 place count 555 transition count 856
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1175 place count 553 transition count 852
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1177 place count 553 transition count 852
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1181 place count 549 transition count 846
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1185 place count 549 transition count 846
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1188 place count 546 transition count 837
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1191 place count 546 transition count 837
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1193 place count 544 transition count 835
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1195 place count 544 transition count 835
Performed 108 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 317 places in 0 ms
Iterating global reduction 3 with 108 rules applied. Total rules applied 1303 place count 544 transition count 912
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 1345 place count 544 transition count 870
Discarding 99 places :
Symmetric choice reduction at 4 with 99 rule applications. Total rules 1444 place count 445 transition count 762
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 4 with 99 rules applied. Total rules applied 1543 place count 445 transition count 762
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1547 place count 441 transition count 756
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1551 place count 441 transition count 756
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1558 place count 441 transition count 756
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1564 place count 441 transition count 750
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1580 place count 425 transition count 730
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 5 with 16 rules applied. Total rules applied 1596 place count 425 transition count 730
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1600 place count 425 transition count 726
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1604 place count 421 transition count 722
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1608 place count 421 transition count 722
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 1610 place count 421 transition count 722
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1614 place count 421 transition count 718
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1616 place count 419 transition count 716
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 1618 place count 419 transition count 716
Performed 70 Post agglomeration using F-continuation condition with reduction of 113 identical transitions.
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 7 with 70 rules applied. Total rules applied 1688 place count 419 transition count 1042
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 7 with 121 rules applied. Total rules applied 1809 place count 419 transition count 921
Discarding 122 places :
Symmetric choice reduction at 8 with 122 rule applications. Total rules 1931 place count 297 transition count 598
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 8 with 122 rules applied. Total rules applied 2053 place count 297 transition count 598
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 2065 place count 297 transition count 586
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 2086 place count 276 transition count 545
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 9 with 21 rules applied. Total rules applied 2107 place count 276 transition count 545
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2110 place count 276 transition count 594
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2114 place count 276 transition count 590
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2118 place count 272 transition count 559
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2122 place count 272 transition count 559
Deduced a syphon composed of 148 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 10 with 52 rules applied. Total rules applied 2174 place count 272 transition count 507
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2179 place count 267 transition count 502
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 5 rules applied. Total rules applied 2184 place count 267 transition count 502
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 146 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2187 place count 267 transition count 562
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2190 place count 264 transition count 547
Deduced a syphon composed of 143 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2193 place count 264 transition count 547
Deduced a syphon composed of 143 places in 0 ms
Applied a total of 2193 rules in 284 ms. Remains 264 /1519 variables (removed 1255) and now considering 547/1942 (removed 1395) transitions.
[2024-05-21 07:54:06] [INFO ] Redundant transitions in 10 ms returned []
Running 546 sub problems to find dead transitions.
[2024-05-21 07:54:06] [INFO ] Flow matrix only has 491 transitions (discarded 56 similar events)
// Phase 1: matrix 491 rows 264 cols
[2024-05-21 07:54:06] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 07:54:06] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 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 TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 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 TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
At refinement iteration 1 (OVERLAPS) 490/753 variables, 263/263 constraints. Problems are: Problem set: 269 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/753 variables, 3/266 constraints. Problems are: Problem set: 269 solved, 277 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 0/266 constraints. Problems are: Problem set: 269 solved, 277 unsolved
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/754 variables, 1/267 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 0/267 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 1/755 variables, 1/268 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/755 variables, 0/268 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 0/755 variables, 0/268 constraints. Problems are: Problem set: 274 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/755 variables, and 268 constraints, problems are : Problem set: 274 solved, 272 unsolved in 19557 ms.
Refiners :[State Equation: 264/264 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 274 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 487/607 variables, 120/120 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 3/123 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/607 variables, 272/395 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 0/395 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 147/754 variables, 144/539 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 0/539 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 1/755 variables, 1/540 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/755 variables, 0/540 constraints. Problems are: Problem set: 274 solved, 272 unsolved
At refinement iteration 9 (OVERLAPS) 0/755 variables, 0/540 constraints. Problems are: Problem set: 274 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 755/755 variables, and 540 constraints, problems are : Problem set: 274 solved, 272 unsolved in 25638 ms.
Refiners :[State Equation: 264/264 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 272/546 constraints, Known Traps: 0/0 constraints]
After SMT, in 45420ms problems are : Problem set: 274 solved, 272 unsolved
Search for dead transitions found 274 dead transitions in 45426ms
Found 274 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 274 transitions
Dead transitions reduction (with SMT) removed 274 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 264/1519 places, 273/1942 transitions.
Graph (complete) has 420 edges and 264 vertex of which 121 are kept as prefixes of interest. Removing 143 places using SCC suffix rule.1 ms
Discarding 143 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 114 transition count 255
Applied a total of 8 rules in 6 ms. Remains 114 /264 variables (removed 150) and now considering 255/273 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1519 places, 255/1942 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45732 ms. Remains : 114/1519 places, 255/1942 transitions.
Built C files in :
/tmp/ltsmin8250451122612869132
[2024-05-21 07:54:51] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8250451122612869132
Running compilation step : cd /tmp/ltsmin8250451122612869132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8250451122612869132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8250451122612869132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1519/1519 places, 1942/1942 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1518 transition count 1941
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1518 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1517 transition count 1940
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1517 transition count 1940
Applied a total of 4 rules in 124 ms. Remains 1517 /1519 variables (removed 2) and now considering 1940/1942 (removed 2) transitions.
// Phase 1: matrix 1940 rows 1517 cols
[2024-05-21 07:54:54] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 07:54:55] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-21 07:54:55] [INFO ] Invariant cache hit.
[2024-05-21 07:54:55] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 07:54:55] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3457 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1516/3457 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60548ms
Starting structural reductions in LTL mode, iteration 1 : 1517/1519 places, 1940/1942 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61812 ms. Remains : 1517/1519 places, 1940/1942 transitions.
Built C files in :
/tmp/ltsmin3048453596901994387
[2024-05-21 07:55:56] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3048453596901994387
Running compilation step : cd /tmp/ltsmin3048453596901994387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3048453596901994387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3048453596901994387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 07:55:59] [INFO ] Flatten gal took : 68 ms
[2024-05-21 07:55:59] [INFO ] Flatten gal took : 63 ms
[2024-05-21 07:55:59] [INFO ] Time to serialize gal into /tmp/LTL6054806894670555722.gal : 28 ms
[2024-05-21 07:55:59] [INFO ] Time to serialize properties into /tmp/LTL16471936903484535135.prop : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6054806894670555722.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1641503759260946493.hoa' '-atoms' '/tmp/LTL16471936903484535135.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16471936903484535135.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1641503759260946493.hoa
Detected timeout of ITS tools.
[2024-05-21 07:56:15] [INFO ] Flatten gal took : 115 ms
[2024-05-21 07:56:15] [INFO ] Flatten gal took : 75 ms
[2024-05-21 07:56:15] [INFO ] Time to serialize gal into /tmp/LTL17611641940945106907.gal : 20 ms
[2024-05-21 07:56:15] [INFO ] Time to serialize properties into /tmp/LTL13428345164630823087.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17611641940945106907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13428345164630823087.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(("((p1157==0)&&(p2457==1))")||(X(X("((p994==0)||(p207==1))")))))||(G("(p1478==1)"))))
Formula 0 simplified : F(!"((p1157==0)&&(p2457==1))" & XX!"((p994==0)||(p207==1))") & F!"(p1478==1)"
Detected timeout of ITS tools.
[2024-05-21 07:56:30] [INFO ] Flatten gal took : 42 ms
[2024-05-21 07:56:30] [INFO ] Applying decomposition
[2024-05-21 07:56:30] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15611816993467648257.txt' '-o' '/tmp/graph15611816993467648257.bin' '-w' '/tmp/graph15611816993467648257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15611816993467648257.bin' '-l' '-1' '-v' '-w' '/tmp/graph15611816993467648257.weights' '-q' '0' '-e' '0.001'
[2024-05-21 07:56:30] [INFO ] Decomposing Gal with order
[2024-05-21 07:56:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 07:56:31] [INFO ] Removed a total of 536 redundant transitions.
[2024-05-21 07:56:31] [INFO ] Flatten gal took : 244 ms
[2024-05-21 07:56:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 60 ms.
[2024-05-21 07:56:31] [INFO ] Time to serialize gal into /tmp/LTL3180568884726107556.gal : 46 ms
[2024-05-21 07:56:31] [INFO ] Time to serialize properties into /tmp/LTL4911205928747903377.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3180568884726107556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4911205928747903377.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G(("((i13.i3.i0.u267.p1157==0)&&(i38.u605.p2457==1))")||(X(X("((i13.i1.i2.u236.p994==0)||(i0.u40.p207==1))")))))||(G("(i22.i1.i2.u...173
Formula 0 simplified : F(!"((i13.i3.i0.u267.p1157==0)&&(i38.u605.p2457==1))" & XX!"((i13.i1.i2.u236.p994==0)||(i0.u40.p207==1))") & F!"(i22.i1.i2.u359.p147...161
Reverse transition relation is NOT exact ! Due to transitions t26, t189, t272, t303, t381, t452, t501, t668, t749, t780, t811, t860, t984, t1148, t1229, t1...2033
Computing Next relation with stutter on 89440 deadlock states
8 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
545 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.78694,190504,1,0,351147,7305,22230,581104,482,39202,1339320
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-07 finished in 294142 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((!p0||X(p1))) U ((X((!p0||X(p1)))&&(!p0||G(p2)))||X(G((!p0||X(p1))))))))'
Support contains 6 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1548 transition count 1980
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1548 transition count 1980
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1548 transition count 1979
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 1536 transition count 1966
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 1536 transition count 1966
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 1536 transition count 1964
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 1530 transition count 1958
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 1530 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 1530 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 85 place count 1527 transition count 1954
Iterating global reduction 3 with 3 rules applied. Total rules applied 88 place count 1527 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 1524 transition count 1951
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 1524 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 1521 transition count 1947
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 1521 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 1519 transition count 1945
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 1519 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 1517 transition count 1943
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 1517 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 1515 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 1514 transition count 1938
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 1513 transition count 1937
Applied a total of 116 rules in 533 ms. Remains 1513 /1569 variables (removed 56) and now considering 1937/2001 (removed 64) transitions.
// Phase 1: matrix 1937 rows 1513 cols
[2024-05-21 07:56:38] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 07:56:39] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-21 07:56:39] [INFO ] Invariant cache hit.
[2024-05-21 07:56:40] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2024-05-21 07:56:40] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3450 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1936/1936 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3450 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1569 places, 1937/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62413 ms. Remains : 1513/1569 places, 1937/2001 transitions.
Stuttering acceptance computed with spot in 394 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-13
Product exploration explored 100000 steps with 25033 reset in 343 ms.
Product exploration explored 100000 steps with 24993 reset in 379 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2114 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 229 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (310 resets) in 647 ms. (61 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (90 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (97 resets) in 282 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (94 resets) in 432 ms. (92 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (98 resets) in 406 ms. (98 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (94 resets) in 315 ms. (126 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (87 resets) in 241 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (102 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (101 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (96 resets) in 228 ms. (174 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40003 steps (95 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (87 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (96 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
[2024-05-21 07:57:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1095/1101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 401/1502 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1927/3429 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 10 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 3449/3450 variables, and 1516 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1512/1513 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1095/1101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 401/1502 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1927/3429 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3429 variables, 10/1516 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3429 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2/3431 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3431 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/3433 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3433 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2/3435 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3435 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 2/3437 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3437 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 2/3439 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3439 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 2/3441 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3441 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 2/3443 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3443 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 2/3445 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 10 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 3445/3450 variables, and 1524 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1510/1513 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 10042ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Graph (trivial) has 1835 edges and 1513 vertex of which 687 / 1513 are part of one of the 62 SCC in 1 ms
Free SCC test removed 625 places
Drop transitions (Empty/Sink Transition effects.) removed 789 transitions
Reduce isomorphic transitions removed 789 transitions.
Graph (complete) has 1320 edges and 888 vertex of which 879 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 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 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 879 transition count 650
Reduce places removed 487 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 545 rules applied. Total rules applied 1041 place count 392 transition count 592
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 39 rules applied. Total rules applied 1080 place count 354 transition count 591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1081 place count 353 transition count 591
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1081 place count 353 transition count 541
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1181 place count 303 transition count 541
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1192 place count 292 transition count 525
Iterating global reduction 4 with 11 rules applied. Total rules applied 1203 place count 292 transition count 525
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 1206 place count 292 transition count 522
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1209 place count 289 transition count 522
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1215 place count 283 transition count 516
Iterating global reduction 6 with 6 rules applied. Total rules applied 1221 place count 283 transition count 516
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1227 place count 283 transition count 510
Performed 145 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 7 with 290 rules applied. Total rules applied 1517 place count 138 transition count 273
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1535 place count 138 transition count 255
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1538 place count 135 transition count 252
Iterating global reduction 8 with 3 rules applied. Total rules applied 1541 place count 135 transition count 252
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 1565 place count 123 transition count 238
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1581 place count 123 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1585 place count 121 transition count 220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1590 place count 121 transition count 215
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1656 place count 88 transition count 246
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 1683 place count 88 transition count 219
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 1704 place count 67 transition count 177
Iterating global reduction 11 with 21 rules applied. Total rules applied 1725 place count 67 transition count 177
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1736 place count 67 transition count 166
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1741 place count 62 transition count 156
Iterating global reduction 12 with 5 rules applied. Total rules applied 1746 place count 62 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1751 place count 62 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1754 place count 62 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1756 place count 61 transition count 147
Free-agglomeration rule applied 5 times.
Iterating global reduction 13 with 5 rules applied. Total rules applied 1761 place count 61 transition count 142
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 1769 place count 56 transition count 139
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 1771 place count 56 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1772 place count 56 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1773 place count 55 transition count 136
Applied a total of 1773 rules in 70 ms. Remains 55 /1513 variables (removed 1458) and now considering 136/1937 (removed 1801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 55/1513 places, 136/1937 transitions.
RANDOM walk for 31739 steps (493 resets) in 421 ms. (75 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 18 factoid took 837 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 394 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 369 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 6 out of 1513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Applied a total of 0 rules in 41 ms. Remains 1513 /1513 variables (removed 0) and now considering 1937/1937 (removed 0) transitions.
[2024-05-21 07:57:55] [INFO ] Invariant cache hit.
[2024-05-21 07:57:56] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-21 07:57:56] [INFO ] Invariant cache hit.
[2024-05-21 07:57:57] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2024-05-21 07:57:57] [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 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 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 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3450 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1936/1936 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 1)
(s243 0)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 1)
(s305 0)
(s306 1)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 1)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421timeout
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 0)
(s695 0)
(s696 0)
(s697 0)
(s698 1)
(s699 0)
(s700 1)
(s701 1)
(s702 0)
(s703 0)
(s704 1)
(s705 1)
(s706 0)
(s707 1)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 1)
(s716 1)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 1)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 1)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3450 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints]
After SMT, in 60505ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60525ms
Finished structural reductions in LTL mode , in 1 iterations and 61717 ms. Remains : 1513/1513 places, 1937/1937 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2114 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 154 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (319 resets) in 581 ms. (68 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (99 resets) in 308 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (90 resets) in 312 ms. (127 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (101 resets) in 337 ms. (118 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (86 resets) in 223 ms. (178 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (96 resets) in 207 ms. (192 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (88 resets) in 252 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (91 resets) in 145 ms. (274 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (89 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (90 resets) in 217 ms. (183 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (93 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (95 resets) in 271 ms. (147 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (90 resets) in 115 ms. (344 steps per ms) remains 10/13 properties
[2024-05-21 07:58:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1095/1101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 401/1502 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1927/3429 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3429 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/3431 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3447/3450 variables, and 1515 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1511/1513 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1095/1101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 401/1502 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1927/3429 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3429 variables, 10/1516 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3429 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2/3431 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3431 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/3433 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3433 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2/3435 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3435 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 2/3437 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3437 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 2/3439 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3439 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 2/3441 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3441 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 2/3443 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3443 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 2/3445 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3445/3450 variables, and 1524 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1510/1513 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 10033ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Graph (trivial) has 1835 edges and 1513 vertex of which 687 / 1513 are part of one of the 62 SCC in 1 ms
Free SCC test removed 625 places
Drop transitions (Empty/Sink Transition effects.) removed 789 transitions
Reduce isomorphic transitions removed 789 transitions.
Graph (complete) has 1320 edges and 888 vertex of which 879 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 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 494 rules applied. Total rules applied 496 place count 879 transition count 650
Reduce places removed 487 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 545 rules applied. Total rules applied 1041 place count 392 transition count 592
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 39 rules applied. Total rules applied 1080 place count 354 transition count 591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1081 place count 353 transition count 591
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1081 place count 353 transition count 541
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 1181 place count 303 transition count 541
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1192 place count 292 transition count 525
Iterating global reduction 4 with 11 rules applied. Total rules applied 1203 place count 292 transition count 525
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 1206 place count 292 transition count 522
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1209 place count 289 transition count 522
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1215 place count 283 transition count 516
Iterating global reduction 6 with 6 rules applied. Total rules applied 1221 place count 283 transition count 516
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1227 place count 283 transition count 510
Performed 145 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 7 with 290 rules applied. Total rules applied 1517 place count 138 transition count 273
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1535 place count 138 transition count 255
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1538 place count 135 transition count 252
Iterating global reduction 8 with 3 rules applied. Total rules applied 1541 place count 135 transition count 252
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 1565 place count 123 transition count 238
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1581 place count 123 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1585 place count 121 transition count 220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1590 place count 121 transition count 215
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1656 place count 88 transition count 246
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 1683 place count 88 transition count 219
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 1704 place count 67 transition count 177
Iterating global reduction 11 with 21 rules applied. Total rules applied 1725 place count 67 transition count 177
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1736 place count 67 transition count 166
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1741 place count 62 transition count 156
Iterating global reduction 12 with 5 rules applied. Total rules applied 1746 place count 62 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1751 place count 62 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1754 place count 62 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1756 place count 61 transition count 147
Free-agglomeration rule applied 5 times.
Iterating global reduction 13 with 5 rules applied. Total rules applied 1761 place count 61 transition count 142
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 1769 place count 56 transition count 139
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 1771 place count 56 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1772 place count 56 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1773 place count 55 transition count 136
Applied a total of 1773 rules in 43 ms. Remains 55 /1513 variables (removed 1458) and now considering 136/1937 (removed 1801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 55/1513 places, 136/1937 transitions.
RANDOM walk for 30205 steps (463 resets) in 337 ms. (89 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 18 factoid took 727 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 589 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 468 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 25022 reset in 265 ms.
Product exploration explored 100000 steps with 24977 reset in 270 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, false, true, true]
Stuttering acceptance computed with spot in 438 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (NOT p1), true, (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 6 out of 1513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Graph (trivial) has 1835 edges and 1513 vertex of which 687 / 1513 are part of one of the 62 SCC in 1 ms
Free SCC test removed 625 places
Ensure Unique test removed 726 transitions
Reduce isomorphic transitions removed 726 transitions.
Graph (complete) has 1382 edges and 888 vertex of which 879 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 474 rules applied. Total rules applied 476 place count 879 transition count 1206
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 488 place count 879 transition count 1194
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 488 place count 879 transition count 1207
Deduced a syphon composed of 496 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 510 place count 879 transition count 1207
Discarding 281 places :
Symmetric choice reduction at 2 with 281 rule applications. Total rules 791 place count 598 transition count 918
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 281 rules applied. Total rules applied 1072 place count 598 transition count 918
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1082 place count 588 transition count 906
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1092 place count 588 transition count 906
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1098 place count 588 transition count 900
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1106 place count 580 transition count 892
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1114 place count 580 transition count 892
Performed 113 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 332 places in 0 ms
Iterating global reduction 3 with 113 rules applied. Total rules applied 1227 place count 580 transition count 967
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1270 place count 580 transition count 924
Discarding 107 places :
Symmetric choice reduction at 4 with 107 rule applications. Total rules 1377 place count 473 transition count 807
Deduced a syphon composed of 235 places in 0 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1484 place count 473 transition count 807
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1490 place count 467 transition count 798
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1496 place count 467 transition count 798
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 236 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1503 place count 467 transition count 798
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1509 place count 467 transition count 792
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1524 place count 452 transition count 773
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1539 place count 452 transition count 773
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1545 place count 452 transition count 767
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1549 place count 448 transition count 763
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1553 place count 448 transition count 763
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1556 place count 448 transition count 763
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1561 place count 448 transition count 758
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1564 place count 445 transition count 755
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1567 place count 445 transition count 755
Performed 78 Post agglomeration using F-continuation condition with reduction of 115 identical transitions.
Deduced a syphon composed of 299 places in 0 ms
Iterating global reduction 7 with 78 rules applied. Total rules applied 1645 place count 445 transition count 1120
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 7 with 122 rules applied. Total rules applied 1767 place count 445 transition count 998
Discarding 130 places :
Symmetric choice reduction at 8 with 130 rule applications. Total rules 1897 place count 315 transition count 646
Deduced a syphon composed of 178 places in 1 ms
Iterating global reduction 8 with 130 rules applied. Total rules applied 2027 place count 315 transition count 646
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 2039 place count 315 transition count 634
Discarding 24 places :
Symmetric choice reduction at 9 with 24 rule applications. Total rules 2063 place count 291 transition count 587
Deduced a syphon composed of 154 places in 1 ms
Iterating global reduction 9 with 24 rules applied. Total rules applied 2087 place count 291 transition count 587
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 157 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2090 place count 291 transition count 639
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2093 place count 288 transition count 610
Deduced a syphon composed of 154 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2096 place count 288 transition count 610
Deduced a syphon composed of 154 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 9 with 74 rules applied. Total rules applied 2170 place count 288 transition count 536
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2175 place count 283 transition count 529
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 2180 place count 283 transition count 529
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2183 place count 283 transition count 589
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2186 place count 280 transition count 574
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2189 place count 280 transition count 574
Deduced a syphon composed of 149 places in 0 ms
Applied a total of 2189 rules in 124 ms. Remains 280 /1513 variables (removed 1233) and now considering 574/1937 (removed 1363) transitions.
[2024-05-21 07:59:13] [INFO ] Redundant transitions in 6 ms returned []
Running 573 sub problems to find dead transitions.
[2024-05-21 07:59:13] [INFO ] Flow matrix only has 514 transitions (discarded 60 similar events)
// Phase 1: matrix 514 rows 280 cols
[2024-05-21 07:59:13] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 07:59:13] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
At refinement iteration 1 (OVERLAPS) 513/792 variables, 279/279 constraints. Problems are: Problem set: 274 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/792 variables, 4/283 constraints. Problems are: Problem set: 274 solved, 299 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/792 variables, 0/283 constraints. Problems are: Problem set: 274 solved, 299 unsolved
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/793 variables, 1/284 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/793 variables, 0/284 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 1/794 variables, 1/285 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/794 variables, 0/285 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 0/794 variables, 0/285 constraints. Problems are: Problem set: 279 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 285 constraints, problems are : Problem set: 279 solved, 294 unsolved in 20827 ms.
Refiners :[State Equation: 280/280 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 279 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 510/640 variables, 130/130 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 4/134 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/640 variables, 294/428 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/428 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 153/793 variables, 150/578 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 0/578 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 1/794 variables, 1/579 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/794 variables, 0/579 constraints. Problems are: Problem set: 279 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/794 variables, 0/579 constraints. Problems are: Problem set: 279 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 579 constraints, problems are : Problem set: 279 solved, 294 unsolved in 28143 ms.
Refiners :[State Equation: 280/280 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 294/573 constraints, Known Traps: 0/0 constraints]
After SMT, in 49227ms problems are : Problem set: 279 solved, 294 unsolved
Search for dead transitions found 279 dead transitions in 49231ms
Found 279 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 279 transitions
Dead transitions reduction (with SMT) removed 279 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 280/1513 places, 295/1937 transitions.
Graph (complete) has 439 edges and 280 vertex of which 131 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 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 124 transition count 277
Applied a total of 8 rules in 8 ms. Remains 124 /280 variables (removed 156) and now considering 277/295 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 124/1513 places, 277/1937 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49381 ms. Remains : 124/1513 places, 277/1937 transitions.
Built C files in :
/tmp/ltsmin3739990895262371576
[2024-05-21 08:00:02] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3739990895262371576
Running compilation step : cd /tmp/ltsmin3739990895262371576;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3739990895262371576;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3739990895262371576;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 1513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1937/1937 transitions.
Applied a total of 0 rules in 46 ms. Remains 1513 /1513 variables (removed 0) and now considering 1937/1937 (removed 0) transitions.
// Phase 1: matrix 1937 rows 1513 cols
[2024-05-21 08:00:05] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 08:00:05] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 08:00:05] [INFO ] Invariant cache hit.
[2024-05-21 08:00:06] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2024-05-21 08:00:06] [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/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3450 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1936/1936 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3450 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints]
After SMT, in 60562ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60582ms
Finished structural reductions in LTL mode , in 1 iterations and 61778 ms. Remains : 1513/1513 places, 1937/1937 transitions.
Built C files in :
/tmp/ltsmin5977885677513719296
[2024-05-21 08:01:07] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5977885677513719296
Running compilation step : cd /tmp/ltsmin5977885677513719296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5977885677513719296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5977885677513719296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 08:01:10] [INFO ] Flatten gal took : 33 ms
[2024-05-21 08:01:10] [INFO ] Flatten gal took : 33 ms
[2024-05-21 08:01:10] [INFO ] Time to serialize gal into /tmp/LTL17052776049577979880.gal : 6 ms
[2024-05-21 08:01:10] [INFO ] Time to serialize properties into /tmp/LTL15276022823773763223.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17052776049577979880.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2499645400751853117.hoa' '-atoms' '/tmp/LTL15276022823773763223.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15276022823773763223.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2499645400751853117.hoa
Detected timeout of ITS tools.
[2024-05-21 08:01:25] [INFO ] Flatten gal took : 29 ms
[2024-05-21 08:01:25] [INFO ] Flatten gal took : 29 ms
[2024-05-21 08:01:25] [INFO ] Time to serialize gal into /tmp/LTL9551368769802014763.gal : 5 ms
[2024-05-21 08:01:25] [INFO ] Time to serialize properties into /tmp/LTL3519196640062798182.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9551368769802014763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3519196640062798182.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X((!("((p216==0)||(p149==1))"))||(X("((p765==0)||(p529==1))"))))U((X(G((!("((p216==0)||(p149==1))"))||(X("((p765==0)||(p529==1))...300
Formula 0 simplified : X(X("((p216==0)||(p149==1))" & X!"((p765==0)||(p529==1))") R (XF("((p216==0)||(p149==1))" & X!"((p765==0)||(p529==1))") & (X("((p216...265
Detected timeout of ITS tools.
[2024-05-21 08:01:40] [INFO ] Flatten gal took : 28 ms
[2024-05-21 08:01:40] [INFO ] Applying decomposition
[2024-05-21 08:01:40] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph494570732558014832.txt' '-o' '/tmp/graph494570732558014832.bin' '-w' '/tmp/graph494570732558014832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph494570732558014832.bin' '-l' '-1' '-v' '-w' '/tmp/graph494570732558014832.weights' '-q' '0' '-e' '0.001'
[2024-05-21 08:01:40] [INFO ] Decomposing Gal with order
[2024-05-21 08:01:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 08:01:41] [INFO ] Removed a total of 521 redundant transitions.
[2024-05-21 08:01:41] [INFO ] Flatten gal took : 83 ms
[2024-05-21 08:01:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 16 ms.
[2024-05-21 08:01:41] [INFO ] Time to serialize gal into /tmp/LTL10595245321933784292.gal : 14 ms
[2024-05-21 08:01:41] [INFO ] Time to serialize properties into /tmp/LTL18310113589931723179.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10595245321933784292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18310113589931723179.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((X((!("((i4.i1.i6.u51.p216==0)||(i1.u32.p149==1))"))||(X("((i10.u171.p765==0)||(i6.i1.i1.u100.p529==1))"))))U((X(G((!("((i4.i1.i6...479
Formula 0 simplified : X(X("((i4.i1.i6.u51.p216==0)||(i1.u32.p149==1))" & X!"((i10.u171.p765==0)||(i6.i1.i1.u100.p529==1))") R (XF("((i4.i1.i6.u51.p216==0)...444
Reverse transition relation is NOT exact ! Due to transitions t26, t189, t272, t303, t381, t452, t668, t697, t749, t811, t860, t984, t1148, t1177, t1229, t...2199
Computing Next relation with stutter on 89440 deadlock states
Detected timeout of ITS tools.
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-13 finished in 318189 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 3 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1545 transition count 1977
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1545 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1545 transition count 1976
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 1531 transition count 1960
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 1531 transition count 1960
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 1531 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 1526 transition count 1952
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 1526 transition count 1952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 1526 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 1523 transition count 1948
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 1523 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 1520 transition count 1945
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 1520 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 1517 transition count 1941
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 1517 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 1515 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 1511 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 1510 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 1509 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 1509 transition count 1931
Applied a total of 125 rules in 530 ms. Remains 1509 /1569 variables (removed 60) and now considering 1931/2001 (removed 70) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2024-05-21 08:01:56] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 08:01:57] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-21 08:01:57] [INFO ] Invariant cache hit.
[2024-05-21 08:01:58] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 08:01:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1569 places, 1931/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62190 ms. Remains : 1509/1569 places, 1931/2001 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-14
Product exploration explored 100000 steps with 773 reset in 137 ms.
Product exploration explored 100000 steps with 788 reset in 140 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.11 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
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 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (314 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (92 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 500877 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 500877 steps, saw 122463 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2024-05-21 08:03:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 290/293 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1498 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1921/3419 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3440 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3440/3440 variables, and 1513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1299 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 290/293 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1498 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1921/3419 variables, 1498/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3419 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3419 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3421 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3435 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3435 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3439 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3439 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3440 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3440 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3440 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3440/3440 variables, and 1514 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1247 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1509/1509 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2563ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11989 steps, including 88 resets, run visited all 1 properties in 33 ms. (steps per millisecond=363 )
Parikh walk visited 1 properties in 36 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 94 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 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Applied a total of 0 rules in 44 ms. Remains 1509 /1509 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2024-05-21 08:03:05] [INFO ] Invariant cache hit.
[2024-05-21 08:03:05] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-21 08:03:05] [INFO ] Invariant cache hit.
[2024-05-21 08:03:06] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 08:03:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Error getting values : (error "ParserException while parsing response: ((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 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 0)
(s240 1)
(s241 0)
(s242 1)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(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 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 1)
(s293 0)
(s294 0)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 0)
(s300 0)
(s301 1)
(s302 1)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(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 1)
(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)
(s421timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60547ms
Finished structural reductions in LTL mode , in 1 iterations and 61798 ms. Remains : 1509/1509 places, 1931/1931 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 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 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 31609 steps (250 resets) in 68 ms. (458 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 97 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 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 69943 steps with 552 reset in 97 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-14 finished in 131517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F((G(p1)||X(p2)))))'
Support contains 5 out of 1569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1569/1569 places, 2001/2001 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1546 transition count 1978
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1546 transition count 1978
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1546 transition count 1977
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 1533 transition count 1963
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 1533 transition count 1963
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 76 place count 1533 transition count 1960
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 1528 transition count 1955
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 1528 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 1528 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 1525 transition count 1951
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 1525 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 1522 transition count 1948
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 1522 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 1519 transition count 1944
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 1519 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 1517 transition count 1942
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 1517 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 1515 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 1515 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 1512 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 1511 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 1511 transition count 1934
Applied a total of 121 rules in 540 ms. Remains 1511 /1569 variables (removed 58) and now considering 1934/2001 (removed 67) transitions.
// Phase 1: matrix 1934 rows 1511 cols
[2024-05-21 08:04:08] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 08:04:08] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-21 08:04:08] [INFO ] Invariant cache hit.
[2024-05-21 08:04:09] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2024-05-21 08:04:09] [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 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.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 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 1.0)
(s459 0.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 1.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 1.0)
(s1100 1.0)
(s1101 0.0)
(s1102 1.0)
(s1103 0.0)
(s1104 0.0)
(s1105 1.0)
(s1106 0.0)
(s1107 0.0)
(s1108 1.0)
(s1109 1.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 1.0)
(s1115 0.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 1.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3445 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3445 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints]
After SMT, in 60574ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60595ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1569 places, 1934/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62366 ms. Remains : 1511/1569 places, 1934/2001 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLCardinality-15
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLCardinality-15 finished in 62549 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((!p0||X(p1))) U ((X((!p0||X(p1)))&&(!p0||G(p2)))||X(G((!p0||X(p1))))))))'
[2024-05-21 08:05:10] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6649777534814870115
[2024-05-21 08:05:10] [INFO ] Too many transitions (2001) to apply POR reductions. Disabling POR matrices.
[2024-05-21 08:05:10] [INFO ] Applying decomposition
[2024-05-21 08:05:10] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6649777534814870115
Running compilation step : cd /tmp/ltsmin6649777534814870115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 08:05:10] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14962369975615686337.txt' '-o' '/tmp/graph14962369975615686337.bin' '-w' '/tmp/graph14962369975615686337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14962369975615686337.bin' '-l' '-1' '-v' '-w' '/tmp/graph14962369975615686337.weights' '-q' '0' '-e' '0.001'
[2024-05-21 08:05:10] [INFO ] Decomposing Gal with order
[2024-05-21 08:05:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 08:05:10] [INFO ] Removed a total of 537 redundant transitions.
[2024-05-21 08:05:11] [INFO ] Flatten gal took : 79 ms
[2024-05-21 08:05:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 16 ms.
[2024-05-21 08:05:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality13151202182911533143.gal : 17 ms
[2024-05-21 08:05:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality13404698806819286684.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13151202182911533143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13404698806819286684.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X((X((!("((i1.i0.i2.u50.p216==0)||(i3.u33.p149==1))"))||(X("((i10.i0.i0.u180.p765==0)||(i7.i1.i0.u120.p529==1))"))))U(((X((!("((i1....497
Formula 0 simplified : X(X("((i1.i0.i2.u50.p216==0)||(i3.u33.p149==1))" & X!"((i10.i0.i0.u180.p765==0)||(i7.i1.i0.u120.p529==1))") R (XF("((i1.i0.i2.u50.p2...462
Compilation finished in 4690 ms.
Running link step : cd /tmp/ltsmin6649777534814870115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6649777534814870115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((!(LTLAPp0==true)||X((LTLAPp1==true)))) U ((X((!(LTLAPp0==true)||X((LTLAPp1==true))))&&(!(LTLAPp0==true)||[]((LTLAPp2==true))))||X([]((!(LTLAPp0==true)||X((LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t26, t219, t272, t303, t452, t501, t749, t780, t784, t811, t860, t984, t1148, t1229, t1260, t...2314
Computing Next relation with stutter on 93832 deadlock states
51 unique states visited
8 strongly connected components in search stack
96 transitions explored
51 items max in DFS search stack
3384 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,34.0764,1100268,1,0,2.38553e+06,8810,23724,3.96244e+06,595,51487,4597180
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-316-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1200934 ms.
BK_STOP 1716278802367
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-316"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-316, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624188900235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-316.tgz
mv CloudReconfiguration-PT-316 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;