Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r091-tall-171624187300259.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CloudReconfiguration-PT-319, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187300259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 11 19:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 19:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 19:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 661K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716274856108

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-319
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 07:00:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 07:00:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:00:57] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-05-21 07:00:57] [INFO ] Transformed 2587 places.
[2024-05-21 07:00:57] [INFO ] Transformed 3099 transitions.
[2024-05-21 07:00:57] [INFO ] Found NUPN structural information;
[2024-05-21 07:00:57] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CloudReconfiguration-PT-319-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-319-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 2587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Discarding 513 places :
Symmetric choice reduction at 0 with 513 rule applications. Total rules 513 place count 2074 transition count 2586
Iterating global reduction 0 with 513 rules applied. Total rules applied 1026 place count 2074 transition count 2586
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 2074 transition count 2557
Discarding 234 places :
Symmetric choice reduction at 1 with 234 rule applications. Total rules 1289 place count 1840 transition count 2323
Iterating global reduction 1 with 234 rules applied. Total rules applied 1523 place count 1840 transition count 2323
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 1612 place count 1751 transition count 2234
Iterating global reduction 1 with 89 rules applied. Total rules applied 1701 place count 1751 transition count 2234
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1718 place count 1751 transition count 2217
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1766 place count 1703 transition count 2169
Iterating global reduction 2 with 48 rules applied. Total rules applied 1814 place count 1703 transition count 2169
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1823 place count 1703 transition count 2160
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1861 place count 1665 transition count 2117
Iterating global reduction 3 with 38 rules applied. Total rules applied 1899 place count 1665 transition count 2117
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1925 place count 1639 transition count 2091
Iterating global reduction 3 with 26 rules applied. Total rules applied 1951 place count 1639 transition count 2091
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1976 place count 1614 transition count 2066
Iterating global reduction 3 with 25 rules applied. Total rules applied 2001 place count 1614 transition count 2066
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2026 place count 1589 transition count 2041
Iterating global reduction 3 with 25 rules applied. Total rules applied 2051 place count 1589 transition count 2041
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 2071 place count 1569 transition count 2010
Iterating global reduction 3 with 20 rules applied. Total rules applied 2091 place count 1569 transition count 2010
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2099 place count 1561 transition count 1997
Iterating global reduction 3 with 8 rules applied. Total rules applied 2107 place count 1561 transition count 1997
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2115 place count 1553 transition count 1986
Iterating global reduction 3 with 8 rules applied. Total rules applied 2123 place count 1553 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2125 place count 1553 transition count 1984
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2128 place count 1550 transition count 1981
Iterating global reduction 4 with 3 rules applied. Total rules applied 2131 place count 1550 transition count 1981
Applied a total of 2131 rules in 2319 ms. Remains 1550 /2587 variables (removed 1037) and now considering 1981/3099 (removed 1118) transitions.
// Phase 1: matrix 1981 rows 1550 cols
[2024-05-21 07:01:00] [INFO ] Computed 4 invariants in 38 ms
[2024-05-21 07:01:00] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-21 07:01:00] [INFO ] Invariant cache hit.
[2024-05-21 07:01:01] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
Running 1980 sub problems to find dead transitions.
[2024-05-21 07:01:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1549 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1549/3531 variables, and 4 constraints, problems are : Problem set: 0 solved, 1980 unsolved in 30062 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1550 constraints, PredecessorRefiner: 1980/1980 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1980 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1549 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1980 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 1549/3531 variables, and 4 constraints, problems are : Problem set: 0 solved, 1980 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1550 constraints, PredecessorRefiner: 0/1980 constraints, Known Traps: 0/0 constraints]
After SMT, in 60788ms problems are : Problem set: 0 solved, 1980 unsolved
Search for dead transitions found 0 dead transitions in 60829ms
Starting structural reductions in LTL mode, iteration 1 : 1550/2587 places, 1981/3099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64696 ms. Remains : 1550/2587 places, 1981/3099 transitions.
Support contains 31 out of 1550 places after structural reductions.
[2024-05-21 07:02:02] [INFO ] Flatten gal took : 162 ms
[2024-05-21 07:02:03] [INFO ] Flatten gal took : 74 ms
[2024-05-21 07:02:03] [INFO ] Input system was already deterministic with 1981 transitions.
RANDOM walk for 40000 steps (481 resets) in 1974 ms. (20 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4003 steps (13 resets) in 75 ms. (52 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (18 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (15 resets) in 81 ms. (48 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (17 resets) in 72 ms. (54 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (18 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 86 ms. (46 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (23 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (18 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (15 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (14 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (19 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (17 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (18 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
[2024-05-21 07:02:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1511/1539 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1539 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1971/3510 variables, 1539/1543 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3510 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/3512 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3512 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/3514 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3514 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 2/3516 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3516 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 2/3518 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3518/3531 variables, and 1547 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5019 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1543/1550 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1511/1539 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1539 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1971/3510 variables, 1539/1543 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3510 variables, 18/1561 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3510 variables, 0/1561 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 2/3512 variables, 1/1562 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3512 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 2/3514 variables, 1/1563 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3514 variables, 0/1563 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 2/3516 variables, 1/1564 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3516 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 2/3518 variables, 1/1565 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3518/3531 variables, and 1565 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5022 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1543/1550 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 10085ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 1550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 1981/1981 transitions.
Graph (trivial) has 1836 edges and 1550 vertex of which 674 / 1550 are part of one of the 64 SCC in 8 ms
Free SCC test removed 610 places
Drop transitions (Empty/Sink Transition effects.) removed 769 transitions
Reduce isomorphic transitions removed 769 transitions.
Graph (complete) has 1397 edges and 940 vertex of which 931 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 485 transitions
Trivial Post-agglo rules discarded 485 transitions
Performed 485 trivial Post agglomeration. Transition count delta: 485
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 931 transition count 716
Reduce places removed 485 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 534 rules applied. Total rules applied 1028 place count 446 transition count 667
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 40 rules applied. Total rules applied 1068 place count 414 transition count 659
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1076 place count 406 transition count 659
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 1076 place count 406 transition count 608
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1178 place count 355 transition count 608
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1188 place count 345 transition count 594
Iterating global reduction 4 with 10 rules applied. Total rules applied 1198 place count 345 transition count 594
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1200 place count 345 transition count 592
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1202 place count 343 transition count 592
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1208 place count 337 transition count 586
Iterating global reduction 6 with 6 rules applied. Total rules applied 1214 place count 337 transition count 586
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1220 place count 337 transition count 580
Performed 152 Post agglomeration using F-continuation condition with reduction of 85 identical transitions.
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 7 with 304 rules applied. Total rules applied 1524 place count 185 transition count 343
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1544 place count 185 transition count 323
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1547 place count 182 transition count 320
Iterating global reduction 8 with 3 rules applied. Total rules applied 1550 place count 182 transition count 320
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1572 place count 171 transition count 307
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1584 place count 171 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1586 place count 170 transition count 294
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1589 place count 170 transition count 291
Performed 40 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 10 with 80 rules applied. Total rules applied 1669 place count 130 transition count 327
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 10 with 31 rules applied. Total rules applied 1700 place count 130 transition count 296
Discarding 20 places :
Symmetric choice reduction at 11 with 20 rule applications. Total rules 1720 place count 110 transition count 255
Iterating global reduction 11 with 20 rules applied. Total rules applied 1740 place count 110 transition count 255
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1745 place count 110 transition count 250
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1748 place count 107 transition count 244
Iterating global reduction 12 with 3 rules applied. Total rules applied 1751 place count 107 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1753 place count 107 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 13 with 17 rules applied. Total rules applied 1770 place count 107 transition count 225
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 1772 place count 106 transition count 224
Free-agglomeration rule applied 8 times.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1780 place count 106 transition count 216
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 1788 place count 98 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 1791 place count 98 transition count 213
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1792 place count 97 transition count 211
Iterating global reduction 14 with 1 rules applied. Total rules applied 1793 place count 97 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1794 place count 97 transition count 210
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1796 place count 97 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1797 place count 97 transition count 209
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1798 place count 96 transition count 208
Iterating global reduction 14 with 1 rules applied. Total rules applied 1799 place count 96 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1800 place count 95 transition count 207
Applied a total of 1800 rules in 227 ms. Remains 95 /1550 variables (removed 1455) and now considering 207/1981 (removed 1774) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 95/1550 places, 207/1981 transitions.
RANDOM walk for 40000 steps (343 resets) in 844 ms. (47 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40001 steps (128 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (125 resets) in 332 ms. (120 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (108 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
[2024-05-21 07:02:15] [INFO ] Flow matrix only has 197 transitions (discarded 10 similar events)
// Phase 1: matrix 197 rows 95 cols
[2024-05-21 07:02:15] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 07:02:15] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 76/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 183/263 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/288 variables, 11/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/292 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/292 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 104 constraints, problems are : Problem set: 0 solved, 3 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 95/95 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 76/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 183/263 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 25/288 variables, 11/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 07:02:15] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 6 ms to minimize.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Int declared 288/292 variables, and 103 constraints, problems are : Problem set: 3 solved, 0 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 3/4 constraints, State Equation: 91/95 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 340ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA CloudReconfiguration-PT-319-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2171 edges and 1550 vertex of which 1541 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.26 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 1981/1981 transitions.
Graph (trivial) has 1882 edges and 1550 vertex of which 700 / 1550 are part of one of the 64 SCC in 3 ms
Free SCC test removed 636 places
Ensure Unique test removed 737 transitions
Reduce isomorphic transitions removed 737 transitions.
Graph (complete) has 1428 edges and 914 vertex of which 905 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 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 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 904 transition count 745
Reduce places removed 493 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 517 rules applied. Total rules applied 1012 place count 411 transition count 721
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1024 place count 399 transition count 721
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1024 place count 399 transition count 674
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1118 place count 352 transition count 674
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1136 place count 334 transition count 647
Iterating global reduction 3 with 18 rules applied. Total rules applied 1154 place count 334 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 1158 place count 334 transition count 643
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1161 place count 331 transition count 643
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1172 place count 320 transition count 628
Iterating global reduction 5 with 11 rules applied. Total rules applied 1183 place count 320 transition count 628
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 1191 place count 320 transition count 620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1192 place count 319 transition count 620
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1194 place count 317 transition count 616
Iterating global reduction 7 with 2 rules applied. Total rules applied 1196 place count 317 transition count 616
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1198 place count 315 transition count 612
Iterating global reduction 7 with 2 rules applied. Total rules applied 1200 place count 315 transition count 612
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1202 place count 313 transition count 608
Iterating global reduction 7 with 2 rules applied. Total rules applied 1204 place count 313 transition count 608
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 311 transition count 604
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 311 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1210 place count 309 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1212 place count 309 transition count 600
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1213 place count 308 transition count 593
Iterating global reduction 7 with 1 rules applied. Total rules applied 1214 place count 308 transition count 593
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1215 place count 308 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1216 place count 307 transition count 592
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1217 place count 306 transition count 585
Iterating global reduction 9 with 1 rules applied. Total rules applied 1218 place count 306 transition count 585
Performed 143 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 9 with 286 rules applied. Total rules applied 1504 place count 163 transition count 360
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 12 rules applied. Total rules applied 1516 place count 163 transition count 348
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1518 place count 162 transition count 347
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1522 place count 158 transition count 342
Iterating global reduction 11 with 4 rules applied. Total rules applied 1526 place count 158 transition count 342
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 22 rules applied. Total rules applied 1548 place count 147 transition count 329
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1559 place count 147 transition count 318
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1593 place count 130 transition count 364
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1610 place count 130 transition count 347
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1619 place count 121 transition count 329
Iterating global reduction 13 with 9 rules applied. Total rules applied 1628 place count 121 transition count 329
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1634 place count 121 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 14 with 37 rules applied. Total rules applied 1671 place count 121 transition count 286
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1672 place count 121 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1673 place count 120 transition count 285
Applied a total of 1673 rules in 206 ms. Remains 120 /1550 variables (removed 1430) and now considering 285/1981 (removed 1696) transitions.
[2024-05-21 07:02:15] [INFO ] Flow matrix only has 225 transitions (discarded 60 similar events)
// Phase 1: matrix 225 rows 120 cols
[2024-05-21 07:02:15] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 07:02:16] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 07:02:16] [INFO ] Flow matrix only has 225 transitions (discarded 60 similar events)
[2024-05-21 07:02:16] [INFO ] Invariant cache hit.
[2024-05-21 07:02:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:02:16] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 324 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/1550 places, 285/1981 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 118 transition count 284
Applied a total of 2 rules in 10 ms. Remains 118 /119 variables (removed 1) and now considering 284/285 (removed 1) transitions.
[2024-05-21 07:02:16] [INFO ] Flow matrix only has 224 transitions (discarded 60 similar events)
// Phase 1: matrix 224 rows 118 cols
[2024-05-21 07:02:16] [INFO ] Computed 0 invariants in 5 ms
[2024-05-21 07:02:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 07:02:16] [INFO ] Flow matrix only has 224 transitions (discarded 60 similar events)
[2024-05-21 07:02:16] [INFO ] Invariant cache hit.
[2024-05-21 07:02:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:02:16] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/1550 places, 284/1981 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 772 ms. Remains : 118/1550 places, 284/1981 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLCardinality-00
Product exploration explored 100000 steps with 16252 reset in 241 ms.
Product exploration explored 100000 steps with 16208 reset in 189 ms.
Computed a total of 6 stabilizing places and 34 stable transitions
Computed a total of 6 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 121 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (7548 resets) in 419 ms. (95 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (1929 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
[2024-05-21 07:02:17] [INFO ] Flow matrix only has 224 transitions (discarded 60 similar events)
[2024-05-21 07:02:17] [INFO ] Invariant cache hit.
[2024-05-21 07:02:17] [INFO ] State equation strengthened by 4 read => feed constraints.
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) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 144/153 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 179/332 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/341 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/342 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/342 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 122 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[State Equation: 118/118 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 144/153 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 179/332 variables, 98/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/341 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/342 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/342 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[State Equation: 118/118 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 231ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 284/284 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 118 transition count 220
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 73 place count 109 transition count 220
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 117 place count 87 transition count 198
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 132 place count 87 transition count 183
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 144 place count 75 transition count 171
Iterating global reduction 3 with 12 rules applied. Total rules applied 156 place count 75 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 162 place count 75 transition count 165
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 178 place count 67 transition count 157
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 186 place count 67 transition count 149
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 191 place count 62 transition count 144
Iterating global reduction 5 with 5 rules applied. Total rules applied 196 place count 62 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 201 place count 62 transition count 139
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 219 place count 53 transition count 141
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 231 place count 53 transition count 129
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 237 place count 47 transition count 123
Iterating global reduction 7 with 6 rules applied. Total rules applied 243 place count 47 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 249 place count 47 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 264 place count 47 transition count 102
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 267 place count 44 transition count 93
Iterating global reduction 8 with 3 rules applied. Total rules applied 270 place count 44 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 276 place count 44 transition count 87
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 279 place count 41 transition count 84
Iterating global reduction 9 with 3 rules applied. Total rules applied 282 place count 41 transition count 84
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 291 place count 41 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 293 place count 40 transition count 83
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 296 place count 40 transition count 80
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 35 edges and 36 vertex of which 23 / 36 are part of one of the 9 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 10 with 8 rules applied. Total rules applied 304 place count 22 transition count 77
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 11 with 35 rules applied. Total rules applied 339 place count 22 transition count 42
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 342 place count 19 transition count 39
Iterating global reduction 12 with 3 rules applied. Total rules applied 345 place count 19 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 346 place count 19 transition count 38
Performed 3 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 352 place count 16 transition count 32
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 364 place count 16 transition count 20
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 366 place count 16 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 368 place count 14 transition count 18
Applied a total of 368 rules in 80 ms. Remains 14 /118 variables (removed 104) and now considering 18/284 (removed 266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 14/118 places, 18/284 transitions.
RANDOM walk for 30027 steps (11 resets) in 67 ms. (441 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 456 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 284/284 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-05-21 07:02:18] [INFO ] Flow matrix only has 224 transitions (discarded 60 similar events)
[2024-05-21 07:02:18] [INFO ] Invariant cache hit.
[2024-05-21 07:02:18] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 07:02:18] [INFO ] Flow matrix only has 224 transitions (discarded 60 similar events)
[2024-05-21 07:02:18] [INFO ] Invariant cache hit.
[2024-05-21 07:02:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:02:18] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-21 07:02:18] [INFO ] Redundant transitions in 47 ms returned []
Running 279 sub problems to find dead transitions.
[2024-05-21 07:02:18] [INFO ] Flow matrix only has 224 transitions (discarded 60 similar events)
[2024-05-21 07:02:18] [INFO ] Invariant cache hit.
[2024-05-21 07:02:18] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 223/340 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/341 variables, 1/121 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/121 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/342 variables, 1/122 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/122 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 0/122 constraints. Problems are: Problem set: 15 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 122 constraints, problems are : Problem set: 15 solved, 264 unsolved in 9704 ms.
Refiners :[State Equation: 118/118 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 223/340 variables, 117/117 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 3/120 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 264/384 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/384 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 1/341 variables, 1/385 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/385 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/342 variables, 1/386 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/386 constraints. Problems are: Problem set: 15 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/386 constraints. Problems are: Problem set: 15 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 386 constraints, problems are : Problem set: 15 solved, 264 unsolved in 17103 ms.
Refiners :[State Equation: 118/118 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 264/279 constraints, Known Traps: 0/0 constraints]
After SMT, in 26996ms problems are : Problem set: 15 solved, 264 unsolved
Search for dead transitions found 15 dead transitions in 27000ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 118/118 places, 269/284 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 111 transition count 251
Applied a total of 7 rules in 13 ms. Remains 111 /118 variables (removed 7) and now considering 251/269 (removed 18) transitions.
[2024-05-21 07:02:45] [INFO ] Flow matrix only has 197 transitions (discarded 54 similar events)
// Phase 1: matrix 197 rows 111 cols
[2024-05-21 07:02:45] [INFO ] Computed 0 invariants in 5 ms
[2024-05-21 07:02:45] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 07:02:46] [INFO ] Flow matrix only has 197 transitions (discarded 54 similar events)
[2024-05-21 07:02:46] [INFO ] Invariant cache hit.
[2024-05-21 07:02:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:02:46] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/118 places, 251/284 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27564 ms. Remains : 111/118 places, 251/284 transitions.
Computed a total of 6 stabilizing places and 19 stable transitions
Computed a total of 6 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 118 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (7543 resets) in 160 ms. (248 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (1917 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2024-05-21 07:02:46] [INFO ] Flow matrix only has 197 transitions (discarded 54 similar events)
[2024-05-21 07:02:46] [INFO ] Invariant cache hit.
[2024-05-21 07:02:46] [INFO ] State equation strengthened by 4 read => feed constraints.
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) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/141 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 157/298 variables, 91/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/307 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/308 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/308 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/141 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 157/298 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/307 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/308 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/308 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 35 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 310 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16332 reset in 136 ms.
Product exploration explored 100000 steps with 16250 reset in 176 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 251/251 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 251/251 (removed 0) transitions.
[2024-05-21 07:02:47] [INFO ] Flow matrix only has 197 transitions (discarded 54 similar events)
[2024-05-21 07:02:47] [INFO ] Invariant cache hit.
[2024-05-21 07:02:47] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 07:02:47] [INFO ] Flow matrix only has 197 transitions (discarded 54 similar events)
[2024-05-21 07:02:47] [INFO ] Invariant cache hit.
[2024-05-21 07:02:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:02:47] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-05-21 07:02:47] [INFO ] Redundant transitions in 21 ms returned []
Running 246 sub problems to find dead transitions.
[2024-05-21 07:02:47] [INFO ] Flow matrix only has 197 transitions (discarded 54 similar events)
[2024-05-21 07:02:47] [INFO ] Invariant cache hit.
[2024-05-21 07:02:47] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 196/306 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 1/307 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 1/308 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 115 constraints, problems are : Problem set: 0 solved, 246 unsolved in 8296 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 196/306 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 246/359 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 1/307 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 1/308 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 361 constraints, problems are : Problem set: 0 solved, 246 unsolved in 13443 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints]
After SMT, in 21904ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 21907ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22210 ms. Remains : 111/111 places, 251/251 transitions.
Treatment of property CloudReconfiguration-PT-319-LTLCardinality-00 finished in 53952 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 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 1981/1981 transitions.
Graph (trivial) has 1882 edges and 1550 vertex of which 701 / 1550 are part of one of the 63 SCC in 5 ms
Free SCC test removed 638 places
Ensure Unique test removed 741 transitions
Reduce isomorphic transitions removed 741 transitions.
Graph (complete) has 1424 edges and 912 vertex of which 903 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 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 491 rules applied. Total rules applied 493 place count 902 transition count 743
Reduce places removed 491 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 515 rules applied. Total rules applied 1008 place count 411 transition count 719
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1020 place count 399 transition count 719
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1020 place count 399 transition count 672
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1114 place count 352 transition count 672
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1133 place count 333 transition count 644
Iterating global reduction 3 with 19 rules applied. Total rules applied 1152 place count 333 transition count 644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 1156 place count 333 transition count 640
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1159 place count 330 transition count 640
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1172 place count 317 transition count 623
Iterating global reduction 5 with 13 rules applied. Total rules applied 1185 place count 317 transition count 623
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 1193 place count 317 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1194 place count 316 transition count 615
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1197 place count 313 transition count 609
Iterating global reduction 7 with 3 rules applied. Total rules applied 1200 place count 313 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1202 place count 311 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1204 place count 311 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1205 place count 311 transition count 604
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1206 place count 310 transition count 602
Iterating global reduction 8 with 1 rules applied. Total rules applied 1207 place count 310 transition count 602
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1208 place count 309 transition count 600
Iterating global reduction 8 with 1 rules applied. Total rules applied 1209 place count 309 transition count 600
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1210 place count 308 transition count 598
Iterating global reduction 8 with 1 rules applied. Total rules applied 1211 place count 308 transition count 598
Performed 142 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 8 with 284 rules applied. Total rules applied 1495 place count 166 transition count 375
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1508 place count 166 transition count 362
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1513 place count 161 transition count 352
Iterating global reduction 9 with 5 rules applied. Total rules applied 1518 place count 161 transition count 352
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1544 place count 148 transition count 337
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1557 place count 148 transition count 324
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1558 place count 147 transition count 322
Iterating global reduction 10 with 1 rules applied. Total rules applied 1559 place count 147 transition count 322
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1595 place count 129 transition count 373
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 1618 place count 129 transition count 350
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1627 place count 120 transition count 332
Iterating global reduction 11 with 9 rules applied. Total rules applied 1636 place count 120 transition count 332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1642 place count 120 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 12 with 40 rules applied. Total rules applied 1682 place count 120 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1683 place count 119 transition count 285
Applied a total of 1683 rules in 138 ms. Remains 119 /1550 variables (removed 1431) and now considering 285/1981 (removed 1696) transitions.
[2024-05-21 07:03:09] [INFO ] Flow matrix only has 225 transitions (discarded 60 similar events)
// Phase 1: matrix 225 rows 119 cols
[2024-05-21 07:03:09] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 07:03:09] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-21 07:03:09] [INFO ] Flow matrix only has 225 transitions (discarded 60 similar events)
[2024-05-21 07:03:09] [INFO ] Invariant cache hit.
[2024-05-21 07:03:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 07:03:10] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 286 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1550 places, 285/1981 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 284
Applied a total of 2 rules in 8 ms. Remains 117 /118 variables (removed 1) and now considering 284/285 (removed 1) transitions.
[2024-05-21 07:03:10] [INFO ] Flow matrix only has 224 transitions (discarded 60 similar events)
// Phase 1: matrix 224 rows 117 cols
[2024-05-21 07:03:10] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 07:03:10] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-21 07:03:10] [INFO ] Flow matrix only has 224 transitions (discarded 60 similar events)
[2024-05-21 07:03:10] [INFO ] Invariant cache hit.
[2024-05-21 07:03:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 07:03:10] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1550 places, 284/1981 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 829 ms. Remains : 117/1550 places, 284/1981 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLCardinality-03
Product exploration explored 100000 steps with 16228 reset in 142 ms.
Stack based approach found an accepted trace after 6906 steps with 1109 reset with depth 12 and stack size 10 in 9 ms.
FORMULA CloudReconfiguration-PT-319-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CloudReconfiguration-PT-319-LTLCardinality-03 finished in 1030 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 2 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 1981/1981 transitions.
Graph (trivial) has 1882 edges and 1550 vertex of which 698 / 1550 are part of one of the 63 SCC in 3 ms
Free SCC test removed 635 places
Ensure Unique test removed 737 transitions
Reduce isomorphic transitions removed 737 transitions.
Graph (complete) has 1428 edges and 915 vertex of which 906 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 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 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 905 transition count 745
Reduce places removed 493 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 515 rules applied. Total rules applied 1010 place count 412 transition count 723
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1021 place count 401 transition count 723
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1021 place count 401 transition count 675
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1117 place count 353 transition count 675
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1136 place count 334 transition count 647
Iterating global reduction 3 with 19 rules applied. Total rules applied 1155 place count 334 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 1159 place count 334 transition count 643
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1162 place count 331 transition count 643
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1175 place count 318 transition count 626
Iterating global reduction 5 with 13 rules applied. Total rules applied 1188 place count 318 transition count 626
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 1196 place count 318 transition count 618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1197 place count 317 transition count 618
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1201 place count 313 transition count 610
Iterating global reduction 7 with 4 rules applied. Total rules applied 1205 place count 313 transition count 610
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1208 place count 310 transition count 604
Iterating global reduction 7 with 3 rules applied. Total rules applied 1211 place count 310 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1213 place count 308 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1215 place count 308 transition count 600
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1217 place count 306 transition count 596
Iterating global reduction 7 with 2 rules applied. Total rules applied 1219 place count 306 transition count 596
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1221 place count 304 transition count 592
Iterating global reduction 7 with 2 rules applied. Total rules applied 1223 place count 304 transition count 592
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1224 place count 303 transition count 585
Iterating global reduction 7 with 1 rules applied. Total rules applied 1225 place count 303 transition count 585
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1226 place count 303 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1227 place count 302 transition count 584
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1228 place count 301 transition count 577
Iterating global reduction 9 with 1 rules applied. Total rules applied 1229 place count 301 transition count 577
Performed 138 Post agglomeration using F-continuation condition with reduction of 76 identical transitions.
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 9 with 276 rules applied. Total rules applied 1505 place count 163 transition count 363
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 13 rules applied. Total rules applied 1518 place count 163 transition count 350
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1520 place count 162 transition count 349
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1524 place count 158 transition count 344
Iterating global reduction 11 with 4 rules applied. Total rules applied 1528 place count 158 transition count 344
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1548 place count 148 transition count 332
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1557 place count 148 transition count 323
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1558 place count 147 transition count 321
Iterating global reduction 12 with 1 rules applied. Total rules applied 1559 place count 147 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1560 place count 147 transition count 320
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 38 rules applied. Total rules applied 1598 place count 128 transition count 367
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 1618 place count 128 transition count 347
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1627 place count 119 transition count 329
Iterating global reduction 14 with 9 rules applied. Total rules applied 1636 place count 119 transition count 329
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1641 place count 119 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 15 with 40 rules applied. Total rules applied 1681 place count 119 transition count 284
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 1687 place count 119 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1688 place count 119 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1689 place count 118 transition count 282
Applied a total of 1689 rules in 97 ms. Remains 118 /1550 variables (removed 1432) and now considering 282/1981 (removed 1699) transitions.
[2024-05-21 07:03:10] [INFO ] Flow matrix only has 223 transitions (discarded 59 similar events)
// Phase 1: matrix 223 rows 118 cols
[2024-05-21 07:03:10] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 07:03:10] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 07:03:10] [INFO ] Flow matrix only has 223 transitions (discarded 59 similar events)
[2024-05-21 07:03:10] [INFO ] Invariant cache hit.
[2024-05-21 07:03:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:03:11] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 240 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1550 places, 282/1981 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 281
Applied a total of 2 rules in 7 ms. Remains 116 /117 variables (removed 1) and now considering 281/282 (removed 1) transitions.
[2024-05-21 07:03:11] [INFO ] Flow matrix only has 222 transitions (discarded 59 similar events)
// Phase 1: matrix 222 rows 116 cols
[2024-05-21 07:03:11] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 07:03:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 07:03:11] [INFO ] Flow matrix only has 222 transitions (discarded 59 similar events)
[2024-05-21 07:03:11] [INFO ] Invariant cache hit.
[2024-05-21 07:03:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 07:03:11] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1550 places, 281/1981 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 538 ms. Remains : 116/1550 places, 281/1981 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLCardinality-04
Stuttering criterion allowed to conclude after 11714 steps with 1913 reset in 22 ms.
FORMULA CloudReconfiguration-PT-319-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLCardinality-04 finished in 647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 1981/1981 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1535 transition count 1966
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1535 transition count 1966
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 1528 transition count 1959
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 1528 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1524 transition count 1953
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1524 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 1524 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1522 transition count 1949
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1522 transition count 1949
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1520 transition count 1947
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1520 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 1520 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1519 transition count 1945
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1519 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1518 transition count 1944
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1518 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1517 transition count 1942
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1517 transition count 1942
Applied a total of 68 rules in 432 ms. Remains 1517 /1550 variables (removed 33) and now considering 1942/1981 (removed 39) transitions.
// Phase 1: matrix 1942 rows 1517 cols
[2024-05-21 07:03:11] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 07:03:11] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-21 07:03:12] [INFO ] Invariant cache hit.
[2024-05-21 07:03:12] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
Running 1941 sub problems to find dead transitions.
[2024-05-21 07:03:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3459 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 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/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1516/3459 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/1517 constraints, PredecessorRefiner: 0/1941 constraints, Known Traps: 0/0 constraints]
After SMT, in 60537ms problems are : Problem set: 0 solved, 1941 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Starting structural reductions in LTL mode, iteration 1 : 1517/1550 places, 1942/1981 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62175 ms. Remains : 1517/1550 places, 1942/1981 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLCardinality-05
Product exploration explored 100000 steps with 1143 reset in 162 ms.
Product exploration explored 100000 steps with 1182 reset in 180 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2127 edges and 1517 vertex of which 1508 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.15 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (464 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (179 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 397900 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 397900 steps, saw 111135 distinct states, run finished after 3005 ms. (steps per millisecond=132 ) properties seen :0
[2024-05-21 07:04:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 425/427 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1506 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1506 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1932/3438 variables, 1506/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3454 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3454 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3456 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3456 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3458 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3458 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3459 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3459 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3459 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3459/3459 variables, and 1521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1377 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1517/1517 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 425/427 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1506 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1506 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1932/3438 variables, 1506/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3454 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3454 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3456 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3456 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3458 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3458 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3459 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3459 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3459 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3459/3459 variables, and 1522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1383 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1517/1517 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2784ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 57 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1517/1517 places, 1942/1942 transitions.
Applied a total of 0 rules in 46 ms. Remains 1517 /1517 variables (removed 0) and now considering 1942/1942 (removed 0) transitions.
[2024-05-21 07:04:20] [INFO ] Invariant cache hit.
[2024-05-21 07:04:20] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 07:04:20] [INFO ] Invariant cache hit.
[2024-05-21 07:04:21] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
Running 1941 sub problems to find dead transitions.
[2024-05-21 07:04:21] [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/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3459 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 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/1516 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 1516/3459 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/1517 constraints, PredecessorRefiner: 0/1941 constraints, Known Traps: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 1941 unsolved
Search for dead transitions found 0 dead transitions in 60562ms
Finished structural reductions in LTL mode , in 1 iterations and 61763 ms. Remains : 1517/1517 places, 1942/1942 transitions.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2127 edges and 1517 vertex of which 1508 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (469 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (191 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 431026 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 431026 steps, saw 114907 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2024-05-21 07:05:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 425/427 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1506 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1506 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1932/3438 variables, 1506/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3454 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3454 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3456 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3456 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3458 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3458 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3459 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3459 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3459 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3459/3459 variables, and 1521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1316 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1517/1517 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 425/427 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1506 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1506 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1932/3438 variables, 1506/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3454 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3454 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3456 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3456 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3458 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3458 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3459 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3459 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3459 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3459/3459 variables, and 1522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1355 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1517/1517 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2681ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 57 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1187 reset in 147 ms.
Product exploration explored 100000 steps with 1175 reset in 128 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1517/1517 places, 1942/1942 transitions.
Graph (trivial) has 1847 edges and 1517 vertex of which 693 / 1517 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1389 edges and 887 vertex of which 878 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 480 place count 878 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 492 place count 878 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 492 place count 878 transition count 1207
Deduced a syphon composed of 499 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 513 place count 878 transition count 1207
Discarding 284 places :
Symmetric choice reduction at 2 with 284 rule applications. Total rules 797 place count 594 transition count 914
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 2 with 284 rules applied. Total rules applied 1081 place count 594 transition count 914
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1093 place count 582 transition count 898
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1105 place count 582 transition count 898
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1111 place count 582 transition count 892
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1123 place count 570 transition count 880
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1135 place count 570 transition count 880
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1137 place count 568 transition count 876
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1139 place count 568 transition count 876
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1141 place count 566 transition count 872
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1143 place count 566 transition count 872
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1147 place count 562 transition count 868
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1151 place count 562 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1153 place count 560 transition count 864
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1155 place count 560 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1157 place count 558 transition count 860
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1159 place count 558 transition count 860
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1163 place count 554 transition count 854
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1167 place count 554 transition count 854
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1171 place count 550 transition count 838
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1175 place count 550 transition count 838
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1176 place count 550 transition count 838
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1180 place count 546 transition count 834
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1184 place count 546 transition count 834
Performed 108 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 319 places in 0 ms
Iterating global reduction 4 with 108 rules applied. Total rules applied 1292 place count 546 transition count 912
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 1333 place count 546 transition count 871
Discarding 101 places :
Symmetric choice reduction at 5 with 101 rule applications. Total rules 1434 place count 445 transition count 759
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 101 rules applied. Total rules applied 1535 place count 445 transition count 759
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1541 place count 439 transition count 750
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1547 place count 439 transition count 750
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1554 place count 439 transition count 750
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1560 place count 439 transition count 744
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1576 place count 423 transition count 724
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 6 with 16 rules applied. Total rules applied 1592 place count 423 transition count 724
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1598 place count 423 transition count 718
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1602 place count 419 transition count 714
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1606 place count 419 transition count 714
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 1608 place count 419 transition count 714
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1612 place count 419 transition count 710
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1614 place count 417 transition count 708
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1616 place count 417 transition count 708
Performed 70 Post agglomeration using F-continuation condition with reduction of 119 identical transitions.
Deduced a syphon composed of 283 places in 0 ms
Iterating global reduction 8 with 70 rules applied. Total rules applied 1686 place count 417 transition count 1028
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 8 with 120 rules applied. Total rules applied 1806 place count 417 transition count 908
Discarding 123 places :
Symmetric choice reduction at 9 with 123 rule applications. Total rules 1929 place count 294 transition count 580
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 9 with 123 rules applied. Total rules applied 2052 place count 294 transition count 580
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 2064 place count 294 transition count 568
Discarding 24 places :
Symmetric choice reduction at 10 with 24 rule applications. Total rules 2088 place count 270 transition count 521
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 10 with 24 rules applied. Total rules applied 2112 place count 270 transition count 521
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2115 place count 270 transition count 573
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2118 place count 267 transition count 544
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2121 place count 267 transition count 544
Deduced a syphon composed of 145 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 10 with 45 rules applied. Total rules applied 2166 place count 267 transition count 499
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2170 place count 263 transition count 495
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2174 place count 263 transition count 495
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2177 place count 263 transition count 567
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2180 place count 260 transition count 552
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2183 place count 260 transition count 552
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 2183 rules in 365 ms. Remains 260 /1517 variables (removed 1257) and now considering 552/1942 (removed 1390) transitions.
[2024-05-21 07:05:29] [INFO ] Redundant transitions in 11 ms returned []
Running 551 sub problems to find dead transitions.
[2024-05-21 07:05:29] [INFO ] Flow matrix only has 493 transitions (discarded 59 similar events)
// Phase 1: matrix 493 rows 260 cols
[2024-05-21 07:05:29] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 07:05:29] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 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 TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 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 TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 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 TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 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 TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 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 TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
At refinement iteration 1 (OVERLAPS) 492/751 variables, 259/259 constraints. Problems are: Problem set: 267 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/751 variables, 3/262 constraints. Problems are: Problem set: 267 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/751 variables, 0/262 constraints. Problems are: Problem set: 267 solved, 284 unsolved
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
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/752 variables, 1/263 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 0/263 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 1/753 variables, 1/264 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/264 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 0/753 variables, 0/264 constraints. Problems are: Problem set: 282 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/753 variables, and 264 constraints, problems are : Problem set: 282 solved, 269 unsolved in 21989 ms.
Refiners :[State Equation: 260/260 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 282 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 489/607 variables, 118/118 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 3/121 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/607 variables, 269/390 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 0/390 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 145/752 variables, 142/532 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 0/532 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/753 variables, 1/533 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 0/533 constraints. Problems are: Problem set: 282 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/753 variables, 0/533 constraints. Problems are: Problem set: 282 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 753/753 variables, and 533 constraints, problems are : Problem set: 282 solved, 269 unsolved in 30006 ms.
Refiners :[State Equation: 260/260 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 269/551 constraints, Known Traps: 0/0 constraints]
After SMT, in 52281ms problems are : Problem set: 282 solved, 269 unsolved
Search for dead transitions found 282 dead transitions in 52288ms
Found 282 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 282 transitions
Dead transitions reduction (with SMT) removed 282 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 260/1517 places, 270/1942 transitions.
Graph (complete) has 421 edges and 260 vertex of which 119 are kept as prefixes of interest. Removing 141 places using SCC suffix rule.1 ms
Discarding 141 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 112 transition count 252
Applied a total of 8 rules in 12 ms. Remains 112 /260 variables (removed 148) and now considering 252/270 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1517 places, 252/1942 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52686 ms. Remains : 112/1517 places, 252/1942 transitions.
Support contains 2 out of 1517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1517/1517 places, 1942/1942 transitions.
Applied a total of 0 rules in 43 ms. Remains 1517 /1517 variables (removed 0) and now considering 1942/1942 (removed 0) transitions.
// Phase 1: matrix 1942 rows 1517 cols
[2024-05-21 07:06:22] [INFO ] Computed 4 invariants in 16 ms
[2024-05-21 07:06:22] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-21 07:06:22] [INFO ] Invariant cache hit.
[2024-05-21 07:06:23] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
Running 1941 sub problems to find dead transitions.
[2024-05-21 07:06:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3459 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 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/1516 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 0)
(s235 0)
(s236 0)
(s237 1)
(s238 1)
(s239 0)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 1)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 1)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 1)
(s299 1)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 1)
(s307 0)
(s308 0)
(s309 1)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 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)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 1)
(s694 1)
(s695 1)
(s696 0)
(s697 0)
(s698 0)
(s699 1)
(s700 1)
(s701 1)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 1)
(s707 1)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 0)
(s713 0)
(s714 1)
(s715 0)
(s716 1)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 1)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 1)
(s1095 1)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 1)
(s1102 0)
(s1103 0)
(s1104 1)
(s1105 0)
(s1106 0)
(s1107 1)
(s1108 1)
(s1109 0)
(s1110 0)
(s1111 0)
(s1112 1)
(s1113 0)
(s1114 1)
(s1115 1)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 1)
(s1126 0)
(s1127 0)
(s1128 1)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 1)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 1)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1516/3459 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 0/1941 constraints, Known Traps: 0/0 constraints]
After SMT, in 60510ms problems are : Problem set: 0 solved, 1941 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Finished structural reductions in LTL mode , in 1 iterations and 61849 ms. Remains : 1517/1517 places, 1942/1942 transitions.
Treatment of property CloudReconfiguration-PT-319-LTLCardinality-05 finished in 252773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(X(p2)&&p1))))'
Support contains 5 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 1981/1981 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1538 transition count 1969
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1538 transition count 1969
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1533 transition count 1964
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1533 transition count 1964
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 1530 transition count 1960
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 1530 transition count 1960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 1530 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1528 transition count 1956
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1528 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1526 transition count 1954
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1526 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 1526 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1525 transition count 1952
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1525 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1524 transition count 1951
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1524 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1523 transition count 1950
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1523 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1522 transition count 1948
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1522 transition count 1948
Applied a total of 58 rules in 493 ms. Remains 1522 /1550 variables (removed 28) and now considering 1948/1981 (removed 33) transitions.
// Phase 1: matrix 1948 rows 1522 cols
[2024-05-21 07:07:24] [INFO ] Computed 4 invariants in 12 ms
[2024-05-21 07:07:24] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-21 07:07:24] [INFO ] Invariant cache hit.
[2024-05-21 07:07:25] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
Running 1947 sub problems to find dead transitions.
[2024-05-21 07:07:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1521 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1521/3470 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 1947/1947 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1947 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1521 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1521/3470 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 0/1947 constraints, Known Traps: 0/0 constraints]
After SMT, in 60506ms problems are : Problem set: 0 solved, 1947 unsolved
Search for dead transitions found 0 dead transitions in 60523ms
Starting structural reductions in LTL mode, iteration 1 : 1522/1550 places, 1948/1981 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62251 ms. Remains : 1522/1550 places, 1948/1981 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLCardinality-07
Product exploration explored 100000 steps with 1171 reset in 143 ms.
Product exploration explored 100000 steps with 1127 reset in 155 ms.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2134 edges and 1522 vertex of which 1513 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 110 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (468 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (175 resets) in 349 ms. (114 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (168 resets) in 260 ms. (153 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (163 resets) in 317 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (162 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (181 resets) in 136 ms. (291 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (217 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (181 resets) in 175 ms. (227 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (198 resets) in 257 ms. (155 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (187 resets) in 345 ms. (115 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (193 resets) in 238 ms. (167 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (179 resets) in 243 ms. (163 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 145119 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 11
Probabilistic random walk after 145119 steps, saw 43706 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-21 07:08:31] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1506/1511 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1511 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1938/3449 variables, 1511/1515 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3449 variables, 0/1515 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/3451 variables, 1/1516 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3451 variables, 0/1516 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/3453 variables, 1/1517 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3453 variables, 0/1517 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 2/3455 variables, 1/1518 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3455 variables, 0/1518 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/3457 variables, 1/1519 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3457 variables, 0/1519 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/3459 variables, 1/1520 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3459 variables, 0/1520 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2/3461 variables, 1/1521 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3461 variables, 0/1521 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 2/3463 variables, 1/1522 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3463 variables, 0/1522 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 2/3465 variables, 1/1523 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3465 variables, 0/1523 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 2/3467 variables, 1/1524 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3467 variables, 0/1524 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 2/3469 variables, 1/1525 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3469/3470 variables, and 1525 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5008 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1521/1522 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1506/1511 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1511 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1938/3449 variables, 1511/1515 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3449 variables, 9/1524 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3449 variables, 0/1524 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/3451 variables, 1/1525 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3451 variables, 0/1525 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2/3453 variables, 1/1526 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3453 variables, 0/1526 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 2/3455 variables, 1/1527 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3455 variables, 0/1527 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 2/3457 variables, 1/1528 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3457 variables, 0/1528 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 2/3459 variables, 1/1529 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3459 variables, 0/1529 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 2/3461 variables, 1/1530 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3461 variables, 0/1530 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 2/3463 variables, 1/1531 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3463 variables, 0/1531 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 2/3465 variables, 1/1532 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3465 variables, 0/1532 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 2/3467 variables, 1/1533 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3467 variables, 0/1533 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 2/3469 variables, 1/1534 constraints. Problems are: Problem set: 2 solved, 9 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 3469/3470 variables, and 1534 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1521/1522 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 10049ms problems are : Problem set: 2 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1522/1522 places, 1948/1948 transitions.
Graph (trivial) has 1847 edges and 1522 vertex of which 692 / 1522 are part of one of the 64 SCC in 1 ms
Free SCC test removed 628 places
Drop transitions (Empty/Sink Transition effects.) removed 792 transitions
Reduce isomorphic transitions removed 792 transitions.
Graph (complete) has 1337 edges and 894 vertex of which 885 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 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 497 rules applied. Total rules applied 499 place count 885 transition count 655
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 547 rules applied. Total rules applied 1046 place count 395 transition count 598
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 38 rules applied. Total rules applied 1084 place count 358 transition count 597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1085 place count 357 transition count 597
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1085 place count 357 transition count 548
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1183 place count 308 transition count 548
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1194 place count 297 transition count 532
Iterating global reduction 4 with 11 rules applied. Total rules applied 1205 place count 297 transition count 532
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1208 place count 297 transition count 529
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1211 place count 294 transition count 529
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1218 place count 287 transition count 521
Iterating global reduction 6 with 7 rules applied. Total rules applied 1225 place count 287 transition count 521
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1231 place count 287 transition count 515
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1232 place count 286 transition count 509
Iterating global reduction 7 with 1 rules applied. Total rules applied 1233 place count 286 transition count 509
Performed 149 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 7 with 298 rules applied. Total rules applied 1531 place count 137 transition count 265
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1546 place count 137 transition count 250
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1549 place count 134 transition count 247
Iterating global reduction 8 with 3 rules applied. Total rules applied 1552 place count 134 transition count 247
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1578 place count 121 transition count 231
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1593 place count 121 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1595 place count 120 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1597 place count 120 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1599 place count 119 transition count 212
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1601 place count 119 transition count 210
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 11 with 66 rules applied. Total rules applied 1667 place count 86 transition count 255
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 11 with 46 rules applied. Total rules applied 1713 place count 86 transition count 209
Discarding 23 places :
Symmetric choice reduction at 12 with 23 rule applications. Total rules 1736 place count 63 transition count 178
Iterating global reduction 12 with 23 rules applied. Total rules applied 1759 place count 63 transition count 178
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1772 place count 63 transition count 165
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1777 place count 58 transition count 155
Iterating global reduction 13 with 5 rules applied. Total rules applied 1782 place count 58 transition count 155
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1787 place count 58 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1808 place count 58 transition count 129
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1810 place count 56 transition count 123
Iterating global reduction 14 with 2 rules applied. Total rules applied 1812 place count 56 transition count 123
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1814 place count 54 transition count 121
Iterating global reduction 14 with 2 rules applied. Total rules applied 1816 place count 54 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1820 place count 54 transition count 117
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 15 with 2 rules applied. Total rules applied 1822 place count 53 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1824 place count 53 transition count 114
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1827 place count 53 transition count 111
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 1831 place count 50 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1832 place count 50 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1833 place count 49 transition count 109
Applied a total of 1833 rules in 70 ms. Remains 49 /1522 variables (removed 1473) and now considering 109/1948 (removed 1839) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 49/1522 places, 109/1948 transitions.
RANDOM walk for 40000 steps (587 resets) in 64 ms. (615 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40003 steps (165 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2024-05-21 07:08:41] [INFO ] Flow matrix only has 102 transitions (discarded 7 similar events)
// Phase 1: matrix 102 rows 49 cols
[2024-05-21 07:08:41] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 07:08:41] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 42/151 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/49 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p0 (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F p1), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 26 factoid took 320 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 1522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 1948/1948 transitions.
Applied a total of 0 rules in 53 ms. Remains 1522 /1522 variables (removed 0) and now considering 1948/1948 (removed 0) transitions.
// Phase 1: matrix 1948 rows 1522 cols
[2024-05-21 07:08:42] [INFO ] Computed 4 invariants in 15 ms
[2024-05-21 07:08:42] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-21 07:08:42] [INFO ] Invariant cache hit.
[2024-05-21 07:08:43] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
Running 1947 sub problems to find dead transitions.
[2024-05-21 07:08: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 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 1.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 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 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 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1521 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1521/3470 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 1947/1947 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1947 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1521 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1521/3470 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 0/1947 constraints, Known Traps: 0/0 constraints]
After SMT, in 60506ms problems are : Problem set: 0 solved, 1947 unsolved
Search for dead transitions found 0 dead transitions in 60524ms
Finished structural reductions in LTL mode , in 1 iterations and 61751 ms. Remains : 1522/1522 places, 1948/1948 transitions.
Computed a total of 29 stabilizing places and 33 stable transitions
Graph (complete) has 2134 edges and 1522 vertex of which 1513 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 29 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (482 resets) in 342 ms. (116 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (172 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (185 resets) in 248 ms. (160 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (168 resets) in 284 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (172 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (171 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (176 resets) in 171 ms. (232 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (177 resets) in 145 ms. (273 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 206151 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 7
Probabilistic random walk after 206151 steps, saw 66221 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-21 07:09:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1506/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1511 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1938/3449 variables, 1511/1515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3449 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/3451 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3451 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/3453 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3453 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2/3455 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3455 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/3457 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3457 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/3459 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3459 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/3461 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3461 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/3463 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3463 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 2/3465 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3465 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 2/3467 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3467 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 2/3469 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3469 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 1/3470 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3470 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 0/3470 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3470/3470 variables, and 1526 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4605 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1522/1522 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1506/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1511 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1938/3449 variables, 1511/1515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3449 variables, 7/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3449 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/3451 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3451 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/3453 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3453 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/3455 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3455 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2/3457 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3457 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 2/3459 variables, 1/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3459 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 2/3461 variables, 1/1528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3461 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 2/3463 variables, 1/1529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3463 variables, 0/1529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 2/3465 variables, 1/1530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3465 variables, 0/1530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 2/3467 variables, 1/1531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3467 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 2/3469 variables, 1/1532 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3469 variables, 0/1532 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 1/3470 variables, 1/1533 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3470/3470 variables, and 1533 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1522/1522 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 9631ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1522/1522 places, 1948/1948 transitions.
Graph (trivial) has 1847 edges and 1522 vertex of which 692 / 1522 are part of one of the 64 SCC in 1 ms
Free SCC test removed 628 places
Drop transitions (Empty/Sink Transition effects.) removed 792 transitions
Reduce isomorphic transitions removed 792 transitions.
Graph (complete) has 1337 edges and 894 vertex of which 885 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 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 497 rules applied. Total rules applied 499 place count 885 transition count 655
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 547 rules applied. Total rules applied 1046 place count 395 transition count 598
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 38 rules applied. Total rules applied 1084 place count 358 transition count 597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1085 place count 357 transition count 597
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1085 place count 357 transition count 548
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1183 place count 308 transition count 548
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1194 place count 297 transition count 532
Iterating global reduction 4 with 11 rules applied. Total rules applied 1205 place count 297 transition count 532
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1208 place count 297 transition count 529
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1211 place count 294 transition count 529
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1218 place count 287 transition count 521
Iterating global reduction 6 with 7 rules applied. Total rules applied 1225 place count 287 transition count 521
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1231 place count 287 transition count 515
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1232 place count 286 transition count 509
Iterating global reduction 7 with 1 rules applied. Total rules applied 1233 place count 286 transition count 509
Performed 149 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 7 with 298 rules applied. Total rules applied 1531 place count 137 transition count 265
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1546 place count 137 transition count 250
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1549 place count 134 transition count 247
Iterating global reduction 8 with 3 rules applied. Total rules applied 1552 place count 134 transition count 247
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1578 place count 121 transition count 231
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1593 place count 121 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1595 place count 120 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1597 place count 120 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1599 place count 119 transition count 212
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1601 place count 119 transition count 210
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 11 with 66 rules applied. Total rules applied 1667 place count 86 transition count 255
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 11 with 46 rules applied. Total rules applied 1713 place count 86 transition count 209
Discarding 23 places :
Symmetric choice reduction at 12 with 23 rule applications. Total rules 1736 place count 63 transition count 178
Iterating global reduction 12 with 23 rules applied. Total rules applied 1759 place count 63 transition count 178
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1772 place count 63 transition count 165
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1777 place count 58 transition count 155
Iterating global reduction 13 with 5 rules applied. Total rules applied 1782 place count 58 transition count 155
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1787 place count 58 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1808 place count 58 transition count 129
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1810 place count 56 transition count 123
Iterating global reduction 14 with 2 rules applied. Total rules applied 1812 place count 56 transition count 123
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1814 place count 54 transition count 121
Iterating global reduction 14 with 2 rules applied. Total rules applied 1816 place count 54 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1820 place count 54 transition count 117
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 15 with 2 rules applied. Total rules applied 1822 place count 53 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1824 place count 53 transition count 114
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1827 place count 53 transition count 111
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 1831 place count 50 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1832 place count 50 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1833 place count 49 transition count 109
Applied a total of 1833 rules in 66 ms. Remains 49 /1522 variables (removed 1473) and now considering 109/1948 (removed 1839) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 49/1522 places, 109/1948 transitions.
RANDOM walk for 5405 steps (81 resets) in 19 ms. (270 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0)))), (F p1), (F (NOT p2)), (F (NOT (OR p2 p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 15 factoid took 302 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1159 reset in 136 ms.
Product exploration explored 100000 steps with 1199 reset in 143 ms.
Support contains 5 out of 1522 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 1948/1948 transitions.
Applied a total of 0 rules in 57 ms. Remains 1522 /1522 variables (removed 0) and now considering 1948/1948 (removed 0) transitions.
[2024-05-21 07:09:58] [INFO ] Invariant cache hit.
[2024-05-21 07:09:59] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 07:09:59] [INFO ] Invariant cache hit.
[2024-05-21 07:10:00] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 1947 sub problems to find dead transitions.
[2024-05-21 07:10:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1521 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1521/3470 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30054 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 1947/1947 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1947 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1521 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 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 1521/3470 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 0/1947 constraints, Known Traps: 0/0 constraints]
After SMT, in 60532ms problems are : Problem set: 0 solved, 1947 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Finished structural reductions in LTL mode , in 1 iterations and 61750 ms. Remains : 1522/1522 places, 1948/1948 transitions.
Treatment of property CloudReconfiguration-PT-319-LTLCardinality-07 finished in 216556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1||G(p2))))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 1981/1981 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1535 transition count 1966
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1535 transition count 1966
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 1527 transition count 1958
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 1527 transition count 1958
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1522 transition count 1951
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1522 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1522 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 1519 transition count 1946
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 1519 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 1516 transition count 1943
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 1516 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 1514 transition count 1940
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 1514 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 1512 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 1512 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 1510 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 1510 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 1509 transition count 1933
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 1509 transition count 1933
Applied a total of 84 rules in 522 ms. Remains 1509 /1550 variables (removed 41) and now considering 1933/1981 (removed 48) transitions.
// Phase 1: matrix 1933 rows 1509 cols
[2024-05-21 07:11:01] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 07:11:01] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-21 07:11:01] [INFO ] Invariant cache hit.
[2024-05-21 07:11:02] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2024-05-21 07:11:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints]
After SMT, in 60511ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1550 places, 1933/1981 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62211 ms. Remains : 1509/1550 places, 1933/1981 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 32213 steps with 376 reset in 40 ms.
FORMULA CloudReconfiguration-PT-319-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLCardinality-09 finished in 62415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 4 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 1981/1981 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1535 transition count 1966
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1535 transition count 1966
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 1528 transition count 1959
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 1528 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1524 transition count 1953
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1524 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 1521 transition count 1949
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 1521 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 1518 transition count 1946
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 1518 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 1518 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1516 transition count 1943
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1516 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 1514 transition count 1941
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 1514 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 1512 transition count 1938
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 1512 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 1511 transition count 1936
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 1511 transition count 1936
Applied a total of 79 rules in 544 ms. Remains 1511 /1550 variables (removed 39) and now considering 1936/1981 (removed 45) transitions.
// Phase 1: matrix 1936 rows 1511 cols
[2024-05-21 07:12:03] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 07:12:03] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 07:12:03] [INFO ] Invariant cache hit.
[2024-05-21 07:12:04] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2024-05-21 07:12:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
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 1510/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints]
After SMT, in 60506ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60524ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1550 places, 1936/1981 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62264 ms. Remains : 1511/1550 places, 1936/1981 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLCardinality-11
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-319-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLCardinality-11 finished in 62462 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(F(p1))&&p0))&&X(F(p2))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 1981/1981 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1536 transition count 1967
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1536 transition count 1967
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1529 transition count 1960
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1529 transition count 1960
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 1524 transition count 1953
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 1524 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 1524 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 1521 transition count 1948
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 1521 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 1518 transition count 1945
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 1518 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 1518 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 1516 transition count 1942
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 1514 transition count 1940
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 1514 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 1512 transition count 1937
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 1512 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1511 transition count 1935
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1511 transition count 1935
Applied a total of 80 rules in 568 ms. Remains 1511 /1550 variables (removed 39) and now considering 1935/1981 (removed 46) transitions.
// Phase 1: matrix 1935 rows 1511 cols
[2024-05-21 07:13:06] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 07:13:06] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-21 07:13:06] [INFO ] Invariant cache hit.
[2024-05-21 07:13:07] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2024-05-21 07:13:07] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.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 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 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 1.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 1.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 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 0.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 1.0)
(s733 0.0)
(s734 1.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 0.0)
(s1099 0.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 timeout
0.0)
(s1112 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, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
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 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 1)
(s237 1)
(s238 0)
(s239 1)
(s240 1)
(s241 1)
(s242 0)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 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 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints]
After SMT, in 60510ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1550 places, 1935/1981 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62268 ms. Remains : 1511/1550 places, 1935/1981 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLCardinality-12
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-319-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLCardinality-12 finished in 62524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p1)))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 1981/1981 transitions.
Graph (trivial) has 1880 edges and 1550 vertex of which 701 / 1550 are part of one of the 63 SCC in 3 ms
Free SCC test removed 638 places
Ensure Unique test removed 741 transitions
Reduce isomorphic transitions removed 741 transitions.
Graph (complete) has 1424 edges and 912 vertex of which 903 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 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 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 487 rules applied. Total rules applied 489 place count 902 transition count 747
Reduce places removed 487 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 511 rules applied. Total rules applied 1000 place count 415 transition count 723
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1013 place count 403 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1014 place count 402 transition count 722
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1014 place count 402 transition count 675
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1108 place count 355 transition count 675
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1127 place count 336 transition count 647
Iterating global reduction 4 with 19 rules applied. Total rules applied 1146 place count 336 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 4 rules applied. Total rules applied 1150 place count 336 transition count 643
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1153 place count 333 transition count 643
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1166 place count 320 transition count 626
Iterating global reduction 6 with 13 rules applied. Total rules applied 1179 place count 320 transition count 626
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 1187 place count 320 transition count 618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1188 place count 319 transition count 618
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1192 place count 315 transition count 610
Iterating global reduction 8 with 4 rules applied. Total rules applied 1196 place count 315 transition count 610
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1199 place count 312 transition count 604
Iterating global reduction 8 with 3 rules applied. Total rules applied 1202 place count 312 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1203 place count 312 transition count 603
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1205 place count 310 transition count 599
Iterating global reduction 9 with 2 rules applied. Total rules applied 1207 place count 310 transition count 599
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1209 place count 308 transition count 595
Iterating global reduction 9 with 2 rules applied. Total rules applied 1211 place count 308 transition count 595
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1213 place count 306 transition count 591
Iterating global reduction 9 with 2 rules applied. Total rules applied 1215 place count 306 transition count 591
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1216 place count 305 transition count 584
Iterating global reduction 9 with 1 rules applied. Total rules applied 1217 place count 305 transition count 584
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 1218 place count 305 transition count 583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1219 place count 304 transition count 583
Performed 140 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 11 with 280 rules applied. Total rules applied 1499 place count 164 transition count 362
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1510 place count 164 transition count 351
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1514 place count 160 transition count 346
Iterating global reduction 12 with 4 rules applied. Total rules applied 1518 place count 160 transition count 346
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 12 with 24 rules applied. Total rules applied 1542 place count 148 transition count 332
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 1554 place count 148 transition count 320
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 13 with 36 rules applied. Total rules applied 1590 place count 130 transition count 366
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 13 with 19 rules applied. Total rules applied 1609 place count 130 transition count 347
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1618 place count 121 transition count 329
Iterating global reduction 14 with 9 rules applied. Total rules applied 1627 place count 121 transition count 329
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1633 place count 121 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 15 with 37 rules applied. Total rules applied 1670 place count 121 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1671 place count 120 transition count 285
Applied a total of 1671 rules in 81 ms. Remains 120 /1550 variables (removed 1430) and now considering 285/1981 (removed 1696) transitions.
[2024-05-21 07:14:08] [INFO ] Flow matrix only has 227 transitions (discarded 58 similar events)
// Phase 1: matrix 227 rows 120 cols
[2024-05-21 07:14:08] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 07:14:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 07:14:08] [INFO ] Flow matrix only has 227 transitions (discarded 58 similar events)
[2024-05-21 07:14:08] [INFO ] Invariant cache hit.
[2024-05-21 07:14:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 07:14:08] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 203 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/1550 places, 285/1981 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 284
Applied a total of 2 rules in 4 ms. Remains 118 /119 variables (removed 1) and now considering 284/285 (removed 1) transitions.
[2024-05-21 07:14:08] [INFO ] Flow matrix only has 226 transitions (discarded 58 similar events)
// Phase 1: matrix 226 rows 118 cols
[2024-05-21 07:14:08] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 07:14:08] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 07:14:08] [INFO ] Flow matrix only has 226 transitions (discarded 58 similar events)
[2024-05-21 07:14:08] [INFO ] Invariant cache hit.
[2024-05-21 07:14:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 07:14:08] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 118/1550 places, 284/1981 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 489 ms. Remains : 118/1550 places, 284/1981 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-319-LTLCardinality-13
Stuttering criterion allowed to conclude after 14399 steps with 2273 reset in 33 ms.
FORMULA CloudReconfiguration-PT-319-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-319-LTLCardinality-13 finished in 638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-319-LTLCardinality-05
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1550/1550 places, 1981/1981 transitions.
Graph (trivial) has 1883 edges and 1550 vertex of which 701 / 1550 are part of one of the 63 SCC in 1 ms
Free SCC test removed 638 places
Ensure Unique test removed 741 transitions
Reduce isomorphic transitions removed 741 transitions.
Graph (complete) has 1424 edges and 912 vertex of which 903 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 492 place count 902 transition count 744
Reduce places removed 490 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 514 rules applied. Total rules applied 1006 place count 412 transition count 720
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1019 place count 400 transition count 719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1020 place count 399 transition count 719
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1020 place count 399 transition count 672
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1114 place count 352 transition count 672
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1132 place count 334 transition count 645
Iterating global reduction 4 with 18 rules applied. Total rules applied 1150 place count 334 transition count 645
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 4 rules applied. Total rules applied 1154 place count 334 transition count 641
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1157 place count 331 transition count 641
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1169 place count 319 transition count 625
Iterating global reduction 6 with 12 rules applied. Total rules applied 1181 place count 319 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1187 place count 319 transition count 619
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1191 place count 315 transition count 611
Iterating global reduction 7 with 4 rules applied. Total rules applied 1195 place count 315 transition count 611
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1198 place count 312 transition count 605
Iterating global reduction 7 with 3 rules applied. Total rules applied 1201 place count 312 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1202 place count 312 transition count 604
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1204 place count 310 transition count 600
Iterating global reduction 8 with 2 rules applied. Total rules applied 1206 place count 310 transition count 600
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1208 place count 308 transition count 596
Iterating global reduction 8 with 2 rules applied. Total rules applied 1210 place count 308 transition count 596
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1212 place count 306 transition count 592
Iterating global reduction 8 with 2 rules applied. Total rules applied 1214 place count 306 transition count 592
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1215 place count 305 transition count 585
Iterating global reduction 8 with 1 rules applied. Total rules applied 1216 place count 305 transition count 585
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 1217 place count 305 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1218 place count 304 transition count 584
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1219 place count 303 transition count 577
Iterating global reduction 10 with 1 rules applied. Total rules applied 1220 place count 303 transition count 577
Performed 142 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 10 with 284 rules applied. Total rules applied 1504 place count 161 transition count 354
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 10 with 12 rules applied. Total rules applied 1516 place count 161 transition count 342
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1518 place count 160 transition count 341
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1522 place count 156 transition count 336
Iterating global reduction 12 with 4 rules applied. Total rules applied 1526 place count 156 transition count 336
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 12 with 22 rules applied. Total rules applied 1548 place count 145 transition count 323
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 12 with 11 rules applied. Total rules applied 1559 place count 145 transition count 312
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 13 with 34 rules applied. Total rules applied 1593 place count 128 transition count 358
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 13 with 16 rules applied. Total rules applied 1609 place count 128 transition count 342
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1618 place count 119 transition count 324
Iterating global reduction 14 with 9 rules applied. Total rules applied 1627 place count 119 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1632 place count 119 transition count 319
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1633 place count 118 transition count 318
Applied a total of 1633 rules in 87 ms. Remains 118 /1550 variables (removed 1432) and now considering 318/1981 (removed 1663) transitions.
[2024-05-21 07:14:09] [INFO ] Flow matrix only has 259 transitions (discarded 59 similar events)
// Phase 1: matrix 259 rows 118 cols
[2024-05-21 07:14:09] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 07:14:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 07:14:09] [INFO ] Flow matrix only has 259 transitions (discarded 59 similar events)
[2024-05-21 07:14:09] [INFO ] Invariant cache hit.
[2024-05-21 07:14:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:14:09] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 205 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/1550 places, 318/1981 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 317
Applied a total of 2 rules in 3 ms. Remains 116 /117 variables (removed 1) and now considering 317/318 (removed 1) transitions.
[2024-05-21 07:14:09] [INFO ] Flow matrix only has 258 transitions (discarded 59 similar events)
// Phase 1: matrix 258 rows 116 cols
[2024-05-21 07:14:09] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 07:14:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 07:14:09] [INFO ] Flow matrix only has 258 transitions (discarded 59 similar events)
[2024-05-21 07:14:09] [INFO ] Invariant cache hit.
[2024-05-21 07:14:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 07:14:09] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 116/1550 places, 317/1981 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 505 ms. Remains : 116/1550 places, 317/1981 transitions.
Running random walk in product with property : CloudReconfiguration-PT-319-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 668 steps with 113 reset in 1 ms.
Treatment of property CloudReconfiguration-PT-319-LTLCardinality-05 finished in 765 ms.
FORMULA CloudReconfiguration-PT-319-LTLCardinality-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(X(p2)&&p1))))'
[2024-05-21 07:14:09] [INFO ] Flatten gal took : 58 ms
[2024-05-21 07:14:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 07:14:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1550 places, 1981 transitions and 4149 arcs took 18 ms.
Total runtime 792406 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudReconfiguration-PT-319

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1550
TRANSITIONS: 1981
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.021s, Sys 0.006s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.004s]


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

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

Process ID: 1509
MODEL NAME: /home/mcc/execution/413/model
1550 places, 1981 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudReconfiguration-PT-319-LTLCardinality-00 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-319-LTLCardinality-05 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-319-LTLCardinality-07 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716276621663

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-319"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CloudReconfiguration-PT-319, 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 r091-tall-171624187300259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-319.tgz
mv CloudReconfiguration-PT-319 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;