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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 19:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 19:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717181306830

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-310
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:48:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:48:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:48:28] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2024-05-31 18:48:28] [INFO ] Transformed 2585 places.
[2024-05-31 18:48:28] [INFO ] Transformed 3095 transitions.
[2024-05-31 18:48:28] [INFO ] Found NUPN structural information;
[2024-05-31 18:48:28] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 441 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-310-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-310-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 515 places :
Symmetric choice reduction at 0 with 515 rule applications. Total rules 515 place count 2070 transition count 2580
Iterating global reduction 0 with 515 rules applied. Total rules applied 1030 place count 2070 transition count 2580
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1058 place count 2070 transition count 2552
Discarding 237 places :
Symmetric choice reduction at 1 with 237 rule applications. Total rules 1295 place count 1833 transition count 2315
Iterating global reduction 1 with 237 rules applied. Total rules applied 1532 place count 1833 transition count 2315
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 1620 place count 1745 transition count 2227
Iterating global reduction 1 with 88 rules applied. Total rules applied 1708 place count 1745 transition count 2227
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1724 place count 1745 transition count 2211
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1770 place count 1699 transition count 2165
Iterating global reduction 2 with 46 rules applied. Total rules applied 1816 place count 1699 transition count 2165
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1825 place count 1699 transition count 2156
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1860 place count 1664 transition count 2117
Iterating global reduction 3 with 35 rules applied. Total rules applied 1895 place count 1664 transition count 2117
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1921 place count 1638 transition count 2091
Iterating global reduction 3 with 26 rules applied. Total rules applied 1947 place count 1638 transition count 2091
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1971 place count 1614 transition count 2067
Iterating global reduction 3 with 24 rules applied. Total rules applied 1995 place count 1614 transition count 2067
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 2018 place count 1591 transition count 2044
Iterating global reduction 3 with 23 rules applied. Total rules applied 2041 place count 1591 transition count 2044
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 2060 place count 1572 transition count 2013
Iterating global reduction 3 with 19 rules applied. Total rules applied 2079 place count 1572 transition count 2013
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2084 place count 1567 transition count 2005
Iterating global reduction 3 with 5 rules applied. Total rules applied 2089 place count 1567 transition count 2005
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2094 place count 1562 transition count 1998
Iterating global reduction 3 with 5 rules applied. Total rules applied 2099 place count 1562 transition count 1998
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2100 place count 1562 transition count 1997
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2102 place count 1560 transition count 1995
Iterating global reduction 4 with 2 rules applied. Total rules applied 2104 place count 1560 transition count 1995
Applied a total of 2104 rules in 1512 ms. Remains 1560 /2585 variables (removed 1025) and now considering 1995/3095 (removed 1100) transitions.
// Phase 1: matrix 1995 rows 1560 cols
[2024-05-31 18:48:30] [INFO ] Computed 4 invariants in 40 ms
[2024-05-31 18:48:31] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-05-31 18:48:31] [INFO ] Invariant cache hit.
[2024-05-31 18:48:32] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Running 1994 sub problems to find dead transitions.
[2024-05-31 18:48:32] [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/1559 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1994 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1559/3555 variables, and 4 constraints, problems are : Problem set: 0 solved, 1994 unsolved in 30093 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1560 constraints, PredecessorRefiner: 1994/1994 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1994 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1559 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1994 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1559/3555 variables, and 4 constraints, problems are : Problem set: 0 solved, 1994 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1560 constraints, PredecessorRefiner: 0/1994 constraints, Known Traps: 0/0 constraints]
After SMT, in 60806ms problems are : Problem set: 0 solved, 1994 unsolved
Search for dead transitions found 0 dead transitions in 60842ms
Starting structural reductions in LTL mode, iteration 1 : 1560/2585 places, 1995/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64101 ms. Remains : 1560/2585 places, 1995/3095 transitions.
Support contains 41 out of 1560 places after structural reductions.
[2024-05-31 18:49:33] [INFO ] Flatten gal took : 159 ms
[2024-05-31 18:49:33] [INFO ] Flatten gal took : 69 ms
[2024-05-31 18:49:33] [INFO ] Input system was already deterministic with 1995 transitions.
Support contains 39 out of 1560 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (319 resets) in 1681 ms. (23 steps per ms) remains 21/38 properties
BEST_FIRST walk for 4004 steps (11 resets) in 46 ms. (85 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (10 resets) in 90 ms. (43 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (10 resets) in 112 ms. (35 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 138 ms. (28 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 122 ms. (32 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 96 ms. (41 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 96 ms. (41 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (9 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (11 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (10 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (11 resets) in 51 ms. (76 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
[2024-05-31 18:49:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1526/1549 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1549 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1985/3534 variables, 1549/1553 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3534 variables, 0/1553 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/3536 variables, 1/1554 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3536 variables, 0/1554 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 2/3538 variables, 1/1555 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3538/3555 variables, and 1555 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5024 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1551/1560 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1526/1549 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1549 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1985/3534 variables, 1549/1553 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3534 variables, 20/1573 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3534 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/3536 variables, 1/1574 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3536 variables, 0/1574 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 2/3538 variables, 1/1575 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3538 variables, 0/1575 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 2/3540 variables, 1/1576 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3540 variables, 0/1576 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 2/3542 variables, 1/1577 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3542/3555 variables, and 1577 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1553/1560 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 10057ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Graph (trivial) has 1851 edges and 1560 vertex of which 662 / 1560 are part of one of the 63 SCC in 7 ms
Free SCC test removed 599 places
Drop transitions (Empty/Sink Transition effects.) removed 752 transitions
Reduce isomorphic transitions removed 752 transitions.
Graph (complete) has 1417 edges and 961 vertex of which 951 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 510 rules applied. Total rules applied 512 place count 951 transition count 728
Reduce places removed 503 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 549 rules applied. Total rules applied 1061 place count 448 transition count 682
Reduce places removed 30 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 32 rules applied. Total rules applied 1093 place count 418 transition count 680
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 3 with 16 rules applied. Total rules applied 1109 place count 417 transition count 665
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1124 place count 403 transition count 664
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 52 Pre rules applied. Total rules applied 1124 place count 403 transition count 612
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 1228 place count 351 transition count 612
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1237 place count 342 transition count 600
Iterating global reduction 5 with 9 rules applied. Total rules applied 1246 place count 342 transition count 600
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 5 with 2 rules applied. Total rules applied 1248 place count 342 transition count 598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1250 place count 340 transition count 598
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1256 place count 334 transition count 592
Iterating global reduction 7 with 6 rules applied. Total rules applied 1262 place count 334 transition count 592
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1268 place count 334 transition count 586
Performed 162 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 162 places in 0 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 8 with 324 rules applied. Total rules applied 1592 place count 172 transition count 329
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 1618 place count 172 transition count 303
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1621 place count 169 transition count 300
Iterating global reduction 9 with 3 rules applied. Total rules applied 1624 place count 169 transition count 300
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1646 place count 158 transition count 287
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1659 place count 158 transition count 274
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 1661 place count 157 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1663 place count 157 transition count 271
Performed 36 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 11 with 72 rules applied. Total rules applied 1735 place count 121 transition count 305
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 11 with 31 rules applied. Total rules applied 1766 place count 121 transition count 274
Discarding 18 places :
Symmetric choice reduction at 12 with 18 rule applications. Total rules 1784 place count 103 transition count 238
Iterating global reduction 12 with 18 rules applied. Total rules applied 1802 place count 103 transition count 238
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1811 place count 103 transition count 229
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1813 place count 101 transition count 225
Iterating global reduction 13 with 2 rules applied. Total rules applied 1815 place count 101 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1817 place count 101 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 1825 place count 101 transition count 215
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 1831 place count 101 transition count 209
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 1839 place count 95 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1840 place count 95 transition count 206
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1842 place count 95 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1843 place count 95 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1844 place count 94 transition count 204
Applied a total of 1844 rules in 172 ms. Remains 94 /1560 variables (removed 1466) and now considering 204/1995 (removed 1791) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 94/1560 places, 204/1995 transitions.
RANDOM walk for 40000 steps (472 resets) in 555 ms. (71 steps per ms) remains 1/20 properties
BEST_FIRST walk for 40002 steps (119 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
[2024-05-31 18:49:45] [INFO ] Flow matrix only has 194 transitions (discarded 10 similar events)
// Phase 1: matrix 194 rows 94 cols
[2024-05-31 18:49:45] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 18:49:45] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/50 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/155 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/166 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 263/288 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 77/94 constraints, ReadFeed: 1/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CloudReconfiguration-PT-310-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA CloudReconfiguration-PT-310-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2174 edges and 1560 vertex of which 1550 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.23 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1 U (p1&&(p2 U (p3||G(p2)))))))'
Support contains 4 out of 1560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Graph (trivial) has 1899 edges and 1560 vertex of which 699 / 1560 are part of one of the 63 SCC in 3 ms
Free SCC test removed 636 places
Ensure Unique test removed 739 transitions
Reduce isomorphic transitions removed 739 transitions.
Graph (complete) has 1429 edges and 924 vertex of which 914 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 502 transitions
Trivial Post-agglo rules discarded 502 transitions
Performed 502 trivial Post agglomeration. Transition count delta: 502
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 913 transition count 746
Reduce places removed 502 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 526 rules applied. Total rules applied 1031 place count 411 transition count 722
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1043 place count 399 transition count 722
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1043 place count 399 transition count 675
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1137 place count 352 transition count 675
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1153 place count 336 transition count 650
Iterating global reduction 3 with 16 rules applied. Total rules applied 1169 place count 336 transition count 650
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1171 place count 336 transition count 648
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1173 place count 334 transition count 648
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1182 place count 325 transition count 637
Iterating global reduction 5 with 9 rules applied. Total rules applied 1191 place count 325 transition count 637
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1197 place count 325 transition count 631
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1199 place count 323 transition count 627
Iterating global reduction 6 with 2 rules applied. Total rules applied 1201 place count 323 transition count 627
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1203 place count 321 transition count 623
Iterating global reduction 6 with 2 rules applied. Total rules applied 1205 place count 321 transition count 623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1206 place count 320 transition count 621
Iterating global reduction 6 with 1 rules applied. Total rules applied 1207 place count 320 transition count 621
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1208 place count 319 transition count 619
Iterating global reduction 6 with 1 rules applied. Total rules applied 1209 place count 319 transition count 619
Performed 148 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 6 with 296 rules applied. Total rules applied 1505 place count 171 transition count 385
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1520 place count 171 transition count 370
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1525 place count 166 transition count 363
Iterating global reduction 7 with 5 rules applied. Total rules applied 1530 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 7 with 24 rules applied. Total rules applied 1554 place count 154 transition count 349
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1568 place count 154 transition count 335
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1569 place count 153 transition count 333
Iterating global reduction 8 with 1 rules applied. Total rules applied 1570 place count 153 transition count 333
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1608 place count 134 transition count 371
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 1631 place count 134 transition count 348
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1640 place count 125 transition count 330
Iterating global reduction 9 with 9 rules applied. Total rules applied 1649 place count 125 transition count 330
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1655 place count 125 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 10 with 40 rules applied. Total rules applied 1695 place count 125 transition count 284
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1697 place count 125 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1698 place count 125 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1699 place count 124 transition count 282
Applied a total of 1699 rules in 168 ms. Remains 124 /1560 variables (removed 1436) and now considering 282/1995 (removed 1713) transitions.
[2024-05-31 18:49:45] [INFO ] Flow matrix only has 225 transitions (discarded 57 similar events)
// Phase 1: matrix 225 rows 124 cols
[2024-05-31 18:49:45] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:49:46] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-31 18:49:46] [INFO ] Flow matrix only has 225 transitions (discarded 57 similar events)
[2024-05-31 18:49:46] [INFO ] Invariant cache hit.
[2024-05-31 18:49:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 18:49:46] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [16, 51]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 354 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/1560 places, 282/1995 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 280
Applied a total of 4 rules in 17 ms. Remains 120 /122 variables (removed 2) and now considering 280/282 (removed 2) transitions.
[2024-05-31 18:49:46] [INFO ] Flow matrix only has 223 transitions (discarded 57 similar events)
// Phase 1: matrix 223 rows 120 cols
[2024-05-31 18:49:46] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:49:46] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-31 18:49:46] [INFO ] Flow matrix only has 223 transitions (discarded 57 similar events)
[2024-05-31 18:49:46] [INFO ] Invariant cache hit.
[2024-05-31 18:49:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 18:49:46] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/1560 places, 280/1995 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 992 ms. Remains : 120/1560 places, 280/1995 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA CloudReconfiguration-PT-310-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-310-LTLFireability-00 finished in 1432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||(p1 U p2)))))'
Support contains 3 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1545 transition count 1979
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1545 transition count 1979
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 1545 transition count 1977
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 40 place count 1537 transition count 1968
Iterating global reduction 1 with 8 rules applied. Total rules applied 48 place count 1537 transition count 1968
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 1533 transition count 1964
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 1533 transition count 1964
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 1529 transition count 1960
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 1529 transition count 1960
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 1527 transition count 1958
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 1527 transition count 1958
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 1525 transition count 1955
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 1525 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 1523 transition count 1952
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 1523 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 1521 transition count 1950
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 1521 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 1521 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 1520 transition count 1948
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 1520 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1519 transition count 1946
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1519 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1518 transition count 1944
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1518 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1517 transition count 1943
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1517 transition count 1943
Applied a total of 89 rules in 874 ms. Remains 1517 /1560 variables (removed 43) and now considering 1943/1995 (removed 52) transitions.
// Phase 1: matrix 1943 rows 1517 cols
[2024-05-31 18:49:47] [INFO ] Computed 4 invariants in 26 ms
[2024-05-31 18:49:48] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-31 18:49:48] [INFO ] Invariant cache hit.
[2024-05-31 18:49:49] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
Running 1942 sub problems to find dead transitions.
[2024-05-31 18:49:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3460 variables, and 4 constraints, problems are : Problem set: 0 solved, 1942 unsolved in 30046 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 1942/1942 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1942 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1516/3460 variables, and 4 constraints, problems are : Problem set: 0 solved, 1942 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 0/1942 constraints, Known Traps: 0/0 constraints]
After SMT, in 60700ms problems are : Problem set: 0 solved, 1942 unsolved
Search for dead transitions found 0 dead transitions in 60721ms
Starting structural reductions in LTL mode, iteration 1 : 1517/1560 places, 1943/1995 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62889 ms. Remains : 1517/1560 places, 1943/1995 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-310-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-310-LTLFireability-01 finished in 63198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1&&G(F(p1))))))'
Support contains 2 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1544 transition count 1978
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1544 transition count 1978
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1544 transition count 1976
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 1535 transition count 1966
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 1535 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 1530 transition count 1961
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 1530 transition count 1961
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 1530 transition count 1960
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 1526 transition count 1956
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 1526 transition count 1956
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 1523 transition count 1953
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 1523 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 1520 transition count 1948
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 1520 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 1517 transition count 1943
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 1517 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 1514 transition count 1940
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 1514 transition count 1940
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 1513 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 1513 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 1512 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 1511 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 1510 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 1510 transition count 1932
Applied a total of 105 rules in 702 ms. Remains 1510 /1560 variables (removed 50) and now considering 1932/1995 (removed 63) transitions.
// Phase 1: matrix 1932 rows 1510 cols
[2024-05-31 18:50:50] [INFO ] Computed 4 invariants in 18 ms
[2024-05-31 18:50:51] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-31 18:50:51] [INFO ] Invariant cache hit.
[2024-05-31 18:50:52] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-31 18:50:52] [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/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60584ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60604ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1560 places, 1932/1995 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62701 ms. Remains : 1510/1560 places, 1932/1995 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-310-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-310-LTLFireability-02 finished in 62914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 3 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1545 transition count 1979
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1545 transition count 1979
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 1545 transition count 1977
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 1536 transition count 1967
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 1536 transition count 1967
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 1531 transition count 1962
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 1531 transition count 1962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 1531 transition count 1961
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 1527 transition count 1957
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 1527 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 1525 transition count 1955
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 1525 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 1523 transition count 1951
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 1523 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 1521 transition count 1947
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 1521 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 1519 transition count 1945
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 1519 transition count 1945
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 1519 transition count 1943
Applied a total of 87 rules in 535 ms. Remains 1519 /1560 variables (removed 41) and now considering 1943/1995 (removed 52) transitions.
// Phase 1: matrix 1943 rows 1519 cols
[2024-05-31 18:51:53] [INFO ] Computed 4 invariants in 9 ms
[2024-05-31 18:51:53] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-31 18:51:54] [INFO ] Invariant cache hit.
[2024-05-31 18:51:55] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
Running 1942 sub problems to find dead transitions.
[2024-05-31 18:51:55] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 1.0)
(s273 1.0)
(s274 1.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 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1518/3462 variables, and 4 constraints, problems are : Problem set: 0 solved, 1942 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 1942/1942 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1942 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1518 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1518/3462 variables, and 4 constraints, problems are : Problem set: 0 solved, 1942 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1519 constraints, PredecessorRefiner: 0/1942 constraints, Known Traps: 0/0 constraints]
After SMT, in 60547ms problems are : Problem set: 0 solved, 1942 unsolved
Search for dead transitions found 0 dead transitions in 60571ms
Starting structural reductions in LTL mode, iteration 1 : 1519/1560 places, 1943/1995 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62442 ms. Remains : 1519/1560 places, 1943/1995 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-310-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-310-LTLFireability-03 finished in 62637 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)) U (!p0&&F(p1))))'
Support contains 3 out of 1560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Graph (trivial) has 1894 edges and 1560 vertex of which 699 / 1560 are part of one of the 63 SCC in 2 ms
Free SCC test removed 636 places
Ensure Unique test removed 739 transitions
Reduce isomorphic transitions removed 739 transitions.
Graph (complete) has 1429 edges and 924 vertex of which 914 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 505 rules applied. Total rules applied 507 place count 913 transition count 744
Reduce places removed 504 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 528 rules applied. Total rules applied 1035 place count 409 transition count 720
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 1049 place count 397 transition count 718
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1051 place count 395 transition count 718
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1051 place count 395 transition count 672
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1143 place count 349 transition count 672
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1159 place count 333 transition count 647
Iterating global reduction 4 with 16 rules applied. Total rules applied 1175 place count 333 transition count 647
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1177 place count 333 transition count 645
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1179 place count 331 transition count 645
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1189 place count 321 transition count 632
Iterating global reduction 6 with 10 rules applied. Total rules applied 1199 place count 321 transition count 632
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1205 place count 321 transition count 626
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1207 place count 319 transition count 622
Iterating global reduction 7 with 2 rules applied. Total rules applied 1209 place count 319 transition count 622
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1211 place count 317 transition count 618
Iterating global reduction 7 with 2 rules applied. Total rules applied 1213 place count 317 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1215 place count 315 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1217 place count 315 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1219 place count 313 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1221 place count 313 transition count 610
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1222 place count 312 transition count 608
Iterating global reduction 7 with 1 rules applied. Total rules applied 1223 place count 312 transition count 608
Performed 149 Post agglomeration using F-continuation condition with reduction of 91 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 7 with 298 rules applied. Total rules applied 1521 place count 163 transition count 368
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1535 place count 163 transition count 354
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1540 place count 158 transition count 347
Iterating global reduction 8 with 5 rules applied. Total rules applied 1545 place count 158 transition count 347
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1567 place count 147 transition count 334
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1579 place count 147 transition count 322
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1615 place count 129 transition count 358
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 1635 place count 129 transition count 338
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1644 place count 120 transition count 317
Iterating global reduction 10 with 9 rules applied. Total rules applied 1653 place count 120 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1658 place count 120 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 11 with 37 rules applied. Total rules applied 1695 place count 120 transition count 275
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1696 place count 120 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1697 place count 120 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1698 place count 119 transition count 273
Applied a total of 1698 rules in 196 ms. Remains 119 /1560 variables (removed 1441) and now considering 273/1995 (removed 1722) transitions.
[2024-05-31 18:52:56] [INFO ] Flow matrix only has 217 transitions (discarded 56 similar events)
// Phase 1: matrix 217 rows 119 cols
[2024-05-31 18:52:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 18:52:56] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-31 18:52:56] [INFO ] Flow matrix only has 217 transitions (discarded 56 similar events)
[2024-05-31 18:52:56] [INFO ] Invariant cache hit.
[2024-05-31 18:52:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:52:56] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [10, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 303 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1560 places, 273/1995 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 271
Applied a total of 4 rules in 20 ms. Remains 115 /117 variables (removed 2) and now considering 271/273 (removed 2) transitions.
[2024-05-31 18:52:56] [INFO ] Flow matrix only has 215 transitions (discarded 56 similar events)
// Phase 1: matrix 215 rows 115 cols
[2024-05-31 18:52:56] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:52:56] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-31 18:52:56] [INFO ] Flow matrix only has 215 transitions (discarded 56 similar events)
[2024-05-31 18:52:56] [INFO ] Invariant cache hit.
[2024-05-31 18:52:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:52:56] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1560 places, 271/1995 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1137 ms. Remains : 115/1560 places, 271/1995 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-04
Stuttering criterion allowed to conclude after 8 steps with 3 reset in 1 ms.
FORMULA CloudReconfiguration-PT-310-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-310-LTLFireability-04 finished in 1262 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(p0)||(p0&&G((p1&&F(!p2))))))))'
Support contains 2 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1543 transition count 1977
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1543 transition count 1977
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 1543 transition count 1975
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 1533 transition count 1964
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 1533 transition count 1964
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 1527 transition count 1958
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 1527 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 1527 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 74 place count 1522 transition count 1952
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 1522 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 1519 transition count 1949
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 1519 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 1516 transition count 1944
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 1516 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 1513 transition count 1939
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 1513 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 1510 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 1510 transition count 1936
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 1509 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 1508 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 1506 transition count 1928
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 1506 transition count 1928
Applied a total of 113 rules in 675 ms. Remains 1506 /1560 variables (removed 54) and now considering 1928/1995 (removed 67) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-31 18:52:57] [INFO ] Computed 4 invariants in 14 ms
[2024-05-31 18:52:58] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-31 18:52:58] [INFO ] Invariant cache hit.
[2024-05-31 18:52:58] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-31 18:52:58] [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/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60537ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60552ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1560 places, 1928/1995 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62441 ms. Remains : 1506/1560 places, 1928/1995 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (NOT p1) p2)]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-05
Product exploration explored 100000 steps with 779 reset in 357 ms.
Product exploration explored 100000 steps with 765 reset in 283 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 142 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (NOT p1) p2)]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (318 resets) in 436 ms. (91 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (99 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (101 resets) in 126 ms. (314 steps per ms) remains 1/4 properties
[2024-05-31 18:54:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 415/417 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1566 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1575ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p2), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 14 factoid took 421 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (NOT p1) p2)]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 51 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2024-05-31 18:54:03] [INFO ] Invariant cache hit.
[2024-05-31 18:54:03] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-31 18:54:03] [INFO ] Invariant cache hit.
[2024-05-31 18:54:04] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-31 18:54:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 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 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60559ms
Finished structural reductions in LTL mode , in 1 iterations and 61855 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.25 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 136 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (NOT p1) p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (302 resets) in 162 ms. (245 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40002 steps (97 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 37795 steps (90 resets) in 111 ms. (337 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 390 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 777 reset in 167 ms.
Product exploration explored 100000 steps with 784 reset in 189 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (NOT p1) p2)]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1835 edges and 1506 vertex of which 680 / 1506 are part of one of the 62 SCC in 2 ms
Free SCC test removed 618 places
Ensure Unique test removed 717 transitions
Reduce isomorphic transitions removed 717 transitions.
Graph (complete) has 1382 edges and 888 vertex of which 879 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 479 place count 879 transition count 1206
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 491 place count 879 transition count 1194
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 491 place count 879 transition count 1210
Deduced a syphon composed of 500 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 514 place count 879 transition count 1210
Discarding 284 places :
Symmetric choice reduction at 2 with 284 rule applications. Total rules 798 place count 595 transition count 916
Deduced a syphon composed of 232 places in 1 ms
Iterating global reduction 2 with 284 rules applied. Total rules applied 1082 place count 595 transition count 916
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1094 place count 583 transition count 900
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1106 place count 583 transition count 900
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1112 place count 583 transition count 894
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1124 place count 571 transition count 882
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1136 place count 571 transition count 882
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1138 place count 569 transition count 878
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1140 place count 569 transition count 878
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1142 place count 567 transition count 874
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1144 place count 567 transition count 874
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1148 place count 563 transition count 870
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1152 place count 563 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1154 place count 561 transition count 866
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1156 place count 561 transition count 866
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1158 place count 559 transition count 862
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1160 place count 559 transition count 862
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1164 place count 555 transition count 856
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1168 place count 555 transition count 856
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1172 place count 551 transition count 840
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1176 place count 551 transition count 840
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1177 place count 551 transition count 840
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1181 place count 547 transition count 836
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1185 place count 547 transition count 836
Performed 106 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 319 places in 1 ms
Iterating global reduction 4 with 106 rules applied. Total rules applied 1291 place count 547 transition count 911
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1330 place count 547 transition count 872
Discarding 101 places :
Symmetric choice reduction at 5 with 101 rule applications. Total rules 1431 place count 446 transition count 761
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 101 rules applied. Total rules applied 1532 place count 446 transition count 761
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1538 place count 440 transition count 752
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1544 place count 440 transition count 752
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1551 place count 440 transition count 752
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1555 place count 440 transition count 748
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1570 place count 425 transition count 729
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1585 place count 425 transition count 729
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1591 place count 425 transition count 723
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1595 place count 421 transition count 719
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1599 place count 421 transition count 719
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1602 place count 421 transition count 719
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1608 place count 421 transition count 713
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1611 place count 418 transition count 710
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1614 place count 418 transition count 710
Performed 72 Post agglomeration using F-continuation condition with reduction of 125 identical transitions.
Deduced a syphon composed of 286 places in 1 ms
Iterating global reduction 8 with 72 rules applied. Total rules applied 1686 place count 418 transition count 1039
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 8 with 126 rules applied. Total rules applied 1812 place count 418 transition count 913
Discarding 129 places :
Symmetric choice reduction at 9 with 129 rule applications. Total rules 1941 place count 289 transition count 570
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 9 with 129 rules applied. Total rules applied 2070 place count 289 transition count 570
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2085 place count 289 transition count 555
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2112 place count 262 transition count 498
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2139 place count 262 transition count 498
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2142 place count 262 transition count 557
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2145 place count 259 transition count 529
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2148 place count 259 transition count 529
Deduced a syphon composed of 139 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 10 with 46 rules applied. Total rules applied 2194 place count 259 transition count 483
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2198 place count 255 transition count 479
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2202 place count 255 transition count 479
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2205 place count 255 transition count 543
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2208 place count 252 transition count 528
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2211 place count 252 transition count 528
Deduced a syphon composed of 135 places in 0 ms
Applied a total of 2211 rules in 343 ms. Remains 252 /1506 variables (removed 1254) and now considering 528/1928 (removed 1400) transitions.
[2024-05-31 18:55:08] [INFO ] Redundant transitions in 27 ms returned []
Running 527 sub problems to find dead transitions.
[2024-05-31 18:55:08] [INFO ] Flow matrix only has 472 transitions (discarded 56 similar events)
// Phase 1: matrix 472 rows 252 cols
[2024-05-31 18:55:08] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:55:08] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 527 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
At refinement iteration 1 (OVERLAPS) 471/722 variables, 251/251 constraints. Problems are: Problem set: 260 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/722 variables, 2/253 constraints. Problems are: Problem set: 260 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/722 variables, 0/253 constraints. Problems are: Problem set: 260 solved, 267 unsolved
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/723 variables, 1/254 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/723 variables, 0/254 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 1/724 variables, 1/255 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/255 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/724 variables, 0/255 constraints. Problems are: Problem set: 265 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 724/724 variables, and 255 constraints, problems are : Problem set: 265 solved, 262 unsolved in 19252 ms.
Refiners :[State Equation: 252/252 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 527/527 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 265 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 468/584 variables, 116/116 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 2/118 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 262/380 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 0/380 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 139/723 variables, 136/516 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/723 variables, 0/516 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/724 variables, 1/517 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/724 variables, 0/517 constraints. Problems are: Problem set: 265 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/724 variables, 0/517 constraints. Problems are: Problem set: 265 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 724/724 variables, and 517 constraints, problems are : Problem set: 265 solved, 262 unsolved in 25319 ms.
Refiners :[State Equation: 252/252 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 262/527 constraints, Known Traps: 0/0 constraints]
After SMT, in 44898ms problems are : Problem set: 265 solved, 262 unsolved
Search for dead transitions found 265 dead transitions in 44904ms
Found 265 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 265 transitions
Dead transitions reduction (with SMT) removed 265 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 252/1506 places, 263/1928 transitions.
Graph (complete) has 408 edges and 252 vertex of which 117 are kept as prefixes of interest. Removing 135 places using SCC suffix rule.0 ms
Discarding 135 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 110 transition count 245
Applied a total of 8 rules in 10 ms. Remains 110 /252 variables (removed 142) and now considering 245/263 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1506 places, 245/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45295 ms. Remains : 110/1506 places, 245/1928 transitions.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 39 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-31 18:55:53] [INFO ] Computed 4 invariants in 16 ms
[2024-05-31 18:55:53] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-31 18:55:53] [INFO ] Invariant cache hit.
[2024-05-31 18:55:54] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-31 18:55:54] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60510ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60526ms
Finished structural reductions in LTL mode , in 1 iterations and 61830 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Treatment of property CloudReconfiguration-PT-310-LTLFireability-05 finished in 238164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Support contains 3 out of 1560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Graph (trivial) has 1900 edges and 1560 vertex of which 694 / 1560 are part of one of the 63 SCC in 2 ms
Free SCC test removed 631 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1435 edges and 929 vertex of which 920 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 508 transitions
Trivial Post-agglo rules discarded 508 transitions
Performed 508 trivial Post agglomeration. Transition count delta: 508
Iterating post reduction 0 with 508 rules applied. Total rules applied 510 place count 919 transition count 748
Reduce places removed 508 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 532 rules applied. Total rules applied 1042 place count 411 transition count 724
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1055 place count 399 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1056 place count 398 transition count 723
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1056 place count 398 transition count 677
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1148 place count 352 transition count 677
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1164 place count 336 transition count 652
Iterating global reduction 4 with 16 rules applied. Total rules applied 1180 place count 336 transition count 652
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 1182 place count 336 transition count 650
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1184 place count 334 transition count 650
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1194 place count 324 transition count 637
Iterating global reduction 6 with 10 rules applied. Total rules applied 1204 place count 324 transition count 637
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1210 place count 324 transition count 631
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1213 place count 321 transition count 625
Iterating global reduction 7 with 3 rules applied. Total rules applied 1216 place count 321 transition count 625
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1219 place count 318 transition count 619
Iterating global reduction 7 with 3 rules applied. Total rules applied 1222 place count 318 transition count 619
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1224 place count 316 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 1226 place count 316 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1228 place count 314 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1230 place count 314 transition count 611
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1231 place count 313 transition count 609
Iterating global reduction 7 with 1 rules applied. Total rules applied 1232 place count 313 transition count 609
Performed 148 Post agglomeration using F-continuation condition with reduction of 88 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 7 with 296 rules applied. Total rules applied 1528 place count 165 transition count 373
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1543 place count 165 transition count 358
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1548 place count 160 transition count 351
Iterating global reduction 8 with 5 rules applied. Total rules applied 1553 place count 160 transition count 351
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1554 place count 159 transition count 346
Iterating global reduction 8 with 1 rules applied. Total rules applied 1555 place count 159 transition count 346
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1581 place count 146 transition count 331
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1596 place count 146 transition count 316
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1597 place count 145 transition count 312
Iterating global reduction 9 with 1 rules applied. Total rules applied 1598 place count 145 transition count 312
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 1600 place count 144 transition count 311
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1634 place count 127 transition count 345
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1651 place count 127 transition count 328
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1660 place count 118 transition count 310
Iterating global reduction 10 with 9 rules applied. Total rules applied 1669 place count 118 transition count 310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1675 place count 118 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 11 with 36 rules applied. Total rules applied 1711 place count 118 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1712 place count 117 transition count 267
Applied a total of 1712 rules in 95 ms. Remains 117 /1560 variables (removed 1443) and now considering 267/1995 (removed 1728) transitions.
[2024-05-31 18:56:55] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 117 cols
[2024-05-31 18:56:55] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 18:56:55] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 18:56:55] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2024-05-31 18:56:55] [INFO ] Invariant cache hit.
[2024-05-31 18:56:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:56:55] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [9, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 185 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1560 places, 267/1995 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 113 transition count 265
Applied a total of 4 rules in 6 ms. Remains 113 /115 variables (removed 2) and now considering 265/267 (removed 2) transitions.
[2024-05-31 18:56:55] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 113 cols
[2024-05-31 18:56:55] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:56:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 18:56:55] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-31 18:56:55] [INFO ] Invariant cache hit.
[2024-05-31 18:56:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:56:55] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1560 places, 265/1995 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 461 ms. Remains : 113/1560 places, 265/1995 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-08
Product exploration explored 100000 steps with 9851 reset in 267 ms.
Product exploration explored 100000 steps with 9848 reset in 285 ms.
Computed a total of 3 stabilizing places and 17 stable transitions
Graph (complete) has 407 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 15 factoid took 677 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (4732 resets) in 1066 ms. (37 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40002 steps (1006 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1027 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (933 resets) in 113 ms. (350 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (999 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
[2024-05-31 18:56:57] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-31 18:56:57] [INFO ] Invariant cache hit.
[2024-05-31 18:56:57] [INFO ] State equation strengthened by 3 read => feed constraints.
Problem apf4 is UNSAT
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/114 variables, 6/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 193/307 variables, 92/101 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 2/103 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/320 variables, 12/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/321 variables, 1/116 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/321 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 116 constraints, problems are : Problem set: 2 solved, 1 unsolved in 95 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/114 variables, 6/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 193/307 variables, 92/102 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 2/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf9 is UNSAT
After SMT solving in domain Int declared 320/321 variables, and 116 constraints, problems are : Problem set: 3 solved, 0 unsolved in 120 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 2/3 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (G (OR p1 (NOT p0) p2)), (G (OR (NOT p1) (NOT p0) p2)), (G (OR p1 p0 p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 18 factoid took 984 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p2))]
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 265/265 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-05-31 18:56:58] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-31 18:56:58] [INFO ] Invariant cache hit.
[2024-05-31 18:56:58] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 18:56:58] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-31 18:56:58] [INFO ] Invariant cache hit.
[2024-05-31 18:56:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:56:59] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-31 18:56:59] [INFO ] Redundant transitions in 29 ms returned []
Running 259 sub problems to find dead transitions.
[2024-05-31 18:56:59] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-31 18:56:59] [INFO ] Invariant cache hit.
[2024-05-31 18:56:59] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 207/319 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/320 variables, 1/115 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/115 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 1/321 variables, 1/116 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/116 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/116 constraints. Problems are: Problem set: 5 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 116 constraints, problems are : Problem set: 5 solved, 254 unsolved in 9136 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 207/319 variables, 112/112 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 2/114 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 254/368 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/368 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 1/320 variables, 1/369 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/369 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 1/321 variables, 1/370 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/370 constraints. Problems are: Problem set: 5 solved, 254 unsolved
At refinement iteration 9 (OVERLAPS) 0/321 variables, 0/370 constraints. Problems are: Problem set: 5 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 370 constraints, problems are : Problem set: 5 solved, 254 unsolved in 13259 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 254/259 constraints, Known Traps: 0/0 constraints]
After SMT, in 22508ms problems are : Problem set: 5 solved, 254 unsolved
Search for dead transitions found 5 dead transitions in 22512ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/113 places, 260/265 transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 106 transition count 242
Applied a total of 7 rules in 10 ms. Remains 106 /113 variables (removed 7) and now considering 242/260 (removed 18) transitions.
[2024-05-31 18:57:21] [INFO ] Flow matrix only has 189 transitions (discarded 53 similar events)
// Phase 1: matrix 189 rows 106 cols
[2024-05-31 18:57:21] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:57:21] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 18:57:21] [INFO ] Flow matrix only has 189 transitions (discarded 53 similar events)
[2024-05-31 18:57:21] [INFO ] Invariant cache hit.
[2024-05-31 18:57:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:57:21] [INFO ] Implicit Places using invariants and state equation in 102 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 : 106/113 places, 242/265 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22906 ms. Remains : 106/113 places, 242/265 transitions.
Computed a total of 3 stabilizing places and 12 stable transitions
Graph (complete) has 367 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 5 factoid took 532 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (4779 resets) in 199 ms. (200 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (990 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
[2024-05-31 18:57:22] [INFO ] Flow matrix only has 189 transitions (discarded 53 similar events)
[2024-05-31 18:57:22] [INFO ] Invariant cache hit.
[2024-05-31 18:57:22] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/106 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 175/281 variables, 85/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/294 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/295 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/295 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[State Equation: 106/106 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/106 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 175/281 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 294/295 variables, and 109 constraints, problems are : Problem set: 1 solved, 0 unsolved in 77 ms.
Refiners :[State Equation: 106/106 constraints, ReadFeed: 2/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (G (OR p1 p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 734 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 9750 reset in 155 ms.
Product exploration explored 100000 steps with 9802 reset in 157 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-31 18:57:23] [INFO ] Flow matrix only has 189 transitions (discarded 53 similar events)
[2024-05-31 18:57:23] [INFO ] Invariant cache hit.
[2024-05-31 18:57:23] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 18:57:23] [INFO ] Flow matrix only has 189 transitions (discarded 53 similar events)
[2024-05-31 18:57:23] [INFO ] Invariant cache hit.
[2024-05-31 18:57:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:57:23] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-31 18:57:24] [INFO ] Redundant transitions in 26 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-31 18:57:24] [INFO ] Flow matrix only has 189 transitions (discarded 53 similar events)
[2024-05-31 18:57:24] [INFO ] Invariant cache hit.
[2024-05-31 18:57:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 188/293 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 1/294 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 1/295 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 0/295 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 109 constraints, problems are : Problem set: 0 solved, 236 unsolved in 7836 ms.
Refiners :[State Equation: 106/106 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 188/293 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 236/343 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 1/294 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 1/295 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (OVERLAPS) 0/295 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 345 constraints, problems are : Problem set: 0 solved, 236 unsolved in 11486 ms.
Refiners :[State Equation: 106/106 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 19428ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 19432ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19627 ms. Remains : 106/106 places, 242/242 transitions.
Treatment of property CloudReconfiguration-PT-310-LTLFireability-08 finished in 48265 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&&F(p1)))))'
Support contains 2 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1543 transition count 1977
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1543 transition count 1977
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 1543 transition count 1975
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 1533 transition count 1964
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 1533 transition count 1964
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 1527 transition count 1958
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 1527 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 1527 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 74 place count 1522 transition count 1952
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 1522 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 1519 transition count 1949
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 1519 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 1516 transition count 1944
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 1516 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 1513 transition count 1939
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 1513 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 1510 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 1510 transition count 1936
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 1509 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 1508 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 1506 transition count 1928
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 1506 transition count 1928
Applied a total of 113 rules in 632 ms. Remains 1506 /1560 variables (removed 54) and now considering 1928/1995 (removed 67) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-31 18:57:44] [INFO ] Computed 4 invariants in 22 ms
[2024-05-31 18:57:44] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-31 18:57:44] [INFO ] Invariant cache hit.
[2024-05-31 18:57:45] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-31 18:57:45] [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/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 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 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60502ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60516ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1560 places, 1928/1995 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62327 ms. Remains : 1506/1560 places, 1928/1995 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-10
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-310-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-310-LTLFireability-10 finished in 62496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1&&(p2||G(F(p0)))))))'
Support contains 3 out of 1560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Graph (trivial) has 1899 edges and 1560 vertex of which 695 / 1560 are part of one of the 63 SCC in 1 ms
Free SCC test removed 632 places
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 1434 edges and 928 vertex of which 918 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 507 transitions
Trivial Post-agglo rules discarded 507 transitions
Performed 507 trivial Post agglomeration. Transition count delta: 507
Iterating post reduction 0 with 508 rules applied. Total rules applied 510 place count 917 transition count 746
Reduce places removed 507 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 529 rules applied. Total rules applied 1039 place count 410 transition count 724
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1051 place count 399 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1052 place count 398 transition count 723
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1052 place count 398 transition count 676
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 1146 place count 351 transition count 676
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1161 place count 336 transition count 653
Iterating global reduction 4 with 15 rules applied. Total rules applied 1176 place count 336 transition count 653
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 1178 place count 336 transition count 651
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1180 place count 334 transition count 651
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1190 place count 324 transition count 638
Iterating global reduction 6 with 10 rules applied. Total rules applied 1200 place count 324 transition count 638
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1206 place count 324 transition count 632
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1209 place count 321 transition count 626
Iterating global reduction 7 with 3 rules applied. Total rules applied 1212 place count 321 transition count 626
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1215 place count 318 transition count 620
Iterating global reduction 7 with 3 rules applied. Total rules applied 1218 place count 318 transition count 620
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1220 place count 316 transition count 616
Iterating global reduction 7 with 2 rules applied. Total rules applied 1222 place count 316 transition count 616
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1224 place count 314 transition count 612
Iterating global reduction 7 with 2 rules applied. Total rules applied 1226 place count 314 transition count 612
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1227 place count 313 transition count 610
Iterating global reduction 7 with 1 rules applied. Total rules applied 1228 place count 313 transition count 610
Performed 146 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 7 with 292 rules applied. Total rules applied 1520 place count 167 transition count 377
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1536 place count 167 transition count 361
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1541 place count 162 transition count 354
Iterating global reduction 8 with 5 rules applied. Total rules applied 1546 place count 162 transition count 354
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1547 place count 161 transition count 349
Iterating global reduction 8 with 1 rules applied. Total rules applied 1548 place count 161 transition count 349
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1574 place count 148 transition count 334
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1589 place count 148 transition count 319
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1590 place count 147 transition count 315
Iterating global reduction 9 with 1 rules applied. Total rules applied 1591 place count 147 transition count 315
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 1593 place count 146 transition count 314
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1629 place count 128 transition count 348
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 1646 place count 128 transition count 331
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1655 place count 119 transition count 313
Iterating global reduction 10 with 9 rules applied. Total rules applied 1664 place count 119 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1670 place count 119 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 11 with 39 rules applied. Total rules applied 1709 place count 119 transition count 268
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1710 place count 119 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1711 place count 118 transition count 267
Applied a total of 1711 rules in 94 ms. Remains 118 /1560 variables (removed 1442) and now considering 267/1995 (removed 1728) transitions.
[2024-05-31 18:58:46] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 118 cols
[2024-05-31 18:58:46] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 18:58:46] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-31 18:58:46] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2024-05-31 18:58:46] [INFO ] Invariant cache hit.
[2024-05-31 18:58:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:58:46] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 430 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1560 places, 267/1995 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 114 transition count 265
Applied a total of 4 rules in 4 ms. Remains 114 /116 variables (removed 2) and now considering 265/267 (removed 2) transitions.
[2024-05-31 18:58:46] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 114 cols
[2024-05-31 18:58:46] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 18:58:46] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 18:58:46] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-31 18:58:46] [INFO ] Invariant cache hit.
[2024-05-31 18:58:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:58:46] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1560 places, 265/1995 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 688 ms. Remains : 114/1560 places, 265/1995 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-310-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-310-LTLFireability-11 finished in 903 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((X(G(p0))&&F((G(F(p1))||(F(p1)&&X(p2)))))))'
Support contains 1 out of 1560 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1543 transition count 1977
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1543 transition count 1977
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 1543 transition count 1975
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 1533 transition count 1964
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 1533 transition count 1964
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 1527 transition count 1958
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 1527 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 1527 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 74 place count 1522 transition count 1952
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 1522 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 1519 transition count 1949
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 1519 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 1516 transition count 1944
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 1516 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 1513 transition count 1939
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 1513 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 1510 transition count 1936
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 1510 transition count 1936
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 1509 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 1508 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 1506 transition count 1928
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 1506 transition count 1928
Applied a total of 113 rules in 651 ms. Remains 1506 /1560 variables (removed 54) and now considering 1928/1995 (removed 67) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-31 18:58:47] [INFO ] Computed 4 invariants in 12 ms
[2024-05-31 18:58:47] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-31 18:58:47] [INFO ] Invariant cache hit.
[2024-05-31 18:58:48] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-31 18:58:48] [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/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 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 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60591ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60610ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1560 places, 1928/1995 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62423 ms. Remains : 1506/1560 places, 1928/1995 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-13
Product exploration explored 100000 steps with 33216 reset in 322 ms.
Product exploration explored 100000 steps with 33478 reset in 304 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Detected a total of 27/1506 stabilizing places and 29/1928 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), true]
RANDOM walk for 40000 steps (299 resets) in 245 ms. (162 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (96 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2024-05-31 18:59:50] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 1/3434 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-310-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-310-LTLFireability-13 finished in 63894 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||G((p1&&X(p2)))||G(F(!p1))||(p3&&F(!p1))))))'
Support contains 3 out of 1560 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Graph (trivial) has 1897 edges and 1560 vertex of which 687 / 1560 are part of one of the 62 SCC in 2 ms
Free SCC test removed 625 places
Ensure Unique test removed 726 transitions
Reduce isomorphic transitions removed 726 transitions.
Graph (complete) has 1442 edges and 935 vertex of which 925 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 510 transitions
Trivial Post-agglo rules discarded 510 transitions
Performed 510 trivial Post agglomeration. Transition count delta: 510
Iterating post reduction 0 with 511 rules applied. Total rules applied 513 place count 924 transition count 751
Reduce places removed 510 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 536 rules applied. Total rules applied 1049 place count 414 transition count 725
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 1064 place count 401 transition count 723
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 1068 place count 400 transition count 720
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1071 place count 397 transition count 720
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 47 Pre rules applied. Total rules applied 1071 place count 397 transition count 673
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 1165 place count 350 transition count 673
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1180 place count 335 transition count 650
Iterating global reduction 5 with 15 rules applied. Total rules applied 1195 place count 335 transition count 650
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 5 with 2 rules applied. Total rules applied 1197 place count 335 transition count 648
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1199 place count 333 transition count 648
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1209 place count 323 transition count 635
Iterating global reduction 7 with 10 rules applied. Total rules applied 1219 place count 323 transition count 635
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1225 place count 323 transition count 629
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1228 place count 320 transition count 623
Iterating global reduction 8 with 3 rules applied. Total rules applied 1231 place count 320 transition count 623
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1234 place count 317 transition count 617
Iterating global reduction 8 with 3 rules applied. Total rules applied 1237 place count 317 transition count 617
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1239 place count 315 transition count 613
Iterating global reduction 8 with 2 rules applied. Total rules applied 1241 place count 315 transition count 613
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1243 place count 313 transition count 609
Iterating global reduction 8 with 2 rules applied. Total rules applied 1245 place count 313 transition count 609
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1246 place count 312 transition count 607
Iterating global reduction 8 with 1 rules applied. Total rules applied 1247 place count 312 transition count 607
Performed 146 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 8 with 292 rules applied. Total rules applied 1539 place count 166 transition count 380
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 1558 place count 166 transition count 361
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1563 place count 161 transition count 354
Iterating global reduction 9 with 5 rules applied. Total rules applied 1568 place count 161 transition count 354
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1569 place count 160 transition count 349
Iterating global reduction 9 with 1 rules applied. Total rules applied 1570 place count 160 transition count 349
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 1594 place count 148 transition count 335
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1608 place count 148 transition count 321
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 1644 place count 130 transition count 357
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 1662 place count 130 transition count 339
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1671 place count 121 transition count 321
Iterating global reduction 11 with 9 rules applied. Total rules applied 1680 place count 121 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1686 place count 121 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 12 with 38 rules applied. Total rules applied 1724 place count 121 transition count 277
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 1729 place count 121 transition count 277
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 1730 place count 121 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1731 place count 120 transition count 275
Applied a total of 1731 rules in 89 ms. Remains 120 /1560 variables (removed 1440) and now considering 275/1995 (removed 1720) transitions.
[2024-05-31 18:59:50] [INFO ] Flow matrix only has 219 transitions (discarded 56 similar events)
// Phase 1: matrix 219 rows 120 cols
[2024-05-31 18:59:50] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 18:59:50] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 18:59:50] [INFO ] Flow matrix only has 219 transitions (discarded 56 similar events)
[2024-05-31 18:59:50] [INFO ] Invariant cache hit.
[2024-05-31 18:59:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:59:51] [INFO ] Implicit Places using invariants and state equation in 288 ms returned [11, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 358 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1560 places, 275/1995 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 116 transition count 273
Applied a total of 4 rules in 7 ms. Remains 116 /118 variables (removed 2) and now considering 273/275 (removed 2) transitions.
[2024-05-31 18:59:51] [INFO ] Flow matrix only has 217 transitions (discarded 56 similar events)
// Phase 1: matrix 217 rows 116 cols
[2024-05-31 18:59:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 18:59:51] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 18:59:51] [INFO ] Flow matrix only has 217 transitions (discarded 56 similar events)
[2024-05-31 18:59:51] [INFO ] Invariant cache hit.
[2024-05-31 18:59:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:59:51] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1560 places, 273/1995 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 665 ms. Remains : 116/1560 places, 273/1995 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-14
Product exploration explored 100000 steps with 9662 reset in 133 ms.
Stuttering criterion allowed to conclude after 65512 steps with 6370 reset in 98 ms.
FORMULA CloudReconfiguration-PT-310-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-310-LTLFireability-14 finished in 993 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&&F(p1)))))'
Support contains 2 out of 1560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1560/1560 places, 1995/1995 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1544 transition count 1978
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1544 transition count 1978
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1544 transition count 1976
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 44 place count 1534 transition count 1965
Iterating global reduction 1 with 10 rules applied. Total rules applied 54 place count 1534 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 1528 transition count 1959
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 1528 transition count 1959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 1528 transition count 1958
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 1523 transition count 1953
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 1523 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 1520 transition count 1950
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 1520 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 1517 transition count 1945
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 1517 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 1514 transition count 1940
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 1514 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 1511 transition count 1937
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 1511 transition count 1937
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 1510 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 1509 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 1508 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 1507 transition count 1929
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 1507 transition count 1929
Applied a total of 111 rules in 637 ms. Remains 1507 /1560 variables (removed 53) and now considering 1929/1995 (removed 66) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2024-05-31 18:59:52] [INFO ] Computed 4 invariants in 11 ms
[2024-05-31 18:59:52] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-31 18:59:52] [INFO ] Invariant cache hit.
[2024-05-31 18:59:53] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-31 18:59:53] [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 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60543ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1560 places, 1929/1995 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62487 ms. Remains : 1507/1560 places, 1929/1995 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-310-LTLFireability-15
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-310-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-310-LTLFireability-15 finished in 62638 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(p0)||(p0&&G((p1&&F(!p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
[2024-05-31 19:00:54] [INFO ] Flatten gal took : 53 ms
[2024-05-31 19:00:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-31 19:00:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1560 places, 1995 transitions and 4163 arcs took 11 ms.
Total runtime 746583 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CloudReconfiguration-PT-310-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CloudReconfiguration-PT-310-LTLFireability-08

BK_STOP 1717183841136

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name CloudReconfiguration-PT-310-LTLFireability-05
ltl formula formula --ltl=/tmp/1556/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 1560 places, 1995 transitions and 4163 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.220 real 0.070 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1556/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1556/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1556/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1556/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1562 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1561, there are 2022 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( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~177!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 417
pnml2lts-mc( 0/ 4): unique states count: 2645
pnml2lts-mc( 0/ 4): unique transitions count: 5690
pnml2lts-mc( 0/ 4): - self-loop count: 51
pnml2lts-mc( 0/ 4): - claim dead count: 1091
pnml2lts-mc( 0/ 4): - claim found count: 1026
pnml2lts-mc( 0/ 4): - claim success count: 2687
pnml2lts-mc( 0/ 4): - cum. max stack depth: 852
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2687 states 5747 transitions, fanout: 2.139
pnml2lts-mc( 0/ 4): Total exploration time 0.270 sec (0.270 sec minimum, 0.270 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9952, Transitions per second: 21285
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 16.3 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2039 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name CloudReconfiguration-PT-310-LTLFireability-08
ltl formula formula --ltl=/tmp/1556/ltl_1_
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 1560 places, 1995 transitions and 4163 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.220 real 0.060 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1556/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1556/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1556/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1556/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 1561 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1561, there are 2052 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( 1/ 4): ~295 levels ~10000 states ~18012 transitions
pnml2lts-mc( 1/ 4): ~409 levels ~20000 states ~40068 transitions
pnml2lts-mc( 1/ 4): ~492 levels ~40000 states ~89480 transitions
pnml2lts-mc( 2/ 4): ~792 levels ~80000 states ~219176 transitions
pnml2lts-mc( 2/ 4): ~1682 levels ~160000 states ~477824 transitions
pnml2lts-mc( 2/ 4): ~1682 levels ~320000 states ~995012 transitions
pnml2lts-mc( 3/ 4): ~4829 levels ~640000 states ~2140916 transitions
pnml2lts-mc( 2/ 4): ~6605 levels ~1280000 states ~4238936 transitions
pnml2lts-mc( 3/ 4): ~5043 levels ~2560000 states ~8797576 transitions
pnml2lts-mc( 3/ 4): ~8154 levels ~5120000 states ~17603280 transitions
pnml2lts-mc( 3/ 4): ~23483 levels ~10240000 states ~35322592 transitions

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-310"
export BK_EXAMINATION="LTLFireability"
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-310, examination is LTLFireability"
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-171624188800188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-310.tgz
mv CloudReconfiguration-PT-310 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;