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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 19:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716258219161

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-302
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 02:23:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 02:23:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 02:23:40] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-21 02:23:40] [INFO ] Transformed 2585 places.
[2024-05-21 02:23:40] [INFO ] Transformed 3095 transitions.
[2024-05-21 02:23:40] [INFO ] Found NUPN structural information;
[2024-05-21 02:23:40] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-302-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-302-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-302-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 506 places :
Symmetric choice reduction at 0 with 506 rule applications. Total rules 506 place count 2079 transition count 2589
Iterating global reduction 0 with 506 rules applied. Total rules applied 1012 place count 2079 transition count 2589
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1040 place count 2079 transition count 2561
Discarding 228 places :
Symmetric choice reduction at 1 with 228 rule applications. Total rules 1268 place count 1851 transition count 2333
Iterating global reduction 1 with 228 rules applied. Total rules applied 1496 place count 1851 transition count 2333
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 1579 place count 1768 transition count 2250
Iterating global reduction 1 with 83 rules applied. Total rules applied 1662 place count 1768 transition count 2250
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 1677 place count 1768 transition count 2235
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1719 place count 1726 transition count 2193
Iterating global reduction 2 with 42 rules applied. Total rules applied 1761 place count 1726 transition count 2193
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1769 place count 1726 transition count 2185
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1799 place count 1696 transition count 2152
Iterating global reduction 3 with 30 rules applied. Total rules applied 1829 place count 1696 transition count 2152
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1855 place count 1670 transition count 2126
Iterating global reduction 3 with 26 rules applied. Total rules applied 1881 place count 1670 transition count 2126
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1905 place count 1646 transition count 2102
Iterating global reduction 3 with 24 rules applied. Total rules applied 1929 place count 1646 transition count 2102
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1953 place count 1622 transition count 2078
Iterating global reduction 3 with 24 rules applied. Total rules applied 1977 place count 1622 transition count 2078
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1998 place count 1601 transition count 2043
Iterating global reduction 3 with 21 rules applied. Total rules applied 2019 place count 1601 transition count 2043
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2025 place count 1595 transition count 2033
Iterating global reduction 3 with 6 rules applied. Total rules applied 2031 place count 1595 transition count 2033
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2037 place count 1589 transition count 2025
Iterating global reduction 3 with 6 rules applied. Total rules applied 2043 place count 1589 transition count 2025
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2045 place count 1589 transition count 2023
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2047 place count 1587 transition count 2021
Iterating global reduction 4 with 2 rules applied. Total rules applied 2049 place count 1587 transition count 2021
Applied a total of 2049 rules in 1636 ms. Remains 1587 /2585 variables (removed 998) and now considering 2021/3095 (removed 1074) transitions.
// Phase 1: matrix 2021 rows 1587 cols
[2024-05-21 02:23:42] [INFO ] Computed 4 invariants in 32 ms
[2024-05-21 02:23:43] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-21 02:23:43] [INFO ] Invariant cache hit.
[2024-05-21 02:23:44] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
Running 2020 sub problems to find dead transitions.
[2024-05-21 02:23:44] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2020 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1586/3608 variables, and 4 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 30079 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1587 constraints, PredecessorRefiner: 2020/2020 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2020 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2020 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 1586/3608 variables, and 4 constraints, problems are : Problem set: 0 solved, 2020 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1587 constraints, PredecessorRefiner: 0/2020 constraints, Known Traps: 0/0 constraints]
After SMT, in 60900ms problems are : Problem set: 0 solved, 2020 unsolved
Search for dead transitions found 0 dead transitions in 60935ms
Starting structural reductions in LTL mode, iteration 1 : 1587/2585 places, 2021/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64334 ms. Remains : 1587/2585 places, 2021/3095 transitions.
Support contains 45 out of 1587 places after structural reductions.
[2024-05-21 02:24:45] [INFO ] Flatten gal took : 131 ms
[2024-05-21 02:24:45] [INFO ] Flatten gal took : 73 ms
[2024-05-21 02:24:45] [INFO ] Input system was already deterministic with 2021 transitions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (283 resets) in 2776 ms. (14 steps per ms) remains 19/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
[2024-05-21 02:24:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1542/1576 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1576 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 2011/3587 variables, 1576/1580 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3587 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2/3589 variables, 1/1581 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3589 variables, 0/1581 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 2/3591 variables, 1/1582 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3591 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 2/3593 variables, 1/1583 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3593 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 2/3595 variables, 1/1584 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3595/3608 variables, and 1584 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5019 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1580/1587 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1542/1576 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1576 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 2011/3587 variables, 1576/1580 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3587 variables, 19/1599 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3587 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 2/3589 variables, 1/1600 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3589 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 2/3591 variables, 1/1601 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3591 variables, 0/1601 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 2/3593 variables, 1/1602 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3593/3608 variables, and 1602 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1579/1587 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 10060ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 1587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Graph (trivial) has 1863 edges and 1587 vertex of which 589 / 1587 are part of one of the 61 SCC in 10 ms
Free SCC test removed 528 places
Drop transitions (Empty/Sink Transition effects.) removed 664 transitions
Reduce isomorphic transitions removed 664 transitions.
Graph (complete) has 1533 edges and 1059 vertex of which 1050 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 561 rules applied. Total rules applied 563 place count 1050 transition count 792
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 614 rules applied. Total rules applied 1177 place count 496 transition count 732
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 44 rules applied. Total rules applied 1221 place count 458 transition count 726
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 9 rules applied. Total rules applied 1230 place count 455 transition count 720
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 11 rules applied. Total rules applied 1241 place count 452 transition count 712
Reduce places removed 5 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 11 rules applied. Total rules applied 1252 place count 447 transition count 706
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1258 place count 441 transition count 706
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 55 Pre rules applied. Total rules applied 1258 place count 441 transition count 651
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 7 with 110 rules applied. Total rules applied 1368 place count 386 transition count 651
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1375 place count 379 transition count 641
Iterating global reduction 7 with 7 rules applied. Total rules applied 1382 place count 379 transition count 641
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 7 with 2 rules applied. Total rules applied 1384 place count 379 transition count 639
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1386 place count 377 transition count 639
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1391 place count 372 transition count 633
Iterating global reduction 9 with 5 rules applied. Total rules applied 1396 place count 372 transition count 633
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1400 place count 372 transition count 629
Performed 168 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 10 with 336 rules applied. Total rules applied 1736 place count 204 transition count 374
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 1756 place count 204 transition count 354
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1759 place count 201 transition count 351
Iterating global reduction 11 with 3 rules applied. Total rules applied 1762 place count 201 transition count 351
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 22 rules applied. Total rules applied 1784 place count 190 transition count 339
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1797 place count 190 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1799 place count 189 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1801 place count 189 transition count 323
Performed 43 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 13 with 86 rules applied. Total rules applied 1887 place count 146 transition count 372
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 13 with 41 rules applied. Total rules applied 1928 place count 146 transition count 331
Discarding 17 places :
Symmetric choice reduction at 14 with 17 rule applications. Total rules 1945 place count 129 transition count 297
Iterating global reduction 14 with 17 rules applied. Total rules applied 1962 place count 129 transition count 297
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1965 place count 129 transition count 294
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1967 place count 127 transition count 290
Iterating global reduction 15 with 2 rules applied. Total rules applied 1969 place count 127 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1970 place count 127 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1991 place count 127 transition count 268
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 1993 place count 125 transition count 266
Iterating global reduction 16 with 2 rules applied. Total rules applied 1995 place count 125 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1997 place count 125 transition count 264
Free-agglomeration rule applied 8 times.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2005 place count 125 transition count 256
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 2014 place count 117 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 2017 place count 117 transition count 252
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 17 with 12 rules applied. Total rules applied 2029 place count 117 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2030 place count 117 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 2031 place count 116 transition count 250
Applied a total of 2031 rules in 299 ms. Remains 116 /1587 variables (removed 1471) and now considering 250/2021 (removed 1771) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 116/1587 places, 250/2021 transitions.
RANDOM walk for 37960 steps (429 resets) in 1011 ms. (37 steps per ms) remains 0/19 properties
FORMULA CloudReconfiguration-PT-302-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CloudReconfiguration-PT-302-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CloudReconfiguration-PT-302-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2200 edges and 1587 vertex of which 1578 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.27 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))||(G(p2)&&X(p1))))'
Support contains 5 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1562 transition count 1996
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1562 transition count 1996
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 1562 transition count 1994
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 68 place count 1546 transition count 1978
Iterating global reduction 1 with 16 rules applied. Total rules applied 84 place count 1546 transition count 1978
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 94 place count 1536 transition count 1968
Iterating global reduction 1 with 10 rules applied. Total rules applied 104 place count 1536 transition count 1968
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 106 place count 1536 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 1531 transition count 1961
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 1531 transition count 1961
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 1526 transition count 1955
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 1526 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 1523 transition count 1952
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 1523 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 1521 transition count 1950
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 1521 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 1519 transition count 1947
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 1519 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 1518 transition count 1945
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 1518 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 1517 transition count 1944
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 1517 transition count 1944
Applied a total of 144 rules in 588 ms. Remains 1517 /1587 variables (removed 70) and now considering 1944/2021 (removed 77) transitions.
// Phase 1: matrix 1944 rows 1517 cols
[2024-05-21 02:24:58] [INFO ] Computed 4 invariants in 10 ms
[2024-05-21 02:24:58] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-21 02:24:58] [INFO ] Invariant cache hit.
[2024-05-21 02:24:59] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
Running 1943 sub problems to find dead transitions.
[2024-05-21 02:24:59] [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, 1943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3461 variables, and 4 constraints, problems are : Problem set: 0 solved, 1943 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 1943/1943 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1943 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1516/3461 variables, and 4 constraints, problems are : Problem set: 0 solved, 1943 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 0/1943 constraints, Known Traps: 0/0 constraints]
After SMT, in 60606ms problems are : Problem set: 0 solved, 1943 unsolved
Search for dead transitions found 0 dead transitions in 60627ms
Starting structural reductions in LTL mode, iteration 1 : 1517/1587 places, 1944/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62470 ms. Remains : 1517/1587 places, 1944/2021 transitions.
Stuttering acceptance computed with spot in 409 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-00
Product exploration explored 100000 steps with 708 reset in 284 ms.
Product exploration explored 100000 steps with 716 reset in 235 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2123 edges and 1517 vertex of which 1508 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 117 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (290 resets) in 285 ms. (139 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (75 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (72 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (80 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 292636 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 3
Probabilistic random walk after 292636 steps, saw 73469 distinct states, run finished after 3005 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-21 02:26:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1097/1100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 406/1506 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1506 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1934/3440 variables, 1506/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3440 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3442 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3442 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3444 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3444 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3446 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3446 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3448 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3448 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3450 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3452 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3452 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3454 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3454 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3456 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3456 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3458 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3458 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3460 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3460 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/3461 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3461 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/3461 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3461/3461 variables, and 1521 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2414 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1517/1517 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1097/1100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 406/1506 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1506 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1934/3440 variables, 1506/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3440 variables, 3/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3442 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3442 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3444 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3444 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3446 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3446 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3448 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3448 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3450 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3450 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3452 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3454 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3454 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3456 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3456 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3458 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3458 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/3460 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3460 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/3461 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3461 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/3461 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3461/3461 variables, and 1524 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2789 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1517/1517 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 5217ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 289 steps, including 1 resets, run visited all 3 properties in 6 ms. (steps per millisecond=48 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 14 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 16 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 1517 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1517/1517 places, 1944/1944 transitions.
Graph (trivial) has 1847 edges and 1517 vertex of which 679 / 1517 are part of one of the 62 SCC in 5 ms
Free SCC test removed 617 places
Ensure Unique test removed 715 transitions
Reduce isomorphic transitions removed 715 transitions.
Graph (complete) has 1402 edges and 900 vertex of which 891 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 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 481 place count 890 transition count 744
Reduce places removed 479 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 505 rules applied. Total rules applied 986 place count 411 transition count 718
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 1001 place count 398 transition count 716
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1004 place count 397 transition count 714
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1008 place count 396 transition count 711
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1011 place count 394 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1012 place count 393 transition count 710
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 47 Pre rules applied. Total rules applied 1012 place count 393 transition count 663
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 1106 place count 346 transition count 663
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1122 place count 330 transition count 637
Iterating global reduction 7 with 16 rules applied. Total rules applied 1138 place count 330 transition count 637
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 7 with 3 rules applied. Total rules applied 1141 place count 330 transition count 634
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1144 place count 327 transition count 634
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1153 place count 318 transition count 622
Iterating global reduction 9 with 9 rules applied. Total rules applied 1162 place count 318 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1168 place count 318 transition count 616
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1170 place count 316 transition count 612
Iterating global reduction 10 with 2 rules applied. Total rules applied 1172 place count 316 transition count 612
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1174 place count 314 transition count 608
Iterating global reduction 10 with 2 rules applied. Total rules applied 1176 place count 314 transition count 608
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1177 place count 313 transition count 606
Iterating global reduction 10 with 1 rules applied. Total rules applied 1178 place count 313 transition count 606
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1179 place count 312 transition count 604
Iterating global reduction 10 with 1 rules applied. Total rules applied 1180 place count 312 transition count 604
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1181 place count 311 transition count 602
Iterating global reduction 10 with 1 rules applied. Total rules applied 1182 place count 311 transition count 602
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1183 place count 310 transition count 595
Iterating global reduction 10 with 1 rules applied. Total rules applied 1184 place count 310 transition count 595
Performed 142 Post agglomeration using F-continuation condition with reduction of 79 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 1468 place count 168 transition count 374
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1483 place count 168 transition count 359
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1487 place count 164 transition count 354
Iterating global reduction 11 with 4 rules applied. Total rules applied 1491 place count 164 transition count 354
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 11 with 26 rules applied. Total rules applied 1517 place count 151 transition count 338
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1531 place count 151 transition count 324
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 12 with 36 rules applied. Total rules applied 1567 place count 133 transition count 364
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 12 with 22 rules applied. Total rules applied 1589 place count 133 transition count 342
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1598 place count 124 transition count 324
Iterating global reduction 13 with 9 rules applied. Total rules applied 1607 place count 124 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1612 place count 124 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 14 with 40 rules applied. Total rules applied 1652 place count 124 transition count 279
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 1655 place count 124 transition count 279
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 1656 place count 124 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1657 place count 123 transition count 277
Applied a total of 1657 rules in 150 ms. Remains 123 /1517 variables (removed 1394) and now considering 277/1944 (removed 1667) transitions.
[2024-05-21 02:26:10] [INFO ] Flow matrix only has 221 transitions (discarded 56 similar events)
// Phase 1: matrix 221 rows 123 cols
[2024-05-21 02:26:10] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 02:26:10] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 02:26:10] [INFO ] Flow matrix only has 221 transitions (discarded 56 similar events)
[2024-05-21 02:26:10] [INFO ] Invariant cache hit.
[2024-05-21 02:26:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 02:26:10] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [13, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 167 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/1517 places, 277/1944 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 275
Applied a total of 4 rules in 6 ms. Remains 119 /121 variables (removed 2) and now considering 275/277 (removed 2) transitions.
[2024-05-21 02:26:10] [INFO ] Flow matrix only has 219 transitions (discarded 56 similar events)
// Phase 1: matrix 219 rows 119 cols
[2024-05-21 02:26:10] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 02:26:10] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 02:26:10] [INFO ] Flow matrix only has 219 transitions (discarded 56 similar events)
[2024-05-21 02:26:10] [INFO ] Invariant cache hit.
[2024-05-21 02:26:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 02:26:10] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/1517 places, 275/1944 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 509 ms. Remains : 119/1517 places, 275/1944 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 6187 steps (652 resets) in 122 ms. (50 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 298 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering criterion allowed to conclude after 1728 steps with 154 reset in 13 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-00 finished in 73922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1560 transition count 1994
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1560 transition count 1994
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 1560 transition count 1992
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 74 place count 1542 transition count 1974
Iterating global reduction 1 with 18 rules applied. Total rules applied 92 place count 1542 transition count 1974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 93 place count 1542 transition count 1973
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 104 place count 1531 transition count 1961
Iterating global reduction 2 with 11 rules applied. Total rules applied 115 place count 1531 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 1531 transition count 1959
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 122 place count 1526 transition count 1954
Iterating global reduction 3 with 5 rules applied. Total rules applied 127 place count 1526 transition count 1954
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 1521 transition count 1948
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 1521 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 1518 transition count 1945
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 1518 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 1515 transition count 1941
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 1515 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 1512 transition count 1936
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 1510 transition count 1933
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 1510 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 161 place count 1509 transition count 1931
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 1509 transition count 1931
Applied a total of 162 rules in 551 ms. Remains 1509 /1587 variables (removed 78) and now considering 1931/2021 (removed 90) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2024-05-21 02:26:12] [INFO ] Computed 4 invariants in 23 ms
[2024-05-21 02:26:12] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-21 02:26:12] [INFO ] Invariant cache hit.
[2024-05-21 02:26:13] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 02:26:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60571ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60593ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1587 places, 1931/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62362 ms. Remains : 1509/1587 places, 1931/2021 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-01 finished in 62582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1559 transition count 1993
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1559 transition count 1993
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 1559 transition count 1991
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 76 place count 1541 transition count 1973
Iterating global reduction 1 with 18 rules applied. Total rules applied 94 place count 1541 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 1541 transition count 1972
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 105 place count 1531 transition count 1961
Iterating global reduction 2 with 10 rules applied. Total rules applied 115 place count 1531 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 1531 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 1527 transition count 1955
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 1527 transition count 1955
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 130 place count 1522 transition count 1949
Iterating global reduction 3 with 5 rules applied. Total rules applied 135 place count 1522 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 138 place count 1519 transition count 1946
Iterating global reduction 3 with 3 rules applied. Total rules applied 141 place count 1519 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 1516 transition count 1942
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 1516 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 1513 transition count 1937
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 1511 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 1511 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 1510 transition count 1932
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 1510 transition count 1932
Applied a total of 160 rules in 568 ms. Remains 1510 /1587 variables (removed 77) and now considering 1932/2021 (removed 89) transitions.
// Phase 1: matrix 1932 rows 1510 cols
[2024-05-21 02:27:14] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 02:27:15] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 02:27:15] [INFO ] Invariant cache hit.
[2024-05-21 02:27:16] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-21 02:27:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60545ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1587 places, 1932/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62359 ms. Remains : 1510/1587 places, 1932/2021 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 526 ms.
Product exploration explored 100000 steps with 50000 reset in 459 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2109 edges and 1510 vertex of which 1501 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-302-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-03 finished in 63501 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 U p2)))))'
Support contains 6 out of 1587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Graph (trivial) has 1920 edges and 1587 vertex of which 692 / 1587 are part of one of the 62 SCC in 5 ms
Free SCC test removed 630 places
Ensure Unique test removed 730 transitions
Reduce isomorphic transitions removed 730 transitions.
Graph (complete) has 1464 edges and 957 vertex of which 948 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 527 transitions
Trivial Post-agglo rules discarded 527 transitions
Performed 527 trivial Post agglomeration. Transition count delta: 527
Iterating post reduction 0 with 527 rules applied. Total rules applied 529 place count 947 transition count 758
Reduce places removed 527 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 553 rules applied. Total rules applied 1082 place count 420 transition count 732
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 1095 place count 408 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1096 place count 407 transition count 731
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1096 place count 407 transition count 685
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1188 place count 361 transition count 685
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1204 place count 345 transition count 662
Iterating global reduction 4 with 16 rules applied. Total rules applied 1220 place count 345 transition count 662
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 1222 place count 345 transition count 660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1224 place count 343 transition count 660
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1224 place count 343 transition count 659
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1226 place count 342 transition count 659
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1236 place count 332 transition count 647
Iterating global reduction 6 with 10 rules applied. Total rules applied 1246 place count 332 transition count 647
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 1254 place count 332 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1255 place count 331 transition count 639
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1258 place count 328 transition count 634
Iterating global reduction 8 with 3 rules applied. Total rules applied 1261 place count 328 transition count 634
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1262 place count 327 transition count 633
Iterating global reduction 8 with 1 rules applied. Total rules applied 1263 place count 327 transition count 633
Performed 146 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 8 with 292 rules applied. Total rules applied 1555 place count 181 transition count 404
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1570 place count 181 transition count 389
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1577 place count 174 transition count 378
Iterating global reduction 9 with 7 rules applied. Total rules applied 1584 place count 174 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1585 place count 174 transition count 377
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1587 place count 172 transition count 373
Iterating global reduction 10 with 2 rules applied. Total rules applied 1589 place count 172 transition count 373
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1591 place count 170 transition count 369
Iterating global reduction 10 with 2 rules applied. Total rules applied 1593 place count 170 transition count 369
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1595 place count 168 transition count 365
Iterating global reduction 10 with 2 rules applied. Total rules applied 1597 place count 168 transition count 365
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1599 place count 166 transition count 361
Iterating global reduction 10 with 2 rules applied. Total rules applied 1601 place count 166 transition count 361
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1625 place count 154 transition count 347
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1639 place count 154 transition count 333
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1640 place count 153 transition count 331
Iterating global reduction 11 with 1 rules applied. Total rules applied 1641 place count 153 transition count 331
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1675 place count 136 transition count 371
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 11 with 23 rules applied. Total rules applied 1698 place count 136 transition count 348
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 1708 place count 126 transition count 325
Iterating global reduction 12 with 10 rules applied. Total rules applied 1718 place count 126 transition count 325
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1723 place count 126 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 13 with 38 rules applied. Total rules applied 1761 place count 126 transition count 282
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1762 place count 126 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1763 place count 125 transition count 281
Applied a total of 1763 rules in 99 ms. Remains 125 /1587 variables (removed 1462) and now considering 281/2021 (removed 1740) transitions.
[2024-05-21 02:28:17] [INFO ] Flow matrix only has 225 transitions (discarded 56 similar events)
// Phase 1: matrix 225 rows 125 cols
[2024-05-21 02:28:17] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 02:28:17] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 02:28:17] [INFO ] Flow matrix only has 225 transitions (discarded 56 similar events)
[2024-05-21 02:28:17] [INFO ] Invariant cache hit.
[2024-05-21 02:28:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 02:28:18] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [12, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 180 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/1587 places, 281/2021 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 121 transition count 279
Applied a total of 4 rules in 5 ms. Remains 121 /123 variables (removed 2) and now considering 279/281 (removed 2) transitions.
[2024-05-21 02:28:18] [INFO ] Flow matrix only has 223 transitions (discarded 56 similar events)
// Phase 1: matrix 223 rows 121 cols
[2024-05-21 02:28:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 02:28:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 02:28:18] [INFO ] Flow matrix only has 223 transitions (discarded 56 similar events)
[2024-05-21 02:28:18] [INFO ] Invariant cache hit.
[2024-05-21 02:28:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 02:28:18] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/1587 places, 279/2021 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 438 ms. Remains : 121/1587 places, 279/2021 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-05
Stuttering criterion allowed to conclude after 94319 steps with 7236 reset in 193 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-05 finished in 724 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 U p1))))'
Support contains 3 out of 1587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Graph (trivial) has 1927 edges and 1587 vertex of which 707 / 1587 are part of one of the 63 SCC in 3 ms
Free SCC test removed 644 places
Ensure Unique test removed 747 transitions
Reduce isomorphic transitions removed 747 transitions.
Graph (complete) has 1447 edges and 943 vertex of which 934 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 519 transitions
Trivial Post-agglo rules discarded 519 transitions
Performed 519 trivial Post agglomeration. Transition count delta: 519
Iterating post reduction 0 with 519 rules applied. Total rules applied 521 place count 933 transition count 749
Reduce places removed 519 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 545 rules applied. Total rules applied 1066 place count 414 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 1079 place count 402 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1080 place count 401 transition count 722
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1080 place count 401 transition count 677
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1170 place count 356 transition count 677
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1186 place count 340 transition count 654
Iterating global reduction 4 with 16 rules applied. Total rules applied 1202 place count 340 transition count 654
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 1204 place count 340 transition count 652
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1206 place count 338 transition count 652
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1206 place count 338 transition count 651
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1208 place count 337 transition count 651
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1217 place count 328 transition count 641
Iterating global reduction 6 with 9 rules applied. Total rules applied 1226 place count 328 transition count 641
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 1234 place count 328 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1235 place count 327 transition count 633
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1238 place count 324 transition count 628
Iterating global reduction 8 with 3 rules applied. Total rules applied 1241 place count 324 transition count 628
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1242 place count 323 transition count 627
Iterating global reduction 8 with 1 rules applied. Total rules applied 1243 place count 323 transition count 627
Performed 149 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 8 with 298 rules applied. Total rules applied 1541 place count 174 transition count 391
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1555 place count 174 transition count 377
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1562 place count 167 transition count 366
Iterating global reduction 9 with 7 rules applied. Total rules applied 1569 place count 167 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1570 place count 167 transition count 365
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1572 place count 165 transition count 361
Iterating global reduction 10 with 2 rules applied. Total rules applied 1574 place count 165 transition count 361
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1576 place count 163 transition count 357
Iterating global reduction 10 with 2 rules applied. Total rules applied 1578 place count 163 transition count 357
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1580 place count 161 transition count 353
Iterating global reduction 10 with 2 rules applied. Total rules applied 1582 place count 161 transition count 353
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1584 place count 159 transition count 349
Iterating global reduction 10 with 2 rules applied. Total rules applied 1586 place count 159 transition count 349
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1587 place count 158 transition count 342
Iterating global reduction 10 with 1 rules applied. Total rules applied 1588 place count 158 transition count 342
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1612 place count 146 transition count 328
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1625 place count 146 transition count 315
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1626 place count 145 transition count 310
Iterating global reduction 11 with 1 rules applied. Total rules applied 1627 place count 145 transition count 310
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1661 place count 128 transition count 344
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 1677 place count 128 transition count 328
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1686 place count 119 transition count 310
Iterating global reduction 12 with 9 rules applied. Total rules applied 1695 place count 119 transition count 310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1701 place count 119 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 13 with 36 rules applied. Total rules applied 1737 place count 119 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1738 place count 118 transition count 267
Applied a total of 1738 rules in 83 ms. Remains 118 /1587 variables (removed 1469) and now considering 267/2021 (removed 1754) transitions.
[2024-05-21 02:28:18] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 118 cols
[2024-05-21 02:28:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 02:28:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 02:28:18] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2024-05-21 02:28:18] [INFO ] Invariant cache hit.
[2024-05-21 02:28:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 02:28:18] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [8, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 149 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1587 places, 267/2021 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 114 transition count 265
Applied a total of 4 rules in 4 ms. Remains 114 /116 variables (removed 2) and now considering 265/267 (removed 2) transitions.
[2024-05-21 02:28:18] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 114 cols
[2024-05-21 02:28:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 02:28:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 02:28:18] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-21 02:28:18] [INFO ] Invariant cache hit.
[2024-05-21 02:28:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 02:28:18] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1587 places, 265/2021 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 377 ms. Remains : 114/1587 places, 265/2021 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-06 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U !p1) U (X(p2) U p2))||(p3 U p1))))'
Support contains 7 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1564 transition count 1998
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1564 transition count 1998
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 1564 transition count 1996
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 1549 transition count 1981
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 1549 transition count 1981
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 1549 transition count 1980
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 86 place count 1542 transition count 1972
Iterating global reduction 2 with 7 rules applied. Total rules applied 93 place count 1542 transition count 1972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 1542 transition count 1971
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 1538 transition count 1967
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 1538 transition count 1967
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 1534 transition count 1962
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 1534 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 1532 transition count 1960
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 1532 transition count 1960
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 1530 transition count 1957
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 1530 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 1528 transition count 1953
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 1528 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 1526 transition count 1950
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 1526 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 1526 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 1525 transition count 1948
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 1525 transition count 1948
Applied a total of 129 rules in 524 ms. Remains 1525 /1587 variables (removed 62) and now considering 1948/2021 (removed 73) transitions.
// Phase 1: matrix 1948 rows 1525 cols
[2024-05-21 02:28:19] [INFO ] Computed 4 invariants in 11 ms
[2024-05-21 02:28:19] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-21 02:28:19] [INFO ] Invariant cache hit.
[2024-05-21 02:28:20] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Running 1947 sub problems to find dead transitions.
[2024-05-21 02:28:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1524 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1524/3473 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1525 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/1524 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1524/3473 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/1525 constraints, PredecessorRefiner: 0/1947 constraints, Known Traps: 0/0 constraints]
After SMT, in 60520ms problems are : Problem set: 0 solved, 1947 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Starting structural reductions in LTL mode, iteration 1 : 1525/1587 places, 1948/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62196 ms. Remains : 1525/1587 places, 1948/2021 transitions.
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), true, p1]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 502 ms.
Product exploration explored 100000 steps with 50000 reset in 489 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2125 edges and 1525 vertex of which 1516 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p3 p2 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 110 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-302-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-08 finished in 63650 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 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1559 transition count 1993
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1559 transition count 1993
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 1559 transition count 1991
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 76 place count 1541 transition count 1973
Iterating global reduction 1 with 18 rules applied. Total rules applied 94 place count 1541 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 1541 transition count 1972
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 105 place count 1531 transition count 1961
Iterating global reduction 2 with 10 rules applied. Total rules applied 115 place count 1531 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 1531 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 1527 transition count 1955
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 1527 transition count 1955
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 1523 transition count 1950
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 1523 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 1521 transition count 1948
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 1521 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 1519 transition count 1946
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 1519 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 143 place count 1517 transition count 1943
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 1517 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 1516 transition count 1941
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 1515 transition count 1940
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 1515 transition count 1940
Applied a total of 149 rules in 523 ms. Remains 1515 /1587 variables (removed 72) and now considering 1940/2021 (removed 81) transitions.
// Phase 1: matrix 1940 rows 1515 cols
[2024-05-21 02:29:23] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 02:29:23] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-21 02:29:23] [INFO ] Invariant cache hit.
[2024-05-21 02:29:24] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 02:29:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60587ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60608ms
Starting structural reductions in LTL mode, iteration 1 : 1515/1587 places, 1940/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62348 ms. Remains : 1515/1587 places, 1940/2021 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-09
Product exploration explored 100000 steps with 702 reset in 252 ms.
Product exploration explored 100000 steps with 710 reset in 203 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2117 edges and 1515 vertex of which 1506 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 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 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (275 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (79 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 400941 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 400941 steps, saw 98255 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2024-05-21 02:30:28] [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) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3454 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3454 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3455 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3455/3455 variables, and 1519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1390 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 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) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3454 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3454 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3455 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3455 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3455 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3455/3455 variables, and 1520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1352 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2753ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 117 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=117 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 113 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 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1515/1515 places, 1940/1940 transitions.
Applied a total of 0 rules in 49 ms. Remains 1515 /1515 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2024-05-21 02:30:32] [INFO ] Invariant cache hit.
[2024-05-21 02:30:32] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 02:30:32] [INFO ] Invariant cache hit.
[2024-05-21 02:30:33] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 02:30:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60551ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60570ms
Finished structural reductions in LTL mode , in 1 iterations and 61832 ms. Remains : 1515/1515 places, 1940/1940 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2117 edges and 1515 vertex of which 1506 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0]
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 275 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (279 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (69 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 416172 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 416172 steps, saw 101880 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2024-05-21 02:31:37] [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) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3454 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3454 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3455 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3455/3455 variables, and 1519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1425 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 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) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3438 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3438 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3440 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3440 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3442 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3442 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3444 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3444 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3454 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3454 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3455 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3455 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3455 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3455/3455 variables, and 1520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1325 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2767ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 117 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=117 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 105 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 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 711 reset in 178 ms.
Product exploration explored 100000 steps with 703 reset in 164 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1515/1515 places, 1940/1940 transitions.
Graph (trivial) has 1849 edges and 1515 vertex of which 693 / 1515 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1379 edges and 885 vertex of which 876 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 479 place count 876 transition count 1203
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 490 place count 876 transition count 1192
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 490 place count 876 transition count 1205
Deduced a syphon composed of 498 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 511 place count 876 transition count 1205
Discarding 285 places :
Symmetric choice reduction at 2 with 285 rule applications. Total rules 796 place count 591 transition count 910
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 285 rules applied. Total rules applied 1081 place count 591 transition count 910
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1093 place count 579 transition count 894
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1105 place count 579 transition count 894
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1111 place count 579 transition count 888
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1123 place count 567 transition count 876
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1135 place count 567 transition count 876
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1137 place count 565 transition count 872
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1139 place count 565 transition count 872
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1141 place count 563 transition count 868
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1143 place count 563 transition count 868
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1147 place count 559 transition count 864
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1151 place count 559 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1153 place count 557 transition count 860
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1155 place count 557 transition count 860
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1157 place count 555 transition count 856
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1159 place count 555 transition count 856
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1163 place count 551 transition count 850
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1167 place count 551 transition count 850
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1171 place count 547 transition count 834
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1175 place count 547 transition count 834
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 547 transition count 834
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1180 place count 543 transition count 830
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1184 place count 543 transition count 830
Performed 106 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 316 places in 0 ms
Iterating global reduction 4 with 106 rules applied. Total rules applied 1290 place count 543 transition count 908
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1329 place count 543 transition count 869
Discarding 99 places :
Symmetric choice reduction at 5 with 99 rule applications. Total rules 1428 place count 444 transition count 760
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 99 rules applied. Total rules applied 1527 place count 444 transition count 760
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1533 place count 438 transition count 751
Deduced a syphon composed of 221 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1539 place count 438 transition count 751
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1546 place count 438 transition count 751
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1550 place count 438 transition count 747
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1565 place count 423 transition count 728
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1580 place count 423 transition count 728
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1586 place count 423 transition count 722
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1590 place count 419 transition count 718
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1594 place count 419 transition count 718
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1597 place count 419 transition count 718
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1603 place count 419 transition count 712
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1606 place count 416 transition count 709
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1609 place count 416 transition count 709
Performed 71 Post agglomeration using F-continuation condition with reduction of 111 identical transitions.
Deduced a syphon composed of 284 places in 1 ms
Iterating global reduction 8 with 71 rules applied. Total rules applied 1680 place count 416 transition count 1035
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 8 with 125 rules applied. Total rules applied 1805 place count 416 transition count 910
Discarding 125 places :
Symmetric choice reduction at 9 with 125 rule applications. Total rules 1930 place count 291 transition count 582
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 9 with 125 rules applied. Total rules applied 2055 place count 291 transition count 582
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2070 place count 291 transition count 567
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2097 place count 264 transition count 509
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2124 place count 264 transition count 509
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2127 place count 264 transition count 553
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2131 place count 264 transition count 549
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2135 place count 260 transition count 521
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2139 place count 260 transition count 521
Deduced a syphon composed of 140 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 11 with 45 rules applied. Total rules applied 2184 place count 260 transition count 476
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2188 place count 256 transition count 472
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2192 place count 256 transition count 472
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2195 place count 256 transition count 532
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2198 place count 253 transition count 517
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2201 place count 253 transition count 517
Deduced a syphon composed of 136 places in 0 ms
Applied a total of 2201 rules in 328 ms. Remains 253 /1515 variables (removed 1262) and now considering 517/1940 (removed 1423) transitions.
[2024-05-21 02:31:41] [INFO ] Redundant transitions in 28 ms returned []
Running 516 sub problems to find dead transitions.
[2024-05-21 02:31:41] [INFO ] Flow matrix only has 460 transitions (discarded 57 similar events)
// Phase 1: matrix 460 rows 253 cols
[2024-05-21 02:31:41] [INFO ] Computed 0 invariants in 5 ms
[2024-05-21 02:31:41] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 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 TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 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 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 TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 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 TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
At refinement iteration 1 (OVERLAPS) 459/711 variables, 252/252 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/711 variables, 2/254 constraints. Problems are: Problem set: 248 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/711 variables, 0/254 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 1/712 variables, 1/255 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/712 variables, 0/255 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 1/713 variables, 1/256 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/256 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/713 variables, 0/256 constraints. Problems are: Problem set: 248 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 713/713 variables, and 256 constraints, problems are : Problem set: 248 solved, 268 unsolved in 19204 ms.
Refiners :[State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 248 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 456/572 variables, 116/116 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 2/118 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 268/386 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 0/386 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 140/712 variables, 137/523 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 0/523 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/713 variables, 1/524 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 0/524 constraints. Problems are: Problem set: 248 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/713 variables, 0/524 constraints. Problems are: Problem set: 248 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 713/713 variables, and 524 constraints, problems are : Problem set: 248 solved, 268 unsolved in 25458 ms.
Refiners :[State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 268/516 constraints, Known Traps: 0/0 constraints]
After SMT, in 44903ms problems are : Problem set: 248 solved, 268 unsolved
Search for dead transitions found 248 dead transitions in 44911ms
Found 248 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 248 transitions
Dead transitions reduction (with SMT) removed 248 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 253/1515 places, 269/1940 transitions.
Graph (complete) has 418 edges and 253 vertex of which 117 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 117 /253 variables (removed 136) and now considering 269/269 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/1515 places, 269/1940 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45284 ms. Remains : 117/1515 places, 269/1940 transitions.
Support contains 2 out of 1515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1515/1515 places, 1940/1940 transitions.
Applied a total of 0 rules in 50 ms. Remains 1515 /1515 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
// Phase 1: matrix 1940 rows 1515 cols
[2024-05-21 02:32:26] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 02:32:27] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-21 02:32:27] [INFO ] Invariant cache hit.
[2024-05-21 02:32:28] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 02:32:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30056 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60582ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60600ms
Finished structural reductions in LTL mode , in 1 iterations and 61883 ms. Remains : 1515/1515 places, 1940/1940 transitions.
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-09 finished in 246290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(X(F(p1))))))'
Support contains 5 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1561 transition count 1995
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1561 transition count 1995
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 1561 transition count 1993
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 70 place count 1545 transition count 1977
Iterating global reduction 1 with 16 rules applied. Total rules applied 86 place count 1545 transition count 1977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 1545 transition count 1976
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 97 place count 1535 transition count 1965
Iterating global reduction 2 with 10 rules applied. Total rules applied 107 place count 1535 transition count 1965
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 1535 transition count 1964
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 113 place count 1530 transition count 1959
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 1530 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 122 place count 1526 transition count 1955
Iterating global reduction 3 with 4 rules applied. Total rules applied 126 place count 1526 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 1523 transition count 1952
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 1523 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 1520 transition count 1948
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 1520 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 1517 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 1517 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 1515 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 1515 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 150 place count 1514 transition count 1938
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 1514 transition count 1938
Applied a total of 151 rules in 552 ms. Remains 1514 /1587 variables (removed 73) and now considering 1938/2021 (removed 83) transitions.
// Phase 1: matrix 1938 rows 1514 cols
[2024-05-21 02:33:29] [INFO ] Computed 4 invariants in 18 ms
[2024-05-21 02:33:29] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-21 02:33:29] [INFO ] Invariant cache hit.
[2024-05-21 02:33:30] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 02:33:30] [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/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(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 1)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 1)
(s336 1)
(s337 0)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 1)
(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 1)
(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 0)
(s696 0)
(s697 0)
(s698 0)
(s699 1)
(s700 1)
(s701 1)
(s702 0)
(s703 0)
(s704 0)
(s705 1)
(s706 0)
(s707 1)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 1)
(s713 1)
(s714 1)
(s715 0)
(s716 0)
(s717 1)
(s718 1)
(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 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 1)
(s1107 0)
(s1108 0)
(s1109 1)
(s1110 1)
(s1111 0)
(s1112 0)
(s1113 1)
(s1114 1)
(s1115 0)
(s1116 0)
(s1117 1)
(s1118 0)
(s1119 0)
(s1120 1)
(s1121 0)
(s1122 0)
(s1123 1)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60554ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60573ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1587 places, 1938/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62411 ms. Remains : 1514/1587 places, 1938/2021 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-10
Product exploration explored 100000 steps with 696 reset in 157 ms.
Product exploration explored 100000 steps with 720 reset in 181 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2115 edges and 1514 vertex of which 1505 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (283 resets) in 192 ms. (207 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (77 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2024-05-21 02:34:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1503 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1928/3431 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3449 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3451 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3451 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3452/3452 variables, and 1518 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1645 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1503 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1928/3431 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3441 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3445 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3447 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3449 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3451 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3451 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/3452 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/3452 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3452/3452 variables, and 1519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1512 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3200ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 146 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=73 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 1514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1514/1514 places, 1938/1938 transitions.
Applied a total of 0 rules in 45 ms. Remains 1514 /1514 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
[2024-05-21 02:34:35] [INFO ] Invariant cache hit.
[2024-05-21 02:34:36] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-21 02:34:36] [INFO ] Invariant cache hit.
[2024-05-21 02:34:37] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 02:34:37] [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/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 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 1513/3452 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60555ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60573ms
Finished structural reductions in LTL mode , in 1 iterations and 61887 ms. Remains : 1514/1514 places, 1938/1938 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2115 edges and 1514 vertex of which 1505 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (282 resets) in 296 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 342 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (74 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (78 resets) in 176 ms. (225 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 211917 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 4
Probabilistic random walk after 211917 steps, saw 54134 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-21 02:35:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1498/1503 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1928/3431 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/3433 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3433 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3435 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3435 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3437 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3449 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3451 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3451 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3452/3452 variables, and 1518 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3452 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1498/1503 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1503 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1928/3431 variables, 1503/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3431 variables, 4/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3437 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3437 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3439 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3439 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3441 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3441 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3443 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3443 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3445 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3445 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3447 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3447 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3449 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3449 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3451 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3451 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 1/3452 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3452 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/3452 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3452/3452 variables, and 1522 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3461 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1514/1514 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 6938ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 153 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=25 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 6 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 695 reset in 139 ms.
Stack based approach found an accepted trace after 42623 steps with 301 reset with depth 185 and stack size 177 in 62 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-10 finished in 140152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1559 transition count 1993
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1559 transition count 1993
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 1559 transition count 1992
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 76 place count 1540 transition count 1973
Iterating global reduction 1 with 19 rules applied. Total rules applied 95 place count 1540 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 1540 transition count 1972
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 107 place count 1529 transition count 1960
Iterating global reduction 2 with 11 rules applied. Total rules applied 118 place count 1529 transition count 1960
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 1529 transition count 1958
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 125 place count 1524 transition count 1953
Iterating global reduction 3 with 5 rules applied. Total rules applied 130 place count 1524 transition count 1953
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 135 place count 1519 transition count 1947
Iterating global reduction 3 with 5 rules applied. Total rules applied 140 place count 1519 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 1516 transition count 1944
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 1516 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 1513 transition count 1940
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 1513 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 155 place count 1510 transition count 1935
Iterating global reduction 3 with 3 rules applied. Total rules applied 158 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 160 place count 1508 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 162 place count 1508 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 163 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 164 place count 1507 transition count 1930
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 1507 transition count 1930
Applied a total of 165 rules in 502 ms. Remains 1507 /1587 variables (removed 80) and now considering 1930/2021 (removed 91) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 02:35:49] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 02:35:49] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 02:35:49] [INFO ] Invariant cache hit.
[2024-05-21 02:35:50] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 02:35:50] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1587 places, 1930/2021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62215 ms. Remains : 1507/1587 places, 1930/2021 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-14
Product exploration explored 100000 steps with 692 reset in 126 ms.
Product exploration explored 100000 steps with 703 reset in 137 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (283 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (75 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 428620 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 428620 steps, saw 105752 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2024-05-21 02:36:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 416/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3418 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3420 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3420 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3422 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3422 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3424 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3426 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3426 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3428 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3428 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3430 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3430 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3432 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3432 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3434 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3434 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3436 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3436 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3437/3437 variables, and 1511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1558 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 416/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3416 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3418 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3418 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3420 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3422 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3432 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3432 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3437/3437 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1217 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2805ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 42 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2024-05-21 02:36:58] [INFO ] Invariant cache hit.
[2024-05-21 02:36:58] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-21 02:36:58] [INFO ] Invariant cache hit.
[2024-05-21 02:36:59] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 02:36:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
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 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60489ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60505ms
Finished structural reductions in LTL mode , in 1 iterations and 61836 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 33738 steps (241 resets) in 88 ms. (379 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 701 reset in 127 ms.
Product exploration explored 100000 steps with 710 reset in 137 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Graph (trivial) has 1841 edges and 1507 vertex of which 693 / 1507 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1369 edges and 877 vertex of which 868 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 474 rules applied. Total rules applied 476 place count 868 transition count 1193
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 488 place count 868 transition count 1181
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 488 place count 868 transition count 1194
Deduced a syphon composed of 495 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 509 place count 868 transition count 1194
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 792 place count 585 transition count 901
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1075 place count 585 transition count 901
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1087 place count 573 transition count 885
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1099 place count 573 transition count 885
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1105 place count 573 transition count 879
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1117 place count 561 transition count 867
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1129 place count 561 transition count 867
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1131 place count 559 transition count 863
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 559 transition count 863
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1135 place count 557 transition count 859
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 557 transition count 859
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1141 place count 553 transition count 855
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1145 place count 553 transition count 855
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1147 place count 551 transition count 851
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1149 place count 551 transition count 851
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 549 transition count 847
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 549 transition count 847
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1157 place count 545 transition count 841
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1161 place count 545 transition count 841
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 541 transition count 825
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 541 transition count 825
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1170 place count 541 transition count 825
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1174 place count 537 transition count 821
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1178 place count 537 transition count 821
Performed 104 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 313 places in 0 ms
Iterating global reduction 4 with 104 rules applied. Total rules applied 1282 place count 537 transition count 892
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 1319 place count 537 transition count 855
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 1419 place count 437 transition count 745
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 5 with 100 rules applied. Total rules applied 1519 place count 437 transition count 745
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1525 place count 431 transition count 736
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1531 place count 431 transition count 736
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1538 place count 431 transition count 736
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1542 place count 431 transition count 732
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1557 place count 416 transition count 713
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1572 place count 416 transition count 713
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1578 place count 416 transition count 707
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1582 place count 412 transition count 703
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1586 place count 412 transition count 703
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1589 place count 412 transition count 703
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1595 place count 412 transition count 697
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1598 place count 409 transition count 694
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1601 place count 409 transition count 694
Performed 71 Post agglomeration using F-continuation condition with reduction of 119 identical transitions.
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 8 with 71 rules applied. Total rules applied 1672 place count 409 transition count 1015
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 8 with 113 rules applied. Total rules applied 1785 place count 409 transition count 902
Discarding 126 places :
Symmetric choice reduction at 9 with 126 rule applications. Total rules 1911 place count 283 transition count 565
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 9 with 126 rules applied. Total rules applied 2037 place count 283 transition count 565
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 2048 place count 283 transition count 554
Discarding 25 places :
Symmetric choice reduction at 10 with 25 rule applications. Total rules 2073 place count 258 transition count 504
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 10 with 25 rules applied. Total rules applied 2098 place count 258 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2100 place count 258 transition count 536
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2102 place count 256 transition count 518
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2104 place count 256 transition count 518
Deduced a syphon composed of 138 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 10 with 52 rules applied. Total rules applied 2156 place count 256 transition count 466
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2160 place count 252 transition count 462
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2164 place count 252 transition count 462
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2167 place count 252 transition count 522
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2170 place count 249 transition count 507
Deduced a syphon composed of 134 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2173 place count 249 transition count 507
Deduced a syphon composed of 134 places in 0 ms
Applied a total of 2173 rules in 196 ms. Remains 249 /1507 variables (removed 1258) and now considering 507/1930 (removed 1423) transitions.
[2024-05-21 02:38:01] [INFO ] Redundant transitions in 8 ms returned []
Running 506 sub problems to find dead transitions.
[2024-05-21 02:38:01] [INFO ] Flow matrix only has 450 transitions (discarded 57 similar events)
// Phase 1: matrix 450 rows 249 cols
[2024-05-21 02:38:01] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 02:38:01] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 506 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 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 TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
At refinement iteration 1 (OVERLAPS) 449/697 variables, 248/248 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/697 variables, 2/250 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/697 variables, 0/250 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 1/698 variables, 1/251 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 0/251 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/699 variables, 1/252 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/699 variables, 0/252 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/699 variables, 0/252 constraints. Problems are: Problem set: 241 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 699/699 variables, and 252 constraints, problems are : Problem set: 241 solved, 265 unsolved in 18175 ms.
Refiners :[State Equation: 249/249 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 506/506 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 241 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 446/560 variables, 114/114 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/560 variables, 2/116 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/560 variables, 265/381 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 0/381 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 138/698 variables, 135/516 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/516 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/699 variables, 1/517 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/699 variables, 0/517 constraints. Problems are: Problem set: 241 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/699 variables, 0/517 constraints. Problems are: Problem set: 241 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 699/699 variables, and 517 constraints, problems are : Problem set: 241 solved, 265 unsolved in 25986 ms.
Refiners :[State Equation: 249/249 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 265/506 constraints, Known Traps: 0/0 constraints]
After SMT, in 44415ms problems are : Problem set: 241 solved, 265 unsolved
Search for dead transitions found 241 dead transitions in 44423ms
Found 241 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 241 transitions
Dead transitions reduction (with SMT) removed 241 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 249/1507 places, 266/1930 transitions.
Graph (complete) has 413 edges and 249 vertex of which 115 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.0 ms
Discarding 134 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 115 /249 variables (removed 134) and now considering 266/266 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1507 places, 266/1930 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44662 ms. Remains : 115/1507 places, 266/1930 transitions.
Support contains 1 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1930/1930 transitions.
Applied a total of 0 rules in 65 ms. Remains 1507 /1507 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 02:38:45] [INFO ] Computed 4 invariants in 11 ms
[2024-05-21 02:38:45] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-21 02:38:45] [INFO ] Invariant cache hit.
[2024-05-21 02:38:46] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 02:38:46] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(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 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 1)
(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 1)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 0)
(s335 1)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 1)
(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 1)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 1)
(s694 1)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 1)
(s700 1)
(s701 0)
(s702 0)
(s703 1)
(s704 0)
(s705 0)
(s706 1)
(s707 0)
(s708 0)
(s709 0)
(s710 1)
(s711 1)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(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 0)
(s1096 1)
(s1097 1)
(s1098 0)
(s1099 0)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 1)
(s1110 0)
(s1111 1)
(s1112 1)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 1)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 1)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 0)
(s1297 0)
(s1298 0)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 0)
(s1303 0)
(s1304 0)
(s1305 0)
(s1306 0)
(s1307 0)
(s1308 0)
(s1309 0)
(s1310 0)
(s1311 0)
(s1312 0)
(s1313 0)
(s1314 0)
(s1315 0)
(s1316 0)
(s1317 0)
(s1318 0)
(s1319 0)
(s1320 0)
(s1321 0)
(s1322 0)
(s1323 0)
(s1324 0)
(s1325 0)
(s1326 0)
(s1327 0)
(s1328 0)
(s1329 0)
(s1330 0)
(s1331 0)
(s1332 0)
(s1333 0)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 0)
(s1338 0)
(s1339 0)
(s1340 0)
(s1341 0)
(s1342 0)
(s1343 0)
(s1344 0)
(s1345 0)
(s1346 0)
(s1347 0)
(s1348 0)
(s1349 0)
(s1350 0)
(s1351 0)
(s1352 0)
(s1353 0)
(s1354 0)
(s1355 0)
(s1356 0)
(s1357 0)
(s1358 0)
(s1359 0)
(s1360 0)
(s1361 0)
(s1362 0)
(s1363 0)
(s1364 0)
(s1365 0)
(s1366 0)
(s1367 0)
(s1368 0)
(s1369 0)
(s1370 0)
(s1371 0)
(s1372 0)
(s1373 0)
(s1374 0)
(s1375 0)
(s1376 0)
(s1377 0)
(s1378 0)
(s1379 0)
(s1380 0)
(s1381 0)
(s1382 0)
(s1383 0)
(s1384 0)
(s1385 0)
(s1386 0)
(s1387 0)
(s1388 0)
(s1389 0)
(s1390 0)
(s1391 0)
(s1392 0)
(s1393 0)
(s1394 0)
(s1395 0)
(s1396 0)
(s1397 0)
(s1398 0)
(s1399 0)
(s1400 0)
(s1401 0)
(s1402 0)
(s1403 0)
(s1404 0)
(s1405 0)
(s1406 0)
(s1407 0)
(s1408 0)
(s1409 0)
(s1410 0)
(s1411 0)
(s1412 0)
(s1413 0)
(s1414 0)
(s1415 0)
(s1416 0)
(s1417 0)
(s1418 0)
(s1419 0)
(s1420 0)
(s1421 0)
(s1422 0)
(s1423 0)
(s1424 0)
(s1425 0)
(s1426 0)
(s1427 0)
(s1428 0)
(s1429 0)
(s1430 0)
(s1431 0)
(s1432 0)
(s1433 0)
(s1434 0)
(s1435 0)
(s1436 0)
(s1437 0)
(s1438 0)
(s1439 0)
(s1440 0)
(s1441 0)
(s1442 0)
(s1443 0)
(s1444 0)
(s1445 0)
(s1446 0)
(s1447 0)
(s1448 0)
(s1449 0)
(s1450 0)
(s1451 0)
(s1452 0)
(s1453 0)
(s1454 0)
(s1455 0)
(s1456 0)
(s1457 0)
(s1458 0)
(s1459 0)
(s1460 0)
(s1461 0)
(s1462 0)
(s1463 0)timeout

(s1464 0)
(s1465 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60531ms
Finished structural reductions in LTL mode , in 1 iterations and 61737 ms. Remains : 1507/1507 places, 1930/1930 transitions.
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-14 finished in 238406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-302-LTLCardinality-09
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Graph (trivial) has 1929 edges and 1587 vertex of which 707 / 1587 are part of one of the 63 SCC in 1 ms
Free SCC test removed 644 places
Ensure Unique test removed 747 transitions
Reduce isomorphic transitions removed 747 transitions.
Graph (complete) has 1447 edges and 943 vertex of which 934 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 522 transitions
Trivial Post-agglo rules discarded 522 transitions
Performed 522 trivial Post agglomeration. Transition count delta: 522
Iterating post reduction 0 with 522 rules applied. Total rules applied 524 place count 933 transition count 746
Reduce places removed 522 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 546 rules applied. Total rules applied 1070 place count 411 transition count 722
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1081 place count 400 transition count 722
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1081 place count 400 transition count 676
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1173 place count 354 transition count 676
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1190 place count 337 transition count 651
Iterating global reduction 3 with 17 rules applied. Total rules applied 1207 place count 337 transition count 651
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1209 place count 337 transition count 649
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1211 place count 335 transition count 649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1211 place count 335 transition count 648
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1213 place count 334 transition count 648
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1223 place count 324 transition count 636
Iterating global reduction 5 with 10 rules applied. Total rules applied 1233 place count 324 transition count 636
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1239 place count 324 transition count 630
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1241 place count 322 transition count 627
Iterating global reduction 6 with 2 rules applied. Total rules applied 1243 place count 322 transition count 627
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1244 place count 321 transition count 626
Iterating global reduction 6 with 1 rules applied. Total rules applied 1245 place count 321 transition count 626
Performed 148 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 6 with 296 rules applied. Total rules applied 1541 place count 173 transition count 392
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1556 place count 173 transition count 377
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1562 place count 167 transition count 368
Iterating global reduction 7 with 6 rules applied. Total rules applied 1568 place count 167 transition count 368
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1570 place count 165 transition count 364
Iterating global reduction 7 with 2 rules applied. Total rules applied 1572 place count 165 transition count 364
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1574 place count 163 transition count 360
Iterating global reduction 7 with 2 rules applied. Total rules applied 1576 place count 163 transition count 360
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1578 place count 161 transition count 356
Iterating global reduction 7 with 2 rules applied. Total rules applied 1580 place count 161 transition count 356
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1582 place count 159 transition count 352
Iterating global reduction 7 with 2 rules applied. Total rules applied 1584 place count 159 transition count 352
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1585 place count 158 transition count 345
Iterating global reduction 7 with 1 rules applied. Total rules applied 1586 place count 158 transition count 345
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 7 with 26 rules applied. Total rules applied 1612 place count 145 transition count 330
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1627 place count 145 transition count 315
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1628 place count 144 transition count 310
Iterating global reduction 8 with 1 rules applied. Total rules applied 1629 place count 144 transition count 310
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1665 place count 126 transition count 344
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 1682 place count 126 transition count 327
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1691 place count 117 transition count 309
Iterating global reduction 9 with 9 rules applied. Total rules applied 1700 place count 117 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1706 place count 117 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1707 place count 116 transition count 302
Applied a total of 1707 rules in 81 ms. Remains 116 /1587 variables (removed 1471) and now considering 302/2021 (removed 1719) transitions.
[2024-05-21 02:39:47] [INFO ] Flow matrix only has 245 transitions (discarded 57 similar events)
// Phase 1: matrix 245 rows 116 cols
[2024-05-21 02:39:47] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 02:39:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 02:39:47] [INFO ] Flow matrix only has 245 transitions (discarded 57 similar events)
[2024-05-21 02:39:47] [INFO ] Invariant cache hit.
[2024-05-21 02:39:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 02:39:48] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 166 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 114/1587 places, 302/2021 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 112 transition count 300
Applied a total of 4 rules in 4 ms. Remains 112 /114 variables (removed 2) and now considering 300/302 (removed 2) transitions.
[2024-05-21 02:39:48] [INFO ] Flow matrix only has 243 transitions (discarded 57 similar events)
// Phase 1: matrix 243 rows 112 cols
[2024-05-21 02:39:48] [INFO ] Computed 0 invariants in 12 ms
[2024-05-21 02:39:48] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 02:39:48] [INFO ] Flow matrix only has 243 transitions (discarded 57 similar events)
[2024-05-21 02:39:48] [INFO ] Invariant cache hit.
[2024-05-21 02:39:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 02:39:48] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 112/1587 places, 300/2021 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 425 ms. Remains : 112/1587 places, 300/2021 transitions.
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 56 steps with 4 reset in 1 ms.
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-09 finished in 727 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-302-LTLCardinality-14
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1587 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1587/1587 places, 2021/2021 transitions.
Graph (trivial) has 1931 edges and 1587 vertex of which 707 / 1587 are part of one of the 63 SCC in 2 ms
Free SCC test removed 644 places
Ensure Unique test removed 747 transitions
Reduce isomorphic transitions removed 747 transitions.
Graph (complete) has 1447 edges and 943 vertex of which 934 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 525 transitions
Trivial Post-agglo rules discarded 525 transitions
Performed 525 trivial Post agglomeration. Transition count delta: 525
Iterating post reduction 0 with 525 rules applied. Total rules applied 527 place count 933 transition count 743
Reduce places removed 525 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 551 rules applied. Total rules applied 1078 place count 408 transition count 717
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1090 place count 396 transition count 717
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1090 place count 396 transition count 672
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1180 place count 351 transition count 672
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1197 place count 334 transition count 647
Iterating global reduction 3 with 17 rules applied. Total rules applied 1214 place count 334 transition count 647
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1216 place count 334 transition count 645
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1218 place count 332 transition count 645
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1218 place count 332 transition count 644
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1220 place count 331 transition count 644
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1230 place count 321 transition count 632
Iterating global reduction 5 with 10 rules applied. Total rules applied 1240 place count 321 transition count 632
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 1248 place count 321 transition count 624
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1249 place count 320 transition count 624
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1252 place count 317 transition count 619
Iterating global reduction 7 with 3 rules applied. Total rules applied 1255 place count 317 transition count 619
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1256 place count 316 transition count 618
Iterating global reduction 7 with 1 rules applied. Total rules applied 1257 place count 316 transition count 618
Performed 145 Post agglomeration using F-continuation condition with reduction of 74 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 7 with 290 rules applied. Total rules applied 1547 place count 171 transition count 399
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1566 place count 171 transition count 380
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1573 place count 164 transition count 369
Iterating global reduction 8 with 7 rules applied. Total rules applied 1580 place count 164 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1581 place count 164 transition count 368
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1583 place count 162 transition count 364
Iterating global reduction 9 with 2 rules applied. Total rules applied 1585 place count 162 transition count 364
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1587 place count 160 transition count 360
Iterating global reduction 9 with 2 rules applied. Total rules applied 1589 place count 160 transition count 360
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1591 place count 158 transition count 356
Iterating global reduction 9 with 2 rules applied. Total rules applied 1593 place count 158 transition count 356
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1595 place count 156 transition count 352
Iterating global reduction 9 with 2 rules applied. Total rules applied 1597 place count 156 transition count 352
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1598 place count 155 transition count 345
Iterating global reduction 9 with 1 rules applied. Total rules applied 1599 place count 155 transition count 345
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1623 place count 143 transition count 331
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1637 place count 143 transition count 317
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1638 place count 142 transition count 312
Iterating global reduction 10 with 1 rules applied. Total rules applied 1639 place count 142 transition count 312
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -34
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 1675 place count 124 transition count 346
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 1696 place count 124 transition count 325
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1705 place count 115 transition count 307
Iterating global reduction 11 with 9 rules applied. Total rules applied 1714 place count 115 transition count 307
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1719 place count 115 transition count 302
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 1722 place count 115 transition count 302
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1725 place count 115 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1726 place count 114 transition count 298
Applied a total of 1726 rules in 83 ms. Remains 114 /1587 variables (removed 1473) and now considering 298/2021 (removed 1723) transitions.
[2024-05-21 02:39:48] [INFO ] Flow matrix only has 241 transitions (discarded 57 similar events)
// Phase 1: matrix 241 rows 114 cols
[2024-05-21 02:39:48] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 02:39:48] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 02:39:48] [INFO ] Flow matrix only has 241 transitions (discarded 57 similar events)
[2024-05-21 02:39:48] [INFO ] Invariant cache hit.
[2024-05-21 02:39:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 02:39:48] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 161 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 112/1587 places, 298/2021 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 110 transition count 296
Applied a total of 4 rules in 4 ms. Remains 110 /112 variables (removed 2) and now considering 296/298 (removed 2) transitions.
[2024-05-21 02:39:48] [INFO ] Flow matrix only has 239 transitions (discarded 57 similar events)
// Phase 1: matrix 239 rows 110 cols
[2024-05-21 02:39:48] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 02:39:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 02:39:48] [INFO ] Flow matrix only has 239 transitions (discarded 57 similar events)
[2024-05-21 02:39:48] [INFO ] Invariant cache hit.
[2024-05-21 02:39:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 02:39:48] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 110/1587 places, 296/2021 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 396 ms. Remains : 110/1587 places, 296/2021 transitions.
Running random walk in product with property : CloudReconfiguration-PT-302-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 609 steps with 52 reset in 1 ms.
Treatment of property CloudReconfiguration-PT-302-LTLCardinality-14 finished in 699 ms.
FORMULA CloudReconfiguration-PT-302-LTLCardinality-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-21 02:39:48] [INFO ] Flatten gal took : 54 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 968639 ms.
ITS solved all properties within timeout

BK_STOP 1716259189032

--------------------
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

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

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