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.r480-tall-171624188700139.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 ltsminxred
Input is CloudReconfiguration-PT-304, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188700139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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 27K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 19:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 11 19:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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-304-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-304-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717179136791

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-304
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:12:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:12:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:12:18] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2024-05-31 18:12:18] [INFO ] Transformed 2584 places.
[2024-05-31 18:12:18] [INFO ] Transformed 3094 transitions.
[2024-05-31 18:12:18] [INFO ] Found NUPN structural information;
[2024-05-31 18:12:18] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 437 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudReconfiguration-PT-304-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 515 places :
Symmetric choice reduction at 0 with 515 rule applications. Total rules 515 place count 2069 transition count 2579
Iterating global reduction 0 with 515 rules applied. Total rules applied 1030 place count 2069 transition count 2579
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1059 place count 2069 transition count 2550
Discarding 235 places :
Symmetric choice reduction at 1 with 235 rule applications. Total rules 1294 place count 1834 transition count 2315
Iterating global reduction 1 with 235 rules applied. Total rules applied 1529 place count 1834 transition count 2315
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 1618 place count 1745 transition count 2226
Iterating global reduction 1 with 89 rules applied. Total rules applied 1707 place count 1745 transition count 2226
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1724 place count 1745 transition count 2209
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1771 place count 1698 transition count 2162
Iterating global reduction 2 with 47 rules applied. Total rules applied 1818 place count 1698 transition count 2162
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1827 place count 1698 transition count 2153
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1863 place count 1662 transition count 2113
Iterating global reduction 3 with 36 rules applied. Total rules applied 1899 place count 1662 transition count 2113
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1926 place count 1635 transition count 2086
Iterating global reduction 3 with 27 rules applied. Total rules applied 1953 place count 1635 transition count 2086
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1978 place count 1610 transition count 2061
Iterating global reduction 3 with 25 rules applied. Total rules applied 2003 place count 1610 transition count 2061
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 2028 place count 1585 transition count 2036
Iterating global reduction 3 with 25 rules applied. Total rules applied 2053 place count 1585 transition count 2036
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2074 place count 1564 transition count 2002
Iterating global reduction 3 with 21 rules applied. Total rules applied 2095 place count 1564 transition count 2002
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2102 place count 1557 transition count 1990
Iterating global reduction 3 with 7 rules applied. Total rules applied 2109 place count 1557 transition count 1990
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2116 place count 1550 transition count 1980
Iterating global reduction 3 with 7 rules applied. Total rules applied 2123 place count 1550 transition count 1980
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2125 place count 1550 transition count 1978
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2128 place count 1547 transition count 1975
Iterating global reduction 4 with 3 rules applied. Total rules applied 2131 place count 1547 transition count 1975
Applied a total of 2131 rules in 2339 ms. Remains 1547 /2584 variables (removed 1037) and now considering 1975/3094 (removed 1119) transitions.
// Phase 1: matrix 1975 rows 1547 cols
[2024-05-31 18:12:21] [INFO ] Computed 4 invariants in 33 ms
[2024-05-31 18:12:21] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-31 18:12:21] [INFO ] Invariant cache hit.
[2024-05-31 18:12:23] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
Running 1974 sub problems to find dead transitions.
[2024-05-31 18:12:23] [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/1546 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1974 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1546/3522 variables, and 4 constraints, problems are : Problem set: 0 solved, 1974 unsolved in 30062 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1547 constraints, PredecessorRefiner: 1974/1974 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1974 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1546 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1974 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1546/3522 variables, and 4 constraints, problems are : Problem set: 0 solved, 1974 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1547 constraints, PredecessorRefiner: 0/1974 constraints, Known Traps: 0/0 constraints]
After SMT, in 60747ms problems are : Problem set: 0 solved, 1974 unsolved
Search for dead transitions found 0 dead transitions in 60791ms
Starting structural reductions in LTL mode, iteration 1 : 1547/2584 places, 1975/3094 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64805 ms. Remains : 1547/2584 places, 1975/3094 transitions.
Support contains 30 out of 1547 places after structural reductions.
[2024-05-31 18:13:24] [INFO ] Flatten gal took : 137 ms
[2024-05-31 18:13:24] [INFO ] Flatten gal took : 69 ms
[2024-05-31 18:13:24] [INFO ] Input system was already deterministic with 1975 transitions.
RANDOM walk for 40000 steps (310 resets) in 2093 ms. (19 steps per ms) remains 11/19 properties
BEST_FIRST walk for 40003 steps (89 resets) in 641 ms. (62 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (81 resets) in 397 ms. (100 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (82 resets) in 220 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (80 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (80 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (79 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (80 resets) in 256 ms. (155 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (80 resets) in 108 ms. (366 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (83 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (83 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (82 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
[2024-05-31 18:13:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1522/1536 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1536 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1965/3501 variables, 1536/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3501 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/3503 variables, 1/1541 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3503 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/3505 variables, 1/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3505 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 2/3507 variables, 1/1543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3507 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/3509 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3509 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/3511 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3511 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2/3513 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3513 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 2/3515 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3515 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 2/3517 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3517 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 2/3519 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3519 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 2/3521 variables, 1/1550 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3521/3522 variables, and 1550 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5008 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1546/1547 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1522/1536 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1536 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1965/3501 variables, 1536/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3501 variables, 9/1549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3501 variables, 0/1549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/3503 variables, 1/1550 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3503 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2/3505 variables, 1/1551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3505 variables, 0/1551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 2/3507 variables, 1/1552 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3507 variables, 0/1552 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 2/3509 variables, 1/1553 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3509 variables, 0/1553 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 2/3511 variables, 1/1554 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3511 variables, 0/1554 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 2/3513 variables, 1/1555 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3513 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 2/3515 variables, 1/1556 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3515 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 2/3517 variables, 1/1557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3517 variables, 0/1557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 2/3519 variables, 1/1558 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3519/3522 variables, and 1558 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1545/1547 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 10038ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 1547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1547/1547 places, 1975/1975 transitions.
Graph (trivial) has 1859 edges and 1547 vertex of which 674 / 1547 are part of one of the 62 SCC in 10 ms
Free SCC test removed 612 places
Drop transitions (Empty/Sink Transition effects.) removed 770 transitions
Reduce isomorphic transitions removed 770 transitions.
Graph (complete) has 1382 edges and 935 vertex of which 926 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 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 512 transitions
Trivial Post-agglo rules discarded 512 transitions
Performed 512 trivial Post agglomeration. Transition count delta: 512
Iterating post reduction 0 with 519 rules applied. Total rules applied 521 place count 926 transition count 682
Reduce places removed 512 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 567 rules applied. Total rules applied 1088 place count 414 transition count 627
Reduce places removed 35 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 37 rules applied. Total rules applied 1125 place count 379 transition count 625
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 1128 place count 378 transition count 623
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 4 with 3 rules applied. Total rules applied 1131 place count 377 transition count 621
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 5 rules applied. Total rules applied 1136 place count 376 transition count 617
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1140 place count 372 transition count 617
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 48 Pre rules applied. Total rules applied 1140 place count 372 transition count 569
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 1236 place count 324 transition count 569
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1246 place count 314 transition count 556
Iterating global reduction 7 with 10 rules applied. Total rules applied 1256 place count 314 transition count 556
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 1258 place count 314 transition count 554
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1260 place count 312 transition count 554
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1267 place count 305 transition count 547
Iterating global reduction 9 with 7 rules applied. Total rules applied 1274 place count 305 transition count 547
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1280 place count 305 transition count 541
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1281 place count 304 transition count 539
Iterating global reduction 10 with 1 rules applied. Total rules applied 1282 place count 304 transition count 539
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1283 place count 303 transition count 537
Iterating global reduction 10 with 1 rules applied. Total rules applied 1284 place count 303 transition count 537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1285 place count 303 transition count 536
Performed 149 Post agglomeration using F-continuation condition with reduction of 90 identical transitions.
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 11 with 298 rules applied. Total rules applied 1583 place count 154 transition count 297
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 11 with 22 rules applied. Total rules applied 1605 place count 154 transition count 275
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1608 place count 151 transition count 272
Iterating global reduction 12 with 3 rules applied. Total rules applied 1611 place count 151 transition count 272
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 12 with 24 rules applied. Total rules applied 1635 place count 139 transition count 258
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 12 with 15 rules applied. Total rules applied 1650 place count 139 transition count 243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1652 place count 138 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1654 place count 138 transition count 240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1656 place count 137 transition count 239
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1657 place count 137 transition count 238
Performed 35 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 15 with 70 rules applied. Total rules applied 1727 place count 102 transition count 270
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 15 with 35 rules applied. Total rules applied 1762 place count 102 transition count 235
Discarding 18 places :
Symmetric choice reduction at 16 with 18 rule applications. Total rules 1780 place count 84 transition count 205
Iterating global reduction 16 with 18 rules applied. Total rules applied 1798 place count 84 transition count 205
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 1806 place count 84 transition count 197
Discarding 5 places :
Symmetric choice reduction at 17 with 5 rule applications. Total rules 1811 place count 79 transition count 187
Iterating global reduction 17 with 5 rules applied. Total rules applied 1816 place count 79 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 1820 place count 79 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 1841 place count 79 transition count 162
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1842 place count 78 transition count 159
Iterating global reduction 18 with 1 rules applied. Total rules applied 1843 place count 78 transition count 159
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1844 place count 77 transition count 158
Iterating global reduction 18 with 1 rules applied. Total rules applied 1845 place count 77 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1846 place count 77 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1847 place count 77 transition count 156
Free-agglomeration rule applied 7 times.
Iterating global reduction 19 with 7 rules applied. Total rules applied 1854 place count 77 transition count 149
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 1861 place count 70 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 1863 place count 70 transition count 147
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 1864 place count 69 transition count 146
Iterating global reduction 20 with 1 rules applied. Total rules applied 1865 place count 69 transition count 146
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 20 with 7 rules applied. Total rules applied 1872 place count 69 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 1874 place count 69 transition count 144
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 1875 place count 68 transition count 143
Iterating global reduction 20 with 1 rules applied. Total rules applied 1876 place count 68 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 1877 place count 67 transition count 142
Applied a total of 1877 rules in 204 ms. Remains 67 /1547 variables (removed 1480) and now considering 142/1975 (removed 1833) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 67/1547 places, 142/1975 transitions.
RANDOM walk for 8010 steps (130 resets) in 252 ms. (31 steps per ms) remains 0/9 properties
FORMULA CloudReconfiguration-PT-304-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2157 edges and 1547 vertex of which 1538 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' '!(X((G(!p0) U (G(!p0)&&X(p1)))))'
Support contains 4 out of 1547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1547/1547 places, 1975/1975 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1536 transition count 1964
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1536 transition count 1964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1536 transition count 1963
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 1527 transition count 1953
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 1527 transition count 1953
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 1523 transition count 1948
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 1523 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 1520 transition count 1944
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 1520 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1517 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1517 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 1517 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 1515 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 1515 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 1513 transition count 1936
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 1513 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 1511 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1510 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1509 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1508 transition count 1930
Applied a total of 80 rules in 567 ms. Remains 1508 /1547 variables (removed 39) and now considering 1930/1975 (removed 45) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-31 18:13:37] [INFO ] Computed 4 invariants in 18 ms
[2024-05-31 18:13:37] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-31 18:13:37] [INFO ] Invariant cache hit.
[2024-05-31 18:13:38] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-31 18:13:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60666ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60684ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1547 places, 1930/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62580 ms. Remains : 1508/1547 places, 1930/1975 transitions.
Stuttering acceptance computed with spot in 405 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-304-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-00 finished in 63080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0) U (G(X(p0))||(X(p0)&&((!p1 U (p2||G(!p1))) U ((X(X(F(!p1)))&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))))))))'
Support contains 5 out of 1547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1547/1547 places, 1975/1975 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1536 transition count 1964
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1536 transition count 1964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1536 transition count 1963
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1529 transition count 1955
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1529 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 1526 transition count 1951
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 1526 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1524 transition count 1948
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1524 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1522 transition count 1946
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1522 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 1522 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1521 transition count 1944
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1521 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1520 transition count 1943
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1520 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1519 transition count 1941
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1519 transition count 1941
Applied a total of 58 rules in 450 ms. Remains 1519 /1547 variables (removed 28) and now considering 1941/1975 (removed 34) transitions.
// Phase 1: matrix 1941 rows 1519 cols
[2024-05-31 18:14:40] [INFO ] Computed 4 invariants in 9 ms
[2024-05-31 18:14:40] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-31 18:14:40] [INFO ] Invariant cache hit.
[2024-05-31 18:14:41] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
Running 1940 sub problems to find dead transitions.
[2024-05-31 18:14:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1518/3460 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 1940/1940 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(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 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 1)
(s701 0)
(s702 0)
(s703 0)
(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 0)
(s722 0)
(s723 0)
(s724 1)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 0)
(s1114 1)
(s1115 0)
(s1116 0)
(s1117 1)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 1)
(s1123 0)
(s1124 0)
(s1125 1)
(s1126 1)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 1)
(s1134 1)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 0)
(s1297 0)
(s1298 0)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 0)
(s1303 0)
(s1304 0)
(s1305 0)
(s1306 0)
(s1307 0)
(s1308 0)
(s1309 0)
(s1310 0)
(s1311 0)
(s1312 0)
(s1313 0)
(s1314 0)
(s1315 0)
(s1316 0)
(s1317 0)
(s1318 0)
(s1319 0)
(s1320 0)
(s1321 0)
(s1322 0)
(s1323 0)
(s1324 0)
(s1325 0)
(s1326 0)
(s1327 0)
(s1328 0)
(s1329 0)
(s1330 0)
(s1331 0)
(s1332 0)
(s1333 0)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 0)
(s1338 0)
(s1339 0)
(s1340 0)
(s1341 0)
(s1342 0)
(s1343 0)
(s1344 0)
(s1345 0)
(s1346 0)
(s1347 0)
(s1348 0)
(s1349 0)
(s1350 0)
(s1351 0)
(s1352 0)
(s1353 0)
(s1354 0)
(s1355 0)
(s1356 0)
(s1357 0)
(s1358 0)
(s1359 0)
(s1360 0)
(s1361 0)
(s1362 0)
(s1363 0)
(s1364 0)
(s1365 0)
(s1366 0)
(s1367 0)
(s1368 0)
(s1369 0)
(s1370 0)
(s1371 0)
(s1372 0)
(s1373 0)
(s1374 0)
(s1375 0)
(s1376 0)
(s1377 0)
(s1378 0)
(s1379 0)
(s1380 0)
(s1381 0)
(s1382 0)
(s1383 0)
(s1384 0)
(s1385 0)
(s1386 0)
(s1387 0)
(s1388 0)
(s1389 0)
(s1390 0)
(s1391 0)
(s1392 0)
(s1393 0)
(s1394 0)
(s1395 0)
(s1396 0)
(s1397 0)
(s1398 0)
(s1399 0)
(s1400 0)
(s1401 0)
(s1402 0)
(s1403 0)
(s1404 0)
(s1405 0)
(s1406 0)
(s1407 0)
(s1408 0)
(s1409 0)
(s1410 0)
(s1411 0)
(s1412 0)
(s1413 0)
(s1414 0)
(s1415 0)
(s1416 0)
(s1417 0)
(s1418 0)
(s1419 0)
(s1420 0)
(s1421 0)
(s1422 0)
(s1423 0)
(s1424 0)
(s1425 0)
(s1426 0)
(s1427 0)
(s1428 0)
(s1429 0)
(s1430 0)
(s1431 0)
(s1432 0)
(s1433 0)
(s1434 0)
(s1435 0)
(s1436 0)
(s1437 0)
(s1438 0)
(s1439 0)
(s1440 0)
(s1441 0)
(s1442 0)
(s1443 0)
(s1444 0)
(s1445 0)
(s1446 0)
(s1447 0)
(s1448 0)
(s1449 0)
(s1450 0)
(s1451 0)
(s1452 0)
(s1453 0)
(s1454 0)
(s1455 0)
(s1456 0)
(s1457 0)
(s1458 0)
(s1459 0)
(s1460 0)
(s1461 0)
(s1462 0)
(s1463 0)
(s1464 0)
(s1465 0)
(s1466 0)
(s1467 0)
(s1468 0)
(s1469 0)
(s1470 0)
(s1471 0)
(s1472 0)
(s1473 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1518/3460 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 0/1940 constraints, Known Traps: 0/0 constraints]
After SMT, in 60576ms problems are : Problem set: 0 solved, 1940 unsolved
Search for dead transitions found 0 dead transitions in 60592ms
Starting structural reductions in LTL mode, iteration 1 : 1519/1547 places, 1941/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62355 ms. Remains : 1519/1547 places, 1941/1975 transitions.
Stuttering acceptance computed with spot in 418 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-03
Product exploration explored 100000 steps with 787 reset in 495 ms.
Product exploration explored 100000 steps with 775 reset in 299 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2118 edges and 1519 vertex of which 1510 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.12 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (OR (AND (NOT p1) p0) (AND p0 p2)))), (X (NOT (OR (NOT p1) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p0 p2))))), (X (X (NOT (OR (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 322 ms. Reduced automaton from 8 states, 33 edges and 3 AP (stutter sensitive) to 8 states, 33 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (312 resets) in 664 ms. (60 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40003 steps (83 resets) in 223 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (84 resets) in 314 ms. (126 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (84 resets) in 306 ms. (130 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (83 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (86 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (80 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (78 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
[2024-05-31 18:15:45] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1102/1107 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1107 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 401/1508 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1931/3439 variables, 1508/1512 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/3441 variables, 1/1513 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/3443 variables, 1/1514 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/3445 variables, 1/1515 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/3447 variables, 1/1516 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/3449 variables, 1/1517 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/3451 variables, 1/1518 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3451 variables, 0/1518 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2/3453 variables, 1/1519 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3453 variables, 0/1519 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 2/3455 variables, 1/1520 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3455 variables, 0/1520 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 2/3457 variables, 1/1521 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3457 variables, 0/1521 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 2/3459 variables, 1/1522 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3459 variables, 0/1522 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 1/3460 variables, 1/1523 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3460 variables, 0/1523 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 0/3460 variables, 0/1523 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3460/3460 variables, and 1523 constraints, problems are : Problem set: 2 solved, 5 unsolved in 3568 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1102/1107 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1107 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 401/1508 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1931/3439 variables, 1508/1512 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3439 variables, 5/1517 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3439 variables, 0/1517 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/3441 variables, 1/1518 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3441 variables, 0/1518 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/3443 variables, 1/1519 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3443 variables, 0/1519 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/3445 variables, 1/1520 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3445 variables, 0/1520 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/3447 variables, 1/1521 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3447 variables, 0/1521 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/3449 variables, 1/1522 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3449 variables, 0/1522 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/3451 variables, 1/1523 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3451 variables, 0/1523 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 2/3453 variables, 1/1524 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3453 variables, 0/1524 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 2/3455 variables, 1/1525 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3455 variables, 0/1525 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 2/3457 variables, 1/1526 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3457 variables, 0/1526 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 2/3459 variables, 1/1527 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3459 variables, 0/1527 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 1/3460 variables, 1/1528 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3460 variables, 0/1528 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 0/3460 variables, 0/1528 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3460/3460 variables, and 1528 constraints, problems are : Problem set: 2 solved, 5 unsolved in 4559 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 8148ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 18418 steps, including 102 resets, run visited all 3 properties in 131 ms. (steps per millisecond=140 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 864 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (OR (AND (NOT p1) p0) (AND p0 p2)))), (X (NOT (OR (NOT p1) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p0 p2))))), (X (X (NOT (OR (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p0) p1)))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 24 factoid took 550 ms. Reduced automaton from 8 states, 33 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 5 out of 1519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1519/1519 places, 1941/1941 transitions.
Applied a total of 0 rules in 55 ms. Remains 1519 /1519 variables (removed 0) and now considering 1941/1941 (removed 0) transitions.
[2024-05-31 18:15:55] [INFO ] Invariant cache hit.
[2024-05-31 18:15:55] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-31 18:15:55] [INFO ] Invariant cache hit.
[2024-05-31 18:15:56] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
Running 1940 sub problems to find dead transitions.
[2024-05-31 18:15:56] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1518/3460 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 1940/1940 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 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 1518/3460 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 0/1940 constraints, Known Traps: 0/0 constraints]
After SMT, in 60649ms problems are : Problem set: 0 solved, 1940 unsolved
Search for dead transitions found 0 dead transitions in 60666ms
Finished structural reductions in LTL mode , in 1 iterations and 62110 ms. Remains : 1519/1519 places, 1941/1941 transitions.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2118 edges and 1519 vertex of which 1510 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.30 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 111 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0))]
RANDOM walk for 40000 steps (294 resets) in 385 ms. (103 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (79 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (83 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (80 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (79 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (83 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
[2024-05-31 18:16:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1102/1107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 401/1508 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1931/3439 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/3441 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3441 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/3443 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3443 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/3445 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3445 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/3447 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3447 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/3449 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3449 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/3451 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3451 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2/3453 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3453 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 2/3455 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3455 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 2/3457 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3457 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 2/3459 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3459 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 1/3460 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3460 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 0/3460 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3460/3460 variables, and 1523 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3696 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1102/1107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 401/1508 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1508 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1931/3439 variables, 1508/1512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3439 variables, 5/1517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3439 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/3441 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3441 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/3443 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3443 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/3445 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3445 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/3447 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3447 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/3449 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3449 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/3451 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3451 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 2/3453 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3453 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 2/3455 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3455 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 2/3457 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3457 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 2/3459 variables, 1/1527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3459 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 1/3460 variables, 1/1528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3460 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 0/3460 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3460/3460 variables, and 1528 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4429 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1519/1519 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 8136ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 565 ms.
Support contains 5 out of 1519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1519/1519 places, 1941/1941 transitions.
Graph (trivial) has 1844 edges and 1519 vertex of which 687 / 1519 are part of one of the 63 SCC in 5 ms
Free SCC test removed 624 places
Drop transitions (Empty/Sink Transition effects.) removed 786 transitions
Reduce isomorphic transitions removed 786 transitions.
Graph (complete) has 1327 edges and 895 vertex of which 886 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.13 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 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 506 rules applied. Total rules applied 508 place count 886 transition count 645
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 558 rules applied. Total rules applied 1066 place count 387 transition count 586
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1106 place count 349 transition count 584
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1108 place count 348 transition count 583
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1108 place count 348 transition count 535
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1204 place count 300 transition count 535
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1214 place count 290 transition count 521
Iterating global reduction 4 with 10 rules applied. Total rules applied 1224 place count 290 transition count 521
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 1226 place count 290 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1228 place count 288 transition count 519
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1235 place count 281 transition count 511
Iterating global reduction 6 with 7 rules applied. Total rules applied 1242 place count 281 transition count 511
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1248 place count 281 transition count 505
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1249 place count 280 transition count 499
Iterating global reduction 7 with 1 rules applied. Total rules applied 1250 place count 280 transition count 499
Performed 147 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 7 with 294 rules applied. Total rules applied 1544 place count 133 transition count 256
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1559 place count 133 transition count 241
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1562 place count 130 transition count 238
Iterating global reduction 8 with 3 rules applied. Total rules applied 1565 place count 130 transition count 238
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1589 place count 118 transition count 224
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1603 place count 118 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1605 place count 117 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1607 place count 117 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1609 place count 116 transition count 206
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1611 place count 116 transition count 204
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 11 with 68 rules applied. Total rules applied 1679 place count 82 transition count 234
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 11 with 48 rules applied. Total rules applied 1727 place count 82 transition count 186
Discarding 23 places :
Symmetric choice reduction at 12 with 23 rule applications. Total rules 1750 place count 59 transition count 156
Iterating global reduction 12 with 23 rules applied. Total rules applied 1773 place count 59 transition count 156
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1786 place count 59 transition count 143
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1791 place count 54 transition count 133
Iterating global reduction 13 with 5 rules applied. Total rules applied 1796 place count 54 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1800 place count 54 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1821 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1823 place count 52 transition count 102
Iterating global reduction 14 with 2 rules applied. Total rules applied 1825 place count 52 transition count 102
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1827 place count 50 transition count 100
Iterating global reduction 14 with 2 rules applied. Total rules applied 1829 place count 50 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1831 place count 50 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1833 place count 50 transition count 96
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1836 place count 50 transition count 93
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 1840 place count 47 transition count 92
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 16 with 7 rules applied. Total rules applied 1847 place count 47 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1850 place count 47 transition count 89
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1851 place count 46 transition count 88
Iterating global reduction 16 with 1 rules applied. Total rules applied 1852 place count 46 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1853 place count 45 transition count 87
Applied a total of 1853 rules in 123 ms. Remains 45 /1519 variables (removed 1474) and now considering 87/1941 (removed 1854) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 45/1519 places, 87/1941 transitions.
RANDOM walk for 31069 steps (619 resets) in 93 ms. (330 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p2), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 436 ms. Reduced automaton from 6 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 777 reset in 216 ms.
Product exploration explored 100000 steps with 768 reset in 265 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0))]
Support contains 5 out of 1519 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1519/1519 places, 1941/1941 transitions.
Graph (trivial) has 1844 edges and 1519 vertex of which 687 / 1519 are part of one of the 63 SCC in 3 ms
Free SCC test removed 624 places
Ensure Unique test removed 722 transitions
Reduce isomorphic transitions removed 722 transitions.
Graph (complete) has 1390 edges and 895 vertex of which 886 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
Performed 485 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 485 rules applied. Total rules applied 487 place count 886 transition count 1214
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 14 rules applied. Total rules applied 501 place count 886 transition count 1201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 2 with 2 rules applied. Total rules applied 503 place count 886 transition count 1200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 504 place count 886 transition count 1199
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 504 place count 886 transition count 1211
Deduced a syphon composed of 509 places in 1 ms
Iterating global reduction 4 with 22 rules applied. Total rules applied 526 place count 886 transition count 1211
Discarding 295 places :
Symmetric choice reduction at 4 with 295 rule applications. Total rules 821 place count 591 transition count 907
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 295 rules applied. Total rules applied 1116 place count 591 transition count 907
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1128 place count 579 transition count 891
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 1140 place count 579 transition count 891
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1146 place count 579 transition count 885
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1158 place count 567 transition count 873
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 5 with 12 rules applied. Total rules applied 1170 place count 567 transition count 873
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1171 place count 566 transition count 871
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1172 place count 566 transition count 871
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1173 place count 565 transition count 869
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1174 place count 565 transition count 869
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1176 place count 563 transition count 867
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1178 place count 563 transition count 867
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1179 place count 562 transition count 865
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1180 place count 562 transition count 865
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1181 place count 561 transition count 863
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1182 place count 561 transition count 863
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1184 place count 559 transition count 860
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1186 place count 559 transition count 860
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1188 place count 557 transition count 852
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1190 place count 557 transition count 852
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1192 place count 555 transition count 850
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1194 place count 555 transition count 850
Performed 108 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 321 places in 0 ms
Iterating global reduction 5 with 108 rules applied. Total rules applied 1302 place count 555 transition count 927
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 1344 place count 555 transition count 885
Discarding 99 places :
Symmetric choice reduction at 6 with 99 rule applications. Total rules 1443 place count 456 transition count 776
Deduced a syphon composed of 232 places in 0 ms
Iterating global reduction 6 with 99 rules applied. Total rules applied 1542 place count 456 transition count 776
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1548 place count 450 transition count 767
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 1554 place count 450 transition count 767
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 233 places in 0 ms
Iterating global reduction 6 with 7 rules applied. Total rules applied 1561 place count 450 transition count 767
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1567 place count 450 transition count 761
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1583 place count 434 transition count 741
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 1599 place count 434 transition count 741
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1605 place count 434 transition count 735
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1609 place count 430 transition count 731
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1613 place count 430 transition count 731
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1615 place count 430 transition count 731
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1619 place count 430 transition count 727
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1621 place count 428 transition count 725
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1623 place count 428 transition count 725
Performed 73 Post agglomeration using F-continuation condition with reduction of 133 identical transitions.
Deduced a syphon composed of 290 places in 0 ms
Iterating global reduction 9 with 73 rules applied. Total rules applied 1696 place count 428 transition count 1081
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 9 with 124 rules applied. Total rules applied 1820 place count 428 transition count 957
Discarding 127 places :
Symmetric choice reduction at 10 with 127 rule applications. Total rules 1947 place count 301 transition count 607
Deduced a syphon composed of 172 places in 1 ms
Iterating global reduction 10 with 127 rules applied. Total rules applied 2074 place count 301 transition count 607
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 2091 place count 301 transition count 590
Discarding 26 places :
Symmetric choice reduction at 11 with 26 rule applications. Total rules 2117 place count 275 transition count 536
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 11 with 26 rules applied. Total rules applied 2143 place count 275 transition count 536
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 2145 place count 275 transition count 570
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 2147 place count 273 transition count 551
Deduced a syphon composed of 146 places in 1 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 2149 place count 273 transition count 551
Deduced a syphon composed of 146 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 11 with 54 rules applied. Total rules applied 2203 place count 273 transition count 497
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2207 place count 269 transition count 493
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2211 place count 269 transition count 493
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2214 place count 269 transition count 553
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2217 place count 266 transition count 538
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2220 place count 266 transition count 538
Deduced a syphon composed of 142 places in 0 ms
Applied a total of 2220 rules in 380 ms. Remains 266 /1519 variables (removed 1253) and now considering 538/1941 (removed 1403) transitions.
[2024-05-31 18:17:09] [INFO ] Redundant transitions in 26 ms returned []
Running 537 sub problems to find dead transitions.
[2024-05-31 18:17:09] [INFO ] Flow matrix only has 480 transitions (discarded 58 similar events)
// Phase 1: matrix 480 rows 266 cols
[2024-05-31 18:17:09] [INFO ] Computed 0 invariants in 6 ms
[2024-05-31 18:17:09] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 537 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 TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem 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 TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
At refinement iteration 1 (OVERLAPS) 479/744 variables, 265/265 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 3/268 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 0/268 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 1/745 variables, 1/269 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/745 variables, 0/269 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 1/746 variables, 1/270 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 0/270 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 0/746 variables, 0/270 constraints. Problems are: Problem set: 257 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 270 constraints, problems are : Problem set: 257 solved, 280 unsolved in 21187 ms.
Refiners :[State Equation: 266/266 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 257 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 476/599 variables, 123/123 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 3/126 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/599 variables, 280/406 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/406 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 146/745 variables, 143/549 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 0/549 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 1/746 variables, 1/550 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/746 variables, 0/550 constraints. Problems are: Problem set: 257 solved, 280 unsolved
At refinement iteration 9 (OVERLAPS) 0/746 variables, 0/550 constraints. Problems are: Problem set: 257 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 746/746 variables, and 550 constraints, problems are : Problem set: 257 solved, 280 unsolved in 27031 ms.
Refiners :[State Equation: 266/266 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 280/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 48459ms problems are : Problem set: 257 solved, 280 unsolved
Search for dead transitions found 257 dead transitions in 48464ms
Found 257 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 257 transitions
Dead transitions reduction (with SMT) removed 257 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 266/1519 places, 281/1941 transitions.
Graph (complete) has 427 edges and 266 vertex of which 124 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.1 ms
Discarding 142 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 124 /266 variables (removed 142) and now considering 281/281 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 124/1519 places, 281/1941 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48885 ms. Remains : 124/1519 places, 281/1941 transitions.
Support contains 5 out of 1519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1519/1519 places, 1941/1941 transitions.
Applied a total of 0 rules in 49 ms. Remains 1519 /1519 variables (removed 0) and now considering 1941/1941 (removed 0) transitions.
// Phase 1: matrix 1941 rows 1519 cols
[2024-05-31 18:17:58] [INFO ] Computed 4 invariants in 16 ms
[2024-05-31 18:17:58] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-31 18:17:58] [INFO ] Invariant cache hit.
[2024-05-31 18:17:59] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
Running 1940 sub problems to find dead transitions.
[2024-05-31 18:17:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1518/3460 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 1940/1940 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1518/3460 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 0/1940 constraints, Known Traps: 0/0 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 1940 unsolved
Search for dead transitions found 0 dead transitions in 60579ms
Finished structural reductions in LTL mode , in 1 iterations and 61942 ms. Remains : 1519/1519 places, 1941/1941 transitions.
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-03 finished in 260344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1547/1547 places, 1975/1975 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1534 transition count 1962
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1534 transition count 1962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1534 transition count 1961
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 1526 transition count 1952
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 1526 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 1523 transition count 1948
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 1523 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 1520 transition count 1944
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 1520 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1517 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1517 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 1517 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 1515 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 1515 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 1513 transition count 1936
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 1513 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 1511 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1510 transition count 1932
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1509 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1508 transition count 1930
Applied a total of 80 rules in 503 ms. Remains 1508 /1547 variables (removed 39) and now considering 1930/1975 (removed 45) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2024-05-31 18:19:00] [INFO ] Computed 4 invariants in 15 ms
[2024-05-31 18:19:01] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-31 18:19:01] [INFO ] Invariant cache hit.
[2024-05-31 18:19:02] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-31 18:19:02] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 0.0)
(s698 1.0)
(s699 1.0)
(s700 0.0)
(s701 0.0)
(s702 1.0)
(s703 1.0)
(s704 0.0)
(s705 1.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 timeout
0.0)
(s974 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60498ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60514ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1547 places, 1930/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62269 ms. Remains : 1508/1547 places, 1930/1975 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 291 ms.
Product exploration explored 100000 steps with 33333 reset in 296 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2105 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-304-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-05 finished in 63058 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 G((p1&&(p2 U p3))))))'
Support contains 7 out of 1547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1547/1547 places, 1975/1975 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1536 transition count 1964
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1536 transition count 1964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1536 transition count 1963
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1529 transition count 1955
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1529 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1527 transition count 1952
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1527 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1526 transition count 1950
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1526 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1525 transition count 1949
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1525 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 1525 transition count 1948
Applied a total of 46 rules in 264 ms. Remains 1525 /1547 variables (removed 22) and now considering 1948/1975 (removed 27) transitions.
// Phase 1: matrix 1948 rows 1525 cols
[2024-05-31 18:20:03] [INFO ] Computed 4 invariants in 16 ms
[2024-05-31 18:20:03] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-31 18:20:03] [INFO ] Invariant cache hit.
[2024-05-31 18:20:05] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
Running 1947 sub problems to find dead transitions.
[2024-05-31 18:20:05] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/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 30029 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
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 1524/3473 variables, and 4 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30034 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 60505ms problems are : Problem set: 0 solved, 1947 unsolved
Search for dead transitions found 0 dead transitions in 60520ms
Starting structural reductions in LTL mode, iteration 1 : 1525/1547 places, 1948/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62191 ms. Remains : 1525/1547 places, 1948/1975 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), true, (NOT p3), (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-09
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-304-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-09 finished in 62447 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(p1))||p0)))'
Support contains 2 out of 1547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1547/1547 places, 1975/1975 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1535 transition count 1963
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1535 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1535 transition count 1962
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 1528 transition count 1954
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 1528 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 1525 transition count 1951
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 1525 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1523 transition count 1949
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1523 transition count 1949
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1521 transition count 1947
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1521 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1519 transition count 1945
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1519 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1517 transition count 1943
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1517 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1515 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1514 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1514 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1513 transition count 1938
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1512 transition count 1937
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1512 transition count 1937
Applied a total of 71 rules in 573 ms. Remains 1512 /1547 variables (removed 35) and now considering 1937/1975 (removed 38) transitions.
// Phase 1: matrix 1937 rows 1512 cols
[2024-05-31 18:21:06] [INFO ] Computed 4 invariants in 11 ms
[2024-05-31 18:21:06] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-31 18:21:06] [INFO ] Invariant cache hit.
[2024-05-31 18:21:07] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2024-05-31 18:21:07] [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/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1936/1936 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints]
After SMT, in 60554ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60572ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1547 places, 1937/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62416 ms. Remains : 1512/1547 places, 1937/1975 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 394 ms.
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2114 edges and 1512 vertex of which 1503 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-304-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-12 finished in 63415 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 1547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1547/1547 places, 1975/1975 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1534 transition count 1962
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1534 transition count 1962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1534 transition count 1961
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 1526 transition count 1952
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 1526 transition count 1952
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 1522 transition count 1947
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 1522 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 1519 transition count 1943
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 1519 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 1516 transition count 1940
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 1516 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 1516 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1514 transition count 1937
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1514 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1512 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1512 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 1510 transition count 1932
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1509 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1507 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1507 transition count 1929
Applied a total of 82 rules in 563 ms. Remains 1507 /1547 variables (removed 40) and now considering 1929/1975 (removed 46) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-31 18:22:09] [INFO ] Computed 4 invariants in 15 ms
[2024-05-31 18:22:10] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-31 18:22:10] [INFO ] Invariant cache hit.
[2024-05-31 18:22:11] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:22:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60507ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60520ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1547 places, 1929/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62443 ms. Remains : 1507/1547 places, 1929/1975 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-13
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-304-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-13 finished in 62541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1547/1547 places, 1975/1975 transitions.
Graph (trivial) has 1881 edges and 1547 vertex of which 697 / 1547 are part of one of the 63 SCC in 2 ms
Free SCC test removed 634 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1415 edges and 913 vertex of which 904 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 498 transitions
Trivial Post-agglo rules discarded 498 transitions
Performed 498 trivial Post agglomeration. Transition count delta: 498
Iterating post reduction 0 with 498 rules applied. Total rules applied 500 place count 903 transition count 735
Reduce places removed 498 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 522 rules applied. Total rules applied 1022 place count 405 transition count 711
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1034 place count 393 transition count 711
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1034 place count 393 transition count 665
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1126 place count 347 transition count 665
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1145 place count 328 transition count 637
Iterating global reduction 3 with 19 rules applied. Total rules applied 1164 place count 328 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 1168 place count 328 transition count 633
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1171 place count 325 transition count 633
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1183 place count 313 transition count 618
Iterating global reduction 5 with 12 rules applied. Total rules applied 1195 place count 313 transition count 618
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 1203 place count 313 transition count 610
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1204 place count 312 transition count 610
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1207 place count 309 transition count 604
Iterating global reduction 7 with 3 rules applied. Total rules applied 1210 place count 309 transition count 604
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1213 place count 306 transition count 598
Iterating global reduction 7 with 3 rules applied. Total rules applied 1216 place count 306 transition count 598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1217 place count 306 transition count 597
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1219 place count 304 transition count 593
Iterating global reduction 8 with 2 rules applied. Total rules applied 1221 place count 304 transition count 593
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1223 place count 302 transition count 589
Iterating global reduction 8 with 2 rules applied. Total rules applied 1225 place count 302 transition count 589
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1226 place count 301 transition count 587
Iterating global reduction 8 with 1 rules applied. Total rules applied 1227 place count 301 transition count 587
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1228 place count 300 transition count 580
Iterating global reduction 8 with 1 rules applied. Total rules applied 1229 place count 300 transition count 580
Performed 140 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 8 with 280 rules applied. Total rules applied 1509 place count 160 transition count 360
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1524 place count 160 transition count 345
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1528 place count 156 transition count 340
Iterating global reduction 9 with 4 rules applied. Total rules applied 1532 place count 156 transition count 340
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 1556 place count 144 transition count 326
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1569 place count 144 transition count 313
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -36
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 1605 place count 126 transition count 349
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 1623 place count 126 transition count 331
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1632 place count 117 transition count 313
Iterating global reduction 11 with 9 rules applied. Total rules applied 1641 place count 117 transition count 313
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1646 place count 117 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 12 with 37 rules applied. Total rules applied 1683 place count 117 transition count 271
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1684 place count 117 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1685 place count 117 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1686 place count 116 transition count 269
Applied a total of 1686 rules in 201 ms. Remains 116 /1547 variables (removed 1431) and now considering 269/1975 (removed 1706) transitions.
[2024-05-31 18:23:11] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
// Phase 1: matrix 213 rows 116 cols
[2024-05-31 18:23:11] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 18:23:12] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-31 18:23:12] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
[2024-05-31 18:23:12] [INFO ] Invariant cache hit.
[2024-05-31 18:23:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:23:12] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [11, 46, 79]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 237 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/1547 places, 269/1975 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 110 transition count 266
Applied a total of 3 rules in 9 ms. Remains 110 /113 variables (removed 3) and now considering 266/269 (removed 3) transitions.
[2024-05-31 18:23:12] [INFO ] Flow matrix only has 210 transitions (discarded 56 similar events)
// Phase 1: matrix 210 rows 110 cols
[2024-05-31 18:23:12] [INFO ] Computed 0 invariants in 7 ms
[2024-05-31 18:23:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 18:23:12] [INFO ] Flow matrix only has 210 transitions (discarded 56 similar events)
[2024-05-31 18:23:12] [INFO ] Invariant cache hit.
[2024-05-31 18:23:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:23:12] [INFO ] Implicit Places using invariants and state equation in 95 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 : 110/1547 places, 266/1975 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 603 ms. Remains : 110/1547 places, 266/1975 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-14
Stuttering criterion allowed to conclude after 458 steps with 50 reset in 4 ms.
FORMULA CloudReconfiguration-PT-304-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-14 finished in 681 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(X(p0)))&&F(p1)) U p1)&&G(F(p2)))))'
Support contains 5 out of 1547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1547/1547 places, 1975/1975 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1534 transition count 1962
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1534 transition count 1962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1534 transition count 1961
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 1526 transition count 1952
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 1526 transition count 1952
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 1522 transition count 1947
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 1522 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 1519 transition count 1943
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 1519 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 1516 transition count 1940
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 1516 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 1516 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 1514 transition count 1937
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 1514 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 1512 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 1512 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 1510 transition count 1932
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1509 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1508 transition count 1930
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1507 transition count 1929
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1507 transition count 1929
Applied a total of 82 rules in 639 ms. Remains 1507 /1547 variables (removed 40) and now considering 1929/1975 (removed 46) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-31 18:23:13] [INFO ] Computed 4 invariants in 13 ms
[2024-05-31 18:23:13] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-31 18:23:13] [INFO ] Invariant cache hit.
[2024-05-31 18:23:14] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:23:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60490ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60504ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1547 places, 1929/1975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62373 ms. Remains : 1507/1547 places, 1929/1975 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-15
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-304-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-15 finished in 62729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0) U (G(X(p0))||(X(p0)&&((!p1 U (p2||G(!p1))) U ((X(X(F(!p1)))&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))))))))'
Found a Shortening insensitive property : CloudReconfiguration-PT-304-LTLCardinality-03
Stuttering acceptance computed with spot in 382 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 5 out of 1547 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1547/1547 places, 1975/1975 transitions.
Graph (trivial) has 1875 edges and 1547 vertex of which 691 / 1547 are part of one of the 63 SCC in 1 ms
Free SCC test removed 628 places
Ensure Unique test removed 726 transitions
Reduce isomorphic transitions removed 726 transitions.
Graph (complete) has 1425 edges and 919 vertex of which 910 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 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 909 transition count 744
Reduce places removed 499 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 525 rules applied. Total rules applied 1026 place count 410 transition count 718
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 1041 place count 397 transition count 716
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1043 place count 396 transition count 715
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1043 place count 396 transition count 668
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1137 place count 349 transition count 668
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1155 place count 331 transition count 641
Iterating global reduction 4 with 18 rules applied. Total rules applied 1173 place count 331 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 1177 place count 331 transition count 637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1180 place count 328 transition count 637
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1191 place count 317 transition count 623
Iterating global reduction 6 with 11 rules applied. Total rules applied 1202 place count 317 transition count 623
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1208 place count 317 transition count 617
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1210 place count 315 transition count 613
Iterating global reduction 7 with 2 rules applied. Total rules applied 1212 place count 315 transition count 613
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1214 place count 313 transition count 609
Iterating global reduction 7 with 2 rules applied. Total rules applied 1216 place count 313 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1217 place count 313 transition count 608
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1218 place count 312 transition count 606
Iterating global reduction 8 with 1 rules applied. Total rules applied 1219 place count 312 transition count 606
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1220 place count 311 transition count 604
Iterating global reduction 8 with 1 rules applied. Total rules applied 1221 place count 311 transition count 604
Performed 141 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 8 with 282 rules applied. Total rules applied 1503 place count 170 transition count 383
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1518 place count 170 transition count 368
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1522 place count 166 transition count 363
Iterating global reduction 9 with 4 rules applied. Total rules applied 1526 place count 166 transition count 363
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 1550 place count 154 transition count 349
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1564 place count 154 transition count 335
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1565 place count 153 transition count 333
Iterating global reduction 10 with 1 rules applied. Total rules applied 1566 place count 153 transition count 333
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 38 rules applied. Total rules applied 1604 place count 134 transition count 374
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 10 with 25 rules applied. Total rules applied 1629 place count 134 transition count 349
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 1639 place count 124 transition count 326
Iterating global reduction 11 with 10 rules applied. Total rules applied 1649 place count 124 transition count 326
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1655 place count 124 transition count 320
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1656 place count 123 transition count 319
Applied a total of 1656 rules in 80 ms. Remains 123 /1547 variables (removed 1424) and now considering 319/1975 (removed 1656) transitions.
[2024-05-31 18:24:15] [INFO ] Flow matrix only has 261 transitions (discarded 58 similar events)
// Phase 1: matrix 261 rows 123 cols
[2024-05-31 18:24:15] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:24:15] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-31 18:24:15] [INFO ] Flow matrix only has 261 transitions (discarded 58 similar events)
[2024-05-31 18:24:15] [INFO ] Invariant cache hit.
[2024-05-31 18:24:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 18:24:15] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [13, 46, 83]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 174 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 120/1547 places, 319/1975 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 118 transition count 317
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 117 transition count 316
Applied a total of 3 rules in 7 ms. Remains 117 /120 variables (removed 3) and now considering 316/319 (removed 3) transitions.
[2024-05-31 18:24:15] [INFO ] Flow matrix only has 258 transitions (discarded 58 similar events)
// Phase 1: matrix 258 rows 117 cols
[2024-05-31 18:24:15] [INFO ] Computed 0 invariants in 3 ms
[2024-05-31 18:24:16] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 18:24:16] [INFO ] Flow matrix only has 258 transitions (discarded 58 similar events)
[2024-05-31 18:24:16] [INFO ] Invariant cache hit.
[2024-05-31 18:24:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 18:24:16] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 117/1547 places, 316/1975 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 410 ms. Remains : 117/1547 places, 316/1975 transitions.
Running random walk in product with property : CloudReconfiguration-PT-304-LTLCardinality-03
Stuttering criterion allowed to conclude after 20895 steps with 2160 reset in 76 ms.
Treatment of property CloudReconfiguration-PT-304-LTLCardinality-03 finished in 1046 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-31 18:24:16] [INFO ] Flatten gal took : 58 ms
[2024-05-31 18:24:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 18:24:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1547 places, 1975 transitions and 4127 arcs took 10 ms.
Total runtime 718139 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CloudReconfiguration-PT-304-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717179860296

--------------------
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
mcc2024
ltl formula name CloudReconfiguration-PT-304-LTLCardinality-03
ltl formula formula --ltl=/tmp/1219/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1547 places, 1975 transitions and 4127 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.060 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 1548 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1548, there are 2216 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~284 levels ~10000 states ~18384 transitions
pnml2lts-mc( 3/ 4): ~501 levels ~20000 states ~37040 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~264!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5729
pnml2lts-mc( 0/ 4): unique states count: 33302
pnml2lts-mc( 0/ 4): unique transitions count: 81384
pnml2lts-mc( 0/ 4): - self-loop count: 288
pnml2lts-mc( 0/ 4): - claim dead count: 24323
pnml2lts-mc( 0/ 4): - claim found count: 21917
pnml2lts-mc( 0/ 4): - claim success count: 33340
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1736
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33340 states 81435 transitions, fanout: 2.443
pnml2lts-mc( 0/ 4): Total exploration time 3.090 sec (3.090 sec minimum, 3.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 10790, Transitions per second: 26354
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 11.8 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2008 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)

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-304"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CloudReconfiguration-PT-304, 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 r480-tall-171624188700139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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