Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814480600020.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CloudReconfiguration-PT-303, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814480600020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 11:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 11:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 25 11:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K Mar 5 18:22 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-303-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-303-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678256837974

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-303
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 06:27:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 06:27:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:27:19] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-08 06:27:19] [INFO ] Transformed 2584 places.
[2023-03-08 06:27:19] [INFO ] Transformed 3094 transitions.
[2023-03-08 06:27:19] [INFO ] Found NUPN structural information;
[2023-03-08 06:27:19] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-303-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-303-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 516 places :
Symmetric choice reduction at 0 with 516 rule applications. Total rules 516 place count 2068 transition count 2578
Iterating global reduction 0 with 516 rules applied. Total rules applied 1032 place count 2068 transition count 2578
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1061 place count 2068 transition count 2549
Discarding 240 places :
Symmetric choice reduction at 1 with 240 rule applications. Total rules 1301 place count 1828 transition count 2309
Iterating global reduction 1 with 240 rules applied. Total rules applied 1541 place count 1828 transition count 2309
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 1631 place count 1738 transition count 2219
Iterating global reduction 1 with 90 rules applied. Total rules applied 1721 place count 1738 transition count 2219
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1739 place count 1738 transition count 2201
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1784 place count 1693 transition count 2156
Iterating global reduction 2 with 45 rules applied. Total rules applied 1829 place count 1693 transition count 2156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1838 place count 1693 transition count 2147
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1873 place count 1658 transition count 2108
Iterating global reduction 3 with 35 rules applied. Total rules applied 1908 place count 1658 transition count 2108
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1933 place count 1633 transition count 2083
Iterating global reduction 3 with 25 rules applied. Total rules applied 1958 place count 1633 transition count 2083
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1982 place count 1609 transition count 2059
Iterating global reduction 3 with 24 rules applied. Total rules applied 2006 place count 1609 transition count 2059
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2030 place count 1585 transition count 2035
Iterating global reduction 3 with 24 rules applied. Total rules applied 2054 place count 1585 transition count 2035
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 2074 place count 1565 transition count 2004
Iterating global reduction 3 with 20 rules applied. Total rules applied 2094 place count 1565 transition count 2004
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2101 place count 1558 transition count 1993
Iterating global reduction 3 with 7 rules applied. Total rules applied 2108 place count 1558 transition count 1993
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2114 place count 1552 transition count 1985
Iterating global reduction 3 with 6 rules applied. Total rules applied 2120 place count 1552 transition count 1985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2121 place count 1552 transition count 1984
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2123 place count 1550 transition count 1982
Iterating global reduction 4 with 2 rules applied. Total rules applied 2125 place count 1550 transition count 1982
Applied a total of 2125 rules in 2020 ms. Remains 1550 /2584 variables (removed 1034) and now considering 1982/3094 (removed 1112) transitions.
// Phase 1: matrix 1982 rows 1550 cols
[2023-03-08 06:27:22] [INFO ] Computed 4 place invariants in 42 ms
[2023-03-08 06:27:22] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-08 06:27:22] [INFO ] Invariant cache hit.
[2023-03-08 06:27:23] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned [1539]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1561 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1549/2584 places, 1982/3094 transitions.
Applied a total of 0 rules in 47 ms. Remains 1549 /1549 variables (removed 0) and now considering 1982/1982 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3628 ms. Remains : 1549/2584 places, 1982/3094 transitions.
Support contains 37 out of 1549 places after structural reductions.
[2023-03-08 06:27:24] [INFO ] Flatten gal took : 131 ms
[2023-03-08 06:27:24] [INFO ] Flatten gal took : 71 ms
[2023-03-08 06:27:24] [INFO ] Input system was already deterministic with 1982 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 33) seen :7
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 1982 rows 1549 cols
[2023-03-08 06:27:25] [INFO ] Computed 3 place invariants in 18 ms
[2023-03-08 06:27:25] [INFO ] After 856ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-08 06:27:26] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-08 06:27:29] [INFO ] After 2369ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :24
[2023-03-08 06:27:32] [INFO ] After 5114ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :24
Attempting to minimize the solution found.
Minimization took 1536 ms.
[2023-03-08 06:27:34] [INFO ] After 8079ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :24
Fused 25 Parikh solutions to 23 different solutions.
Parikh walk visited 6 properties in 265 ms.
Support contains 21 out of 1549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Graph (trivial) has 1849 edges and 1549 vertex of which 657 / 1549 are part of one of the 61 SCC in 7 ms
Free SCC test removed 596 places
Drop transitions removed 746 transitions
Reduce isomorphic transitions removed 746 transitions.
Graph (complete) has 1406 edges and 953 vertex of which 945 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 510 rules applied. Total rules applied 512 place count 945 transition count 722
Reduce places removed 504 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 563 rules applied. Total rules applied 1075 place count 441 transition count 663
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 41 rules applied. Total rules applied 1116 place count 403 transition count 660
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 1119 place count 402 transition count 658
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 4 with 10 rules applied. Total rules applied 1129 place count 401 transition count 649
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 12 rules applied. Total rules applied 1141 place count 392 transition count 646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1142 place count 391 transition count 646
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 46 Pre rules applied. Total rules applied 1142 place count 391 transition count 600
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 7 with 92 rules applied. Total rules applied 1234 place count 345 transition count 600
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1243 place count 336 transition count 588
Iterating global reduction 7 with 9 rules applied. Total rules applied 1252 place count 336 transition count 588
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 1254 place count 336 transition count 586
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1256 place count 334 transition count 586
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1262 place count 328 transition count 580
Iterating global reduction 9 with 6 rules applied. Total rules applied 1268 place count 328 transition count 580
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1274 place count 328 transition count 574
Performed 162 Post agglomeration using F-continuation condition with reduction of 89 identical transitions.
Deduced a syphon composed of 162 places in 1 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 10 with 324 rules applied. Total rules applied 1598 place count 166 transition count 323
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 1624 place count 166 transition count 297
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1627 place count 163 transition count 294
Iterating global reduction 11 with 3 rules applied. Total rules applied 1630 place count 163 transition count 294
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 11 with 24 rules applied. Total rules applied 1654 place count 151 transition count 280
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1668 place count 151 transition count 266
Performed 37 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 12 with 74 rules applied. Total rules applied 1742 place count 114 transition count 299
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 12 with 30 rules applied. Total rules applied 1772 place count 114 transition count 269
Discarding 19 places :
Symmetric choice reduction at 13 with 19 rule applications. Total rules 1791 place count 95 transition count 231
Iterating global reduction 13 with 19 rules applied. Total rules applied 1810 place count 95 transition count 231
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1820 place count 95 transition count 221
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1823 place count 92 transition count 215
Iterating global reduction 14 with 3 rules applied. Total rules applied 1826 place count 92 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1828 place count 92 transition count 213
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 15 with 12 rules applied. Total rules applied 1840 place count 92 transition count 201
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 1845 place count 92 transition count 196
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1850 place count 87 transition count 196
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1851 place count 87 transition count 195
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 16 with 10 rules applied. Total rules applied 1861 place count 87 transition count 195
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1862 place count 87 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1863 place count 86 transition count 193
Applied a total of 1863 rules in 163 ms. Remains 86 /1549 variables (removed 1463) and now considering 193/1982 (removed 1789) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 86/1549 places, 193/1982 transitions.
Incomplete random walk after 10000 steps, including 1106 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 18) seen :15
Incomplete Best-First random walk after 10001 steps, including 268 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 252 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-08 06:27:34] [INFO ] Flow matrix only has 181 transitions (discarded 12 similar events)
// Phase 1: matrix 181 rows 86 cols
[2023-03-08 06:27:34] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-08 06:27:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 06:27:34] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-08 06:27:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-08 06:27:34] [INFO ] After 15ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 06:27:34] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 06:27:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 06:27:34] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 06:27:34] [INFO ] After 12ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 06:27:34] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 06:27:34] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 193/193 transitions.
Graph (trivial) has 51 edges and 86 vertex of which 12 / 86 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 80 transition count 170
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 70 transition count 170
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 21 place count 70 transition count 167
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 67 transition count 167
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 64 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 64 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 64 transition count 161
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 44 place count 59 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 48 place count 59 transition count 152
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 50 place count 57 transition count 148
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 57 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 57 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 57 place count 55 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 62 place count 55 transition count 141
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 6 with 2 rules applied. Total rules applied 64 place count 54 transition count 140
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 68 place count 54 transition count 136
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 69 place count 53 transition count 135
Iterating global reduction 7 with 1 rules applied. Total rules applied 70 place count 53 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 71 place count 53 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 83 place count 53 transition count 122
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 85 place count 51 transition count 118
Iterating global reduction 8 with 2 rules applied. Total rules applied 87 place count 51 transition count 118
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 88 place count 50 transition count 117
Iterating global reduction 8 with 1 rules applied. Total rules applied 89 place count 50 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 90 place count 50 transition count 116
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 91 place count 50 transition count 115
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 94 place count 50 transition count 112
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 98 place count 47 transition count 111
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 100 place count 47 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 102 place count 47 transition count 109
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 103 place count 46 transition count 108
Iterating global reduction 11 with 1 rules applied. Total rules applied 104 place count 46 transition count 108
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 105 place count 46 transition count 107
Applied a total of 105 rules in 50 ms. Remains 46 /86 variables (removed 40) and now considering 107/193 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 46/86 places, 107/193 transitions.
Incomplete random walk after 10000 steps, including 199 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Probably explored full state space saw : 2448 states, properties seen :0
Probabilistic random walk after 10118 steps, saw 2448 distinct states, run finished after 44 ms. (steps per millisecond=229 ) properties seen :0
Explored full state space saw : 2448 states, properties seen :0
Exhaustive walk after 10118 steps, saw 2448 distinct states, run finished after 29 ms. (steps per millisecond=348 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CloudReconfiguration-PT-303-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2157 edges and 1549 vertex of which 1541 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.26 ms
FORMULA CloudReconfiguration-PT-303-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1533 transition count 1965
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1533 transition count 1965
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 1524 transition count 1954
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 1524 transition count 1954
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 1519 transition count 1948
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 1519 transition count 1948
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1515 transition count 1944
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1515 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 1515 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 1512 transition count 1940
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 1512 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 1509 transition count 1936
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 1509 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 1507 transition count 1933
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1507 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 1505 transition count 1929
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 1505 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 1504 transition count 1928
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 1504 transition count 1928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 1504 transition count 1927
Applied a total of 92 rules in 424 ms. Remains 1504 /1549 variables (removed 45) and now considering 1927/1982 (removed 55) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2023-03-08 06:27:36] [INFO ] Computed 3 place invariants in 19 ms
[2023-03-08 06:27:36] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-08 06:27:36] [INFO ] Invariant cache hit.
[2023-03-08 06:27:37] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2023-03-08 06:27:37] [INFO ] Invariant cache hit.
[2023-03-08 06:27:38] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1504/1549 places, 1927/1982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2364 ms. Remains : 1504/1549 places, 1927/1982 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s864 0) (EQ s1175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 645 ms.
Product exploration explored 100000 steps with 25000 reset in 553 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2100 edges and 1504 vertex of which 1496 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.11 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 99 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 394274 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394274 steps, saw 96878 distinct states, run finished after 3002 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 06:27:42] [INFO ] Invariant cache hit.
[2023-03-08 06:27:43] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 06:27:43] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 15 ms returned sat
[2023-03-08 06:27:43] [INFO ] After 688ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 06:27:44] [INFO ] After 795ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-08 06:27:44] [INFO ] After 1046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 122 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=122 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1504/1504 places, 1927/1927 transitions.
Applied a total of 0 rules in 45 ms. Remains 1504 /1504 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
[2023-03-08 06:27:44] [INFO ] Invariant cache hit.
[2023-03-08 06:27:44] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-08 06:27:44] [INFO ] Invariant cache hit.
[2023-03-08 06:27:45] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2023-03-08 06:27:45] [INFO ] Invariant cache hit.
[2023-03-08 06:27:46] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2039 ms. Remains : 1504/1504 places, 1927/1927 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2100 edges and 1504 vertex of which 1496 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 121 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 396979 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 396979 steps, saw 96959 distinct states, run finished after 3002 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 06:27:49] [INFO ] Invariant cache hit.
[2023-03-08 06:27:50] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 06:27:50] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 16 ms returned sat
[2023-03-08 06:27:51] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 06:27:51] [INFO ] After 806ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-08 06:27:51] [INFO ] After 1077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 123 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=123 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 490 ms.
Product exploration explored 100000 steps with 25000 reset in 490 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1504/1504 places, 1927/1927 transitions.
Graph (trivial) has 1835 edges and 1504 vertex of which 681 / 1504 are part of one of the 62 SCC in 2 ms
Free SCC test removed 619 places
Ensure Unique test removed 719 transitions
Reduce isomorphic transitions removed 719 transitions.
Graph (complete) has 1375 edges and 885 vertex of which 877 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions 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 877 transition count 1203
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 877 transition count 1191
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 491 place count 877 transition count 1203
Deduced a syphon composed of 499 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 513 place count 877 transition count 1203
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 796 place count 594 transition count 910
Deduced a syphon composed of 232 places in 0 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1079 place count 594 transition count 910
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1091 place count 582 transition count 894
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1103 place count 582 transition count 894
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1109 place count 582 transition count 888
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1121 place count 570 transition count 876
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1133 place count 570 transition count 876
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1135 place count 568 transition count 872
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 568 transition count 872
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1139 place count 566 transition count 868
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1141 place count 566 transition count 868
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1145 place count 562 transition count 864
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1149 place count 562 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 560 transition count 860
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 560 transition count 860
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1155 place count 558 transition count 856
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1157 place count 558 transition count 856
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1161 place count 554 transition count 850
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1165 place count 554 transition count 850
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1169 place count 550 transition count 834
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1173 place count 550 transition count 834
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1174 place count 550 transition count 834
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1178 place count 546 transition count 830
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1182 place count 546 transition count 830
Performed 107 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 320 places in 0 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1289 place count 546 transition count 905
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1328 place count 546 transition count 866
Discarding 101 places :
Symmetric choice reduction at 5 with 101 rule applications. Total rules 1429 place count 445 transition count 755
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 5 with 101 rules applied. Total rules applied 1530 place count 445 transition count 755
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1536 place count 439 transition count 746
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1542 place count 439 transition count 746
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1549 place count 439 transition count 746
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1553 place count 439 transition count 742
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1568 place count 424 transition count 723
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1583 place count 424 transition count 723
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1589 place count 424 transition count 717
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1593 place count 420 transition count 713
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1597 place count 420 transition count 713
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1600 place count 420 transition count 713
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1606 place count 420 transition count 707
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1609 place count 417 transition count 704
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1612 place count 417 transition count 704
Performed 72 Post agglomeration using F-continuation condition with reduction of 121 identical transitions.
Deduced a syphon composed of 287 places in 0 ms
Iterating global reduction 8 with 72 rules applied. Total rules applied 1684 place count 417 transition count 1023
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 1805 place count 417 transition count 902
Discarding 127 places :
Symmetric choice reduction at 9 with 127 rule applications. Total rules 1932 place count 290 transition count 569
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 9 with 127 rules applied. Total rules applied 2059 place count 290 transition count 569
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2074 place count 290 transition count 554
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2101 place count 263 transition count 497
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2128 place count 263 transition count 497
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2131 place count 263 transition count 545
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2134 place count 260 transition count 518
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2137 place count 260 transition count 518
Deduced a syphon composed of 142 places in 0 ms
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 10 with 48 rules applied. Total rules applied 2185 place count 260 transition count 470
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2190 place count 255 transition count 465
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 10 with 5 rules applied. Total rules applied 2195 place count 255 transition count 465
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2197 place count 255 transition count 505
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2199 place count 253 transition count 495
Deduced a syphon composed of 137 places in 1 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2201 place count 253 transition count 495
Deduced a syphon composed of 137 places in 0 ms
Applied a total of 2201 rules in 585 ms. Remains 253 /1504 variables (removed 1251) and now considering 495/1927 (removed 1432) transitions.
[2023-03-08 06:27:53] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-08 06:27:53] [INFO ] Flow matrix only has 441 transitions (discarded 54 similar events)
// Phase 1: matrix 441 rows 253 cols
[2023-03-08 06:27:53] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-08 06:27:54] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/1504 places, 495/1927 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 985 ms. Remains : 253/1504 places, 495/1927 transitions.
Support contains 2 out of 1504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1504/1504 places, 1927/1927 transitions.
Applied a total of 0 rules in 47 ms. Remains 1504 /1504 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2023-03-08 06:27:54] [INFO ] Computed 3 place invariants in 17 ms
[2023-03-08 06:27:54] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-08 06:27:54] [INFO ] Invariant cache hit.
[2023-03-08 06:27:55] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2023-03-08 06:27:55] [INFO ] Invariant cache hit.
[2023-03-08 06:27:56] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2017 ms. Remains : 1504/1504 places, 1927/1927 transitions.
Treatment of property CloudReconfiguration-PT-303-LTLFireability-00 finished in 20628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))&&F((p2&&X(p3)))))'
Support contains 4 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1534 transition count 1967
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1534 transition count 1967
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 1526 transition count 1957
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 1526 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1521 transition count 1951
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1521 transition count 1951
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1517 transition count 1947
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1517 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 1517 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 1514 transition count 1943
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 1514 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 1511 transition count 1939
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 1511 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 1509 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 1509 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 1507 transition count 1932
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1507 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1506 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1506 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 1506 transition count 1930
Applied a total of 88 rules in 452 ms. Remains 1506 /1549 variables (removed 43) and now considering 1930/1982 (removed 52) transitions.
// Phase 1: matrix 1930 rows 1506 cols
[2023-03-08 06:27:56] [INFO ] Computed 3 place invariants in 10 ms
[2023-03-08 06:27:57] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-08 06:27:57] [INFO ] Invariant cache hit.
[2023-03-08 06:27:58] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
[2023-03-08 06:27:58] [INFO ] Invariant cache hit.
[2023-03-08 06:27:58] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1549 places, 1930/1982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2507 ms. Remains : 1506/1549 places, 1930/1982 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s986 0), p2:(NEQ s171 1), p1:(EQ s1037 0), p3:(NEQ s1326 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 912 ms.
Product exploration explored 100000 steps with 50000 reset in 957 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2103 edges and 1506 vertex of which 1498 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p2 p1 p3), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p1), (X p2), (X (NOT (AND p2 (NOT p3)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1)), (X (X p2)), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p2 p1 p3)
Knowledge based reduction with 13 factoid took 365 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-303-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-303-LTLFireability-01 finished in 5053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Graph (trivial) has 1892 edges and 1549 vertex of which 695 / 1549 are part of one of the 64 SCC in 3 ms
Free SCC test removed 631 places
Ensure Unique test removed 731 transitions
Reduce isomorphic transitions removed 731 transitions.
Graph (complete) has 1420 edges and 918 vertex of which 910 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 506 place count 909 transition count 741
Reduce places removed 504 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 530 rules applied. Total rules applied 1036 place count 405 transition count 715
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1049 place count 392 transition count 715
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1049 place count 392 transition count 670
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1139 place count 347 transition count 670
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1158 place count 328 transition count 640
Iterating global reduction 3 with 19 rules applied. Total rules applied 1177 place count 328 transition count 640
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 1181 place count 328 transition count 636
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1184 place count 325 transition count 636
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1195 place count 314 transition count 620
Iterating global reduction 5 with 11 rules applied. Total rules applied 1206 place count 314 transition count 620
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1212 place count 314 transition count 614
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1215 place count 311 transition count 608
Iterating global reduction 6 with 3 rules applied. Total rules applied 1218 place count 311 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1219 place count 311 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1221 place count 309 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1223 place count 309 transition count 603
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1225 place count 307 transition count 599
Iterating global reduction 7 with 2 rules applied. Total rules applied 1227 place count 307 transition count 599
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1229 place count 305 transition count 595
Iterating global reduction 7 with 2 rules applied. Total rules applied 1231 place count 305 transition count 595
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1233 place count 303 transition count 591
Iterating global reduction 7 with 2 rules applied. Total rules applied 1235 place count 303 transition count 591
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1236 place count 302 transition count 584
Iterating global reduction 7 with 1 rules applied. Total rules applied 1237 place count 302 transition count 584
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1238 place count 302 transition count 583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1239 place count 301 transition count 583
Performed 142 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 9 with 284 rules applied. Total rules applied 1523 place count 159 transition count 359
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1535 place count 159 transition count 347
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1540 place count 154 transition count 340
Iterating global reduction 10 with 5 rules applied. Total rules applied 1545 place count 154 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1546 place count 154 transition count 339
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1570 place count 142 transition count 325
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1582 place count 142 transition count 313
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1583 place count 141 transition count 309
Iterating global reduction 12 with 1 rules applied. Total rules applied 1584 place count 141 transition count 309
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 12 with 2 rules applied. Total rules applied 1586 place count 140 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1588 place count 140 transition count 306
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 13 with 34 rules applied. Total rules applied 1622 place count 123 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 1639 place count 123 transition count 323
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1648 place count 114 transition count 305
Iterating global reduction 14 with 9 rules applied. Total rules applied 1657 place count 114 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1663 place count 114 transition count 299
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 15 with 36 rules applied. Total rules applied 1699 place count 114 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1700 place count 113 transition count 262
Applied a total of 1700 rules in 100 ms. Remains 113 /1549 variables (removed 1436) and now considering 262/1982 (removed 1720) transitions.
[2023-03-08 06:28:01] [INFO ] Flow matrix only has 204 transitions (discarded 58 similar events)
// Phase 1: matrix 204 rows 113 cols
[2023-03-08 06:28:01] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 06:28:01] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 06:28:01] [INFO ] Flow matrix only has 204 transitions (discarded 58 similar events)
[2023-03-08 06:28:01] [INFO ] Invariant cache hit.
[2023-03-08 06:28:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 06:28:01] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [42, 43, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 171 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/1549 places, 262/1982 transitions.
Reduce places removed 1 places and 1 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 107 transition count 259
Applied a total of 4 rules in 6 ms. Remains 107 /110 variables (removed 3) and now considering 259/262 (removed 3) transitions.
[2023-03-08 06:28:01] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
// Phase 1: matrix 201 rows 107 cols
[2023-03-08 06:28:01] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-08 06:28:01] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 06:28:01] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2023-03-08 06:28:01] [INFO ] Invariant cache hit.
[2023-03-08 06:28:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 06:28:01] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/1549 places, 259/1982 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 412 ms. Remains : 107/1549 places, 259/1982 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-02 finished in 500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!p0)) U (p1&&X(G(!p0))))))'
Support contains 3 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1535 transition count 1967
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1535 transition count 1967
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1528 transition count 1959
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1528 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 1524 transition count 1955
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1524 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 1521 transition count 1952
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 1521 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 1518 transition count 1949
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 1518 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1515 transition count 1945
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1515 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1513 transition count 1942
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1513 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 1511 transition count 1938
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 1511 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1510 transition count 1937
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1510 transition count 1937
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 79 place count 1510 transition count 1936
Applied a total of 79 rules in 464 ms. Remains 1510 /1549 variables (removed 39) and now considering 1936/1982 (removed 46) transitions.
// Phase 1: matrix 1936 rows 1510 cols
[2023-03-08 06:28:02] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-08 06:28:02] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-08 06:28:02] [INFO ] Invariant cache hit.
[2023-03-08 06:28:03] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
[2023-03-08 06:28:03] [INFO ] Invariant cache hit.
[2023-03-08 06:28:04] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1549 places, 1936/1982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2485 ms. Remains : 1510/1549 places, 1936/1982 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1253 1), p0:(AND (EQ s279 1) (EQ s995 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1092 reset in 168 ms.
Product exploration explored 100000 steps with 1066 reset in 238 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2110 edges and 1510 vertex of which 1502 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 423 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Incomplete random walk after 10000 steps, including 116 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-08 06:28:05] [INFO ] Invariant cache hit.
[2023-03-08 06:28:05] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 17 ms returned sat
[2023-03-08 06:28:06] [INFO ] After 676ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 06:28:06] [INFO ] After 795ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-08 06:28:06] [INFO ] After 1114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 89 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=89 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
[2023-03-08 06:28:07] [INFO ] Invariant cache hit.
[2023-03-08 06:28:07] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-08 06:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:08] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2023-03-08 06:28:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:28:09] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-08 06:28:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:10] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2023-03-08 06:28:10] [INFO ] Computed and/alt/rep : 1929/2358/1929 causal constraints (skipped 6 transitions) in 102 ms.
[2023-03-08 06:28:23] [INFO ] Added : 725 causal constraints over 145 iterations in 13631 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1936/1936 transitions.
Applied a total of 0 rules in 42 ms. Remains 1510 /1510 variables (removed 0) and now considering 1936/1936 (removed 0) transitions.
[2023-03-08 06:28:23] [INFO ] Invariant cache hit.
[2023-03-08 06:28:24] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-08 06:28:24] [INFO ] Invariant cache hit.
[2023-03-08 06:28:25] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2023-03-08 06:28:25] [INFO ] Invariant cache hit.
[2023-03-08 06:28:25] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2124 ms. Remains : 1510/1510 places, 1936/1936 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2110 edges and 1510 vertex of which 1502 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 337791 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 337791 steps, saw 85917 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 06:28:29] [INFO ] Invariant cache hit.
[2023-03-08 06:28:29] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 19 ms returned sat
[2023-03-08 06:28:30] [INFO ] After 826ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-08 06:28:30] [INFO ] After 948ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 06:28:30] [INFO ] After 1233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 06:28:30] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 16 ms returned sat
[2023-03-08 06:28:31] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 06:28:31] [INFO ] After 1007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-08 06:28:32] [INFO ] After 1410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1936/1936 transitions.
Graph (trivial) has 1841 edges and 1510 vertex of which 689 / 1510 are part of one of the 63 SCC in 2 ms
Free SCC test removed 626 places
Drop transitions removed 791 transitions
Reduce isomorphic transitions removed 791 transitions.
Graph (complete) has 1314 edges and 884 vertex of which 876 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 876 transition count 646
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 549 rules applied. Total rules applied 1046 place count 387 transition count 586
Reduce places removed 39 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 42 rules applied. Total rules applied 1088 place count 348 transition count 583
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1091 place count 345 transition count 583
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1091 place count 345 transition count 533
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1191 place count 295 transition count 533
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1202 place count 284 transition count 517
Iterating global reduction 4 with 11 rules applied. Total rules applied 1213 place count 284 transition count 517
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1216 place count 284 transition count 514
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1219 place count 281 transition count 514
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1227 place count 273 transition count 504
Iterating global reduction 6 with 8 rules applied. Total rules applied 1235 place count 273 transition count 504
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1241 place count 273 transition count 498
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1243 place count 271 transition count 486
Iterating global reduction 7 with 2 rules applied. Total rules applied 1245 place count 271 transition count 486
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1246 place count 271 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1247 place count 270 transition count 485
Performed 143 Post agglomeration using F-continuation condition with reduction of 98 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 9 with 286 rules applied. Total rules applied 1533 place count 127 transition count 244
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 13 rules applied. Total rules applied 1546 place count 127 transition count 231
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1548 place count 126 transition count 230
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1551 place count 123 transition count 227
Iterating global reduction 11 with 3 rules applied. Total rules applied 1554 place count 123 transition count 227
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1580 place count 110 transition count 211
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1592 place count 110 transition count 199
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 12 with 66 rules applied. Total rules applied 1658 place count 77 transition count 232
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 12 with 27 rules applied. Total rules applied 1685 place count 77 transition count 205
Discarding 20 places :
Symmetric choice reduction at 13 with 20 rule applications. Total rules 1705 place count 57 transition count 165
Iterating global reduction 13 with 20 rules applied. Total rules applied 1725 place count 57 transition count 165
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 13 with 11 rules applied. Total rules applied 1736 place count 57 transition count 154
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1742 place count 51 transition count 142
Iterating global reduction 14 with 6 rules applied. Total rules applied 1748 place count 51 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1754 place count 51 transition count 136
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1755 place count 51 transition count 135
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1756 place count 51 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1757 place count 50 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1758 place count 50 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1759 place count 49 transition count 133
Applied a total of 1759 rules in 45 ms. Remains 49 /1510 variables (removed 1461) and now considering 133/1936 (removed 1803) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 49/1510 places, 133/1936 transitions.
Finished random walk after 3807 steps, including 505 resets, run visited all 2 properties in 13 ms. (steps per millisecond=292 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 235 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
[2023-03-08 06:28:32] [INFO ] Invariant cache hit.
[2023-03-08 06:28:33] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-08 06:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:34] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2023-03-08 06:28:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:28:34] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 10 ms returned sat
[2023-03-08 06:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:28:35] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2023-03-08 06:28:35] [INFO ] Computed and/alt/rep : 1929/2358/1929 causal constraints (skipped 6 transitions) in 89 ms.
[2023-03-08 06:28:49] [INFO ] Added : 725 causal constraints over 145 iterations in 13691 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Product exploration explored 100000 steps with 1064 reset in 133 ms.
Product exploration explored 100000 steps with 1071 reset in 133 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1510/1510 places, 1936/1936 transitions.
Graph (trivial) has 1841 edges and 1510 vertex of which 689 / 1510 are part of one of the 63 SCC in 2 ms
Free SCC test removed 626 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1377 edges and 884 vertex of which 876 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 479 place count 876 transition count 1204
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 876 transition count 1192
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 491 place count 876 transition count 1204
Deduced a syphon composed of 499 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 513 place count 876 transition count 1204
Discarding 285 places :
Symmetric choice reduction at 2 with 285 rule applications. Total rules 798 place count 591 transition count 909
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 2 with 285 rules applied. Total rules applied 1083 place count 591 transition count 909
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1095 place count 579 transition count 893
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1107 place count 579 transition count 893
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1113 place count 579 transition count 887
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1125 place count 567 transition count 875
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1137 place count 567 transition count 875
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1139 place count 565 transition count 871
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1141 place count 565 transition count 871
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1143 place count 563 transition count 867
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1145 place count 563 transition count 867
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1149 place count 559 transition count 863
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1153 place count 559 transition count 863
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1155 place count 557 transition count 859
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1157 place count 557 transition count 859
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1159 place count 555 transition count 855
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1161 place count 555 transition count 855
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 551 transition count 849
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 551 transition count 849
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1173 place count 547 transition count 833
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1177 place count 547 transition count 833
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1178 place count 547 transition count 833
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1182 place count 543 transition count 829
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1186 place count 543 transition count 829
Performed 104 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 315 places in 0 ms
Iterating global reduction 4 with 104 rules applied. Total rules applied 1290 place count 543 transition count 906
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1329 place count 543 transition count 867
Discarding 98 places :
Symmetric choice reduction at 5 with 98 rule applications. Total rules 1427 place count 445 transition count 759
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 98 rules applied. Total rules applied 1525 place count 445 transition count 759
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1531 place count 439 transition count 750
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1537 place count 439 transition count 750
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1544 place count 439 transition count 750
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1548 place count 439 transition count 746
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1563 place count 424 transition count 727
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1578 place count 424 transition count 727
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1584 place count 424 transition count 721
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1588 place count 420 transition count 717
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1592 place count 420 transition count 717
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1595 place count 420 transition count 717
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1601 place count 420 transition count 711
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1604 place count 417 transition count 708
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1607 place count 417 transition count 708
Performed 72 Post agglomeration using F-continuation condition with reduction of 111 identical transitions.
Deduced a syphon composed of 285 places in 0 ms
Iterating global reduction 8 with 72 rules applied. Total rules applied 1679 place count 417 transition count 1031
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 8 with 122 rules applied. Total rules applied 1801 place count 417 transition count 909
Discarding 126 places :
Symmetric choice reduction at 9 with 126 rule applications. Total rules 1927 place count 291 transition count 580
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 9 with 126 rules applied. Total rules applied 2053 place count 291 transition count 580
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2068 place count 291 transition count 565
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2095 place count 264 transition count 507
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2122 place count 264 transition count 507
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2125 place count 264 transition count 551
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2129 place count 264 transition count 547
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2133 place count 260 transition count 519
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2137 place count 260 transition count 519
Deduced a syphon composed of 140 places in 0 ms
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 11 with 48 rules applied. Total rules applied 2185 place count 260 transition count 471
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2189 place count 256 transition count 467
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2193 place count 256 transition count 467
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2196 place count 256 transition count 527
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2199 place count 253 transition count 512
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2202 place count 253 transition count 512
Deduced a syphon composed of 136 places in 0 ms
Applied a total of 2202 rules in 204 ms. Remains 253 /1510 variables (removed 1257) and now considering 512/1936 (removed 1424) transitions.
[2023-03-08 06:28:50] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-08 06:28:50] [INFO ] Flow matrix only has 455 transitions (discarded 57 similar events)
// Phase 1: matrix 455 rows 253 cols
[2023-03-08 06:28:50] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-08 06:28:50] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/1510 places, 512/1936 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 534 ms. Remains : 253/1510 places, 512/1936 transitions.
Support contains 3 out of 1510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1510/1510 places, 1936/1936 transitions.
Applied a total of 0 rules in 40 ms. Remains 1510 /1510 variables (removed 0) and now considering 1936/1936 (removed 0) transitions.
// Phase 1: matrix 1936 rows 1510 cols
[2023-03-08 06:28:50] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-08 06:28:50] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-08 06:28:50] [INFO ] Invariant cache hit.
[2023-03-08 06:28:51] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
[2023-03-08 06:28:51] [INFO ] Invariant cache hit.
[2023-03-08 06:28:52] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2180 ms. Remains : 1510/1510 places, 1936/1936 transitions.
Treatment of property CloudReconfiguration-PT-303-LTLFireability-03 finished in 50853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Graph (trivial) has 1891 edges and 1549 vertex of which 691 / 1549 are part of one of the 63 SCC in 1 ms
Free SCC test removed 628 places
Ensure Unique test removed 728 transitions
Reduce isomorphic transitions removed 728 transitions.
Graph (complete) has 1423 edges and 921 vertex of which 913 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 506 place count 912 transition count 744
Reduce places removed 504 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 532 rules applied. Total rules applied 1038 place count 408 transition count 716
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1052 place count 394 transition count 716
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1052 place count 394 transition count 671
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1142 place count 349 transition count 671
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1161 place count 330 transition count 641
Iterating global reduction 3 with 19 rules applied. Total rules applied 1180 place count 330 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 1184 place count 330 transition count 637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1187 place count 327 transition count 637
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1198 place count 316 transition count 621
Iterating global reduction 5 with 11 rules applied. Total rules applied 1209 place count 316 transition count 621
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1215 place count 316 transition count 615
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1218 place count 313 transition count 609
Iterating global reduction 6 with 3 rules applied. Total rules applied 1221 place count 313 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1222 place count 313 transition count 608
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1224 place count 311 transition count 604
Iterating global reduction 7 with 2 rules applied. Total rules applied 1226 place count 311 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1228 place count 309 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1230 place count 309 transition count 600
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1232 place count 307 transition count 596
Iterating global reduction 7 with 2 rules applied. Total rules applied 1234 place count 307 transition count 596
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1236 place count 305 transition count 592
Iterating global reduction 7 with 2 rules applied. Total rules applied 1238 place count 305 transition count 592
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1239 place count 304 transition count 585
Iterating global reduction 7 with 1 rules applied. Total rules applied 1240 place count 304 transition count 585
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1241 place count 304 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1242 place count 303 transition count 584
Performed 143 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 9 with 286 rules applied. Total rules applied 1528 place count 160 transition count 359
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1540 place count 160 transition count 347
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1545 place count 155 transition count 340
Iterating global reduction 10 with 5 rules applied. Total rules applied 1550 place count 155 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1551 place count 155 transition count 339
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1575 place count 143 transition count 325
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1587 place count 143 transition count 313
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1588 place count 142 transition count 309
Iterating global reduction 12 with 1 rules applied. Total rules applied 1589 place count 142 transition count 309
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 12 with 2 rules applied. Total rules applied 1591 place count 141 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1593 place count 141 transition count 306
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 13 with 34 rules applied. Total rules applied 1627 place count 124 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 1644 place count 124 transition count 323
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1653 place count 115 transition count 305
Iterating global reduction 14 with 9 rules applied. Total rules applied 1662 place count 115 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1668 place count 115 transition count 299
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 15 with 36 rules applied. Total rules applied 1704 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1705 place count 114 transition count 262
Applied a total of 1705 rules in 81 ms. Remains 114 /1549 variables (removed 1435) and now considering 262/1982 (removed 1720) transitions.
[2023-03-08 06:28:52] [INFO ] Flow matrix only has 206 transitions (discarded 56 similar events)
// Phase 1: matrix 206 rows 114 cols
[2023-03-08 06:28:52] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 06:28:53] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-08 06:28:53] [INFO ] Flow matrix only has 206 transitions (discarded 56 similar events)
[2023-03-08 06:28:53] [INFO ] Invariant cache hit.
[2023-03-08 06:28:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 06:28:53] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [41, 42, 75]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 465 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/1549 places, 262/1982 transitions.
Reduce places removed 1 places and 1 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 108 transition count 259
Applied a total of 4 rules in 5 ms. Remains 108 /111 variables (removed 3) and now considering 259/262 (removed 3) transitions.
[2023-03-08 06:28:53] [INFO ] Flow matrix only has 203 transitions (discarded 56 similar events)
// Phase 1: matrix 203 rows 108 cols
[2023-03-08 06:28:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 06:28:53] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 06:28:53] [INFO ] Flow matrix only has 203 transitions (discarded 56 similar events)
[2023-03-08 06:28:53] [INFO ] Invariant cache hit.
[2023-03-08 06:28:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 06:28:53] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/1549 places, 259/1982 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 702 ms. Remains : 108/1549 places, 259/1982 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s3 1) (NEQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 325 steps with 38 reset in 5 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-04 finished in 756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(X(p0))||(p1&&G(p2))) U p3))))'
Support contains 5 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1536 transition count 1968
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1536 transition count 1968
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 1528 transition count 1958
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1528 transition count 1958
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 1524 transition count 1953
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1524 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 1521 transition count 1950
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 1521 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1521 transition count 1949
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1519 transition count 1947
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1519 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1517 transition count 1944
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1517 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1516 transition count 1942
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1516 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1515 transition count 1940
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1515 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1514 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1514 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 1514 transition count 1938
Applied a total of 72 rules in 461 ms. Remains 1514 /1549 variables (removed 35) and now considering 1938/1982 (removed 44) transitions.
// Phase 1: matrix 1938 rows 1514 cols
[2023-03-08 06:28:53] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-08 06:28:54] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-08 06:28:54] [INFO ] Invariant cache hit.
[2023-03-08 06:28:55] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2023-03-08 06:28:55] [INFO ] Invariant cache hit.
[2023-03-08 06:28:55] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1514/1549 places, 1938/1982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2398 ms. Remains : 1514/1549 places, 1938/1982 transitions.
Stuttering acceptance computed with spot in 617 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 1}, { cond=(NOT p3), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p3) p1 p2), acceptance={1} source=0 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=1 dest: 4}, { cond=(NOT p3), acceptance={0, 1} source=1 dest: 5}, { cond=true, acceptance={0} source=1 dest: 6}, { cond=(AND (NOT p3) p1 p2), acceptance={1} source=1 dest: 7}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(NOT p3), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) p1 p2), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 5}, { cond=(NOT p2), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={1} source=3 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={1} source=3 dest: 8}, { cond=p2, acceptance={} source=3 dest: 9}], [{ cond=(OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=4 dest: 5}, { cond=(NOT p0), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p3) p1 p2 (NOT p0)), acceptance={1} source=4 dest: 7}], [{ cond=(OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p3) p1 p2 (NOT p0)), acceptance={1} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p3) p1 p2 (NOT p0)), acceptance={1} source=6 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={1} source=7 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1} source=8 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={1} source=8 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={1} source=8 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=9 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1} source=9 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={1} source=9 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={1} source=9 dest: 10}, { cond=(AND p2 (NOT p0)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=10 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=10 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={1} source=10 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={1} source=10 dest: 10}], [{ cond=(NOT p2), acceptance={0} source=11 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=11 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=11 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={1} source=11 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={1} source=11 dest: 10}, { cond=p2, acceptance={} source=11 dest: 11}]], initial=0, aps=[p3:(AND (EQ s280 1) (EQ s1076 1)), p1:(EQ s970 1), p2:(NEQ s37 1), p0:(NEQ s586 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22095 reset in 522 ms.
Product exploration explored 100000 steps with 22250 reset in 483 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2112 edges and 1514 vertex of which 1506 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 p0), (X (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p1 p2))), (X (AND (NOT p3) p2)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p3) p1 p2 (NOT p0))))), true, (X (X (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0)))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 5083 ms. Reduced automaton from 12 states, 54 edges and 4 AP (stutter sensitive) to 12 states, 54 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 671 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-08 06:29:04] [INFO ] Invariant cache hit.
[2023-03-08 06:29:04] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-08 06:29:05] [INFO ] After 1128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 06:29:06] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-08 06:29:08] [INFO ] After 1782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 06:29:09] [INFO ] After 3197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 905 ms.
[2023-03-08 06:29:10] [INFO ] After 4845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 7 properties in 48 ms.
Support contains 5 out of 1514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1514/1514 places, 1938/1938 transitions.
Graph (trivial) has 1838 edges and 1514 vertex of which 693 / 1514 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions removed 795 transitions
Reduce isomorphic transitions removed 795 transitions.
Graph (complete) has 1312 edges and 884 vertex of which 876 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 876 transition count 646
Reduce places removed 487 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 546 rules applied. Total rules applied 1041 place count 389 transition count 587
Reduce places removed 38 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 42 rules applied. Total rules applied 1083 place count 351 transition count 583
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1087 place count 347 transition count 583
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1087 place count 347 transition count 533
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1187 place count 297 transition count 533
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1196 place count 288 transition count 521
Iterating global reduction 4 with 9 rules applied. Total rules applied 1205 place count 288 transition count 521
Drop transitions 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 1207 place count 288 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1209 place count 286 transition count 519
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1216 place count 279 transition count 511
Iterating global reduction 6 with 7 rules applied. Total rules applied 1223 place count 279 transition count 511
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1229 place count 279 transition count 505
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1230 place count 278 transition count 499
Iterating global reduction 7 with 1 rules applied. Total rules applied 1231 place count 278 transition count 499
Performed 147 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 7 with 294 rules applied. Total rules applied 1525 place count 131 transition count 256
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1543 place count 131 transition count 238
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1546 place count 128 transition count 235
Iterating global reduction 8 with 3 rules applied. Total rules applied 1549 place count 128 transition count 235
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1573 place count 116 transition count 221
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1586 place count 116 transition count 208
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 1588 place count 115 transition count 207
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 1654 place count 82 transition count 237
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 1681 place count 82 transition count 210
Discarding 21 places :
Symmetric choice reduction at 10 with 21 rule applications. Total rules 1702 place count 61 transition count 168
Iterating global reduction 10 with 21 rules applied. Total rules applied 1723 place count 61 transition count 168
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1734 place count 61 transition count 157
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 1740 place count 55 transition count 145
Iterating global reduction 11 with 6 rules applied. Total rules applied 1746 place count 55 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1752 place count 55 transition count 139
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1753 place count 55 transition count 138
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 12 with 2 rules applied. Total rules applied 1755 place count 54 transition count 137
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 1757 place count 54 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1758 place count 53 transition count 136
Applied a total of 1758 rules in 51 ms. Remains 53 /1514 variables (removed 1461) and now considering 136/1938 (removed 1802) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 53/1514 places, 136/1938 transitions.
Incomplete random walk after 10000 steps, including 1306 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 292 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 06:29:10] [INFO ] Flow matrix only has 124 transitions (discarded 12 similar events)
// Phase 1: matrix 124 rows 53 cols
[2023-03-08 06:29:10] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 06:29:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 06:29:10] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 06:29:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-08 06:29:10] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 06:29:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 06:29:10] [INFO ] After 29ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 06:29:11] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 06:29:11] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 136/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 53/53 places, 136/136 transitions.
Incomplete random walk after 10000 steps, including 1355 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 326 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 06:29:11] [INFO ] Flow matrix only has 124 transitions (discarded 12 similar events)
[2023-03-08 06:29:11] [INFO ] Invariant cache hit.
[2023-03-08 06:29:11] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-08 06:29:11] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 06:29:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 06:29:11] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 06:29:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 06:29:11] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 06:29:11] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 06:29:11] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 136/136 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 53 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 51 transition count 132
Applied a total of 6 rules in 3 ms. Remains 51 /53 variables (removed 2) and now considering 132/136 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 51/53 places, 132/136 transitions.
Incomplete random walk after 10000 steps, including 1372 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Probably explored full state space saw : 6408 states, properties seen :0
Probabilistic random walk after 22612 steps, saw 6408 distinct states, run finished after 59 ms. (steps per millisecond=383 ) properties seen :0
Explored full state space saw : 6408 states, properties seen :0
Exhaustive walk after 22612 steps, saw 6408 distinct states, run finished after 69 ms. (steps per millisecond=327 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 p0), (X (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p1 p2))), (X (AND (NOT p3) p2)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p1 p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p3) p1 p2 (NOT p0))))), true, (X (X (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0)))))), (X (X p2)), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p3) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p3) (NOT p0))), (F (AND p1 (NOT p3) p2 (NOT p0))), (F (NOT p2)), (F (AND (NOT p3) (NOT p2))), (F (AND p2 (NOT p0))), (F (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0)))), (F (AND (NOT p3) p2 (NOT p0))), (F (NOT (AND (NOT p3) p2))), (F (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2))))), (F (AND p1 (NOT p3) p2)), (F p3)]
Knowledge based reduction with 24 factoid took 6441 ms. Reduced automaton from 12 states, 54 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 624 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 648 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
// Phase 1: matrix 1938 rows 1514 cols
[2023-03-08 06:29:19] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-08 06:29:19] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-08 06:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:29:22] [INFO ] [Real]Absence check using state equation in 2115 ms returned sat
[2023-03-08 06:29:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:29:22] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-08 06:29:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:29:25] [INFO ] [Nat]Absence check using state equation in 2574 ms returned sat
[2023-03-08 06:29:25] [INFO ] Computed and/alt/rep : 1931/2357/1931 causal constraints (skipped 6 transitions) in 99 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 06:29:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p3)
Could not prove EG (NOT p3)
Support contains 5 out of 1514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1514/1514 places, 1938/1938 transitions.
Applied a total of 0 rules in 49 ms. Remains 1514 /1514 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
[2023-03-08 06:29:37] [INFO ] Invariant cache hit.
[2023-03-08 06:29:37] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-08 06:29:37] [INFO ] Invariant cache hit.
[2023-03-08 06:29:38] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
[2023-03-08 06:29:38] [INFO ] Invariant cache hit.
[2023-03-08 06:29:39] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2131 ms. Remains : 1514/1514 places, 1938/1938 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2112 edges and 1514 vertex of which 1506 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) (NOT p1) p0), (X (NOT (AND p2 (NOT p3) p1))), (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p2), (X (AND p2 (NOT p3))), (X (NOT p3)), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X p2)), (X (X (AND p2 (NOT p3)))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 9891 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 701 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-08 06:29:50] [INFO ] Invariant cache hit.
[2023-03-08 06:29:51] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 19 ms returned sat
[2023-03-08 06:29:51] [INFO ] After 1063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 06:29:52] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 19 ms returned sat
[2023-03-08 06:29:53] [INFO ] After 1146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 06:29:54] [INFO ] After 2197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 588 ms.
[2023-03-08 06:29:55] [INFO ] After 3340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 5 out of 1514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1514/1514 places, 1938/1938 transitions.
Graph (trivial) has 1838 edges and 1514 vertex of which 693 / 1514 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions removed 795 transitions
Reduce isomorphic transitions removed 795 transitions.
Graph (complete) has 1312 edges and 884 vertex of which 876 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 876 transition count 646
Reduce places removed 487 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 546 rules applied. Total rules applied 1041 place count 389 transition count 587
Reduce places removed 38 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 42 rules applied. Total rules applied 1083 place count 351 transition count 583
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1087 place count 347 transition count 583
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1087 place count 347 transition count 533
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1187 place count 297 transition count 533
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1196 place count 288 transition count 521
Iterating global reduction 4 with 9 rules applied. Total rules applied 1205 place count 288 transition count 521
Drop transitions 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 1207 place count 288 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1209 place count 286 transition count 519
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1216 place count 279 transition count 511
Iterating global reduction 6 with 7 rules applied. Total rules applied 1223 place count 279 transition count 511
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1229 place count 279 transition count 505
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1230 place count 278 transition count 499
Iterating global reduction 7 with 1 rules applied. Total rules applied 1231 place count 278 transition count 499
Performed 147 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 7 with 294 rules applied. Total rules applied 1525 place count 131 transition count 256
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1543 place count 131 transition count 238
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1546 place count 128 transition count 235
Iterating global reduction 8 with 3 rules applied. Total rules applied 1549 place count 128 transition count 235
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1573 place count 116 transition count 221
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1586 place count 116 transition count 208
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 1588 place count 115 transition count 207
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 1654 place count 82 transition count 237
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 1681 place count 82 transition count 210
Discarding 21 places :
Symmetric choice reduction at 10 with 21 rule applications. Total rules 1702 place count 61 transition count 168
Iterating global reduction 10 with 21 rules applied. Total rules applied 1723 place count 61 transition count 168
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1734 place count 61 transition count 157
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 1740 place count 55 transition count 145
Iterating global reduction 11 with 6 rules applied. Total rules applied 1746 place count 55 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1752 place count 55 transition count 139
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1753 place count 55 transition count 138
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 12 with 2 rules applied. Total rules applied 1755 place count 54 transition count 137
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 1757 place count 54 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1758 place count 53 transition count 136
Applied a total of 1758 rules in 43 ms. Remains 53 /1514 variables (removed 1461) and now considering 136/1938 (removed 1802) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 53/1514 places, 136/1938 transitions.
Incomplete random walk after 10000 steps, including 1343 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 326 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 06:29:55] [INFO ] Flow matrix only has 124 transitions (discarded 12 similar events)
// Phase 1: matrix 124 rows 53 cols
[2023-03-08 06:29:55] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 06:29:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 06:29:55] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 06:29:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 06:29:55] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 06:29:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 06:29:55] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 06:29:55] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 06:29:55] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 136/136 transitions.
Graph (trivial) has 5 edges and 53 vertex of which 2 / 53 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 133
Applied a total of 3 rules in 3 ms. Remains 51 /53 variables (removed 2) and now considering 133/136 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 51/53 places, 133/136 transitions.
Incomplete random walk after 10000 steps, including 1340 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 315 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3999 steps, run visited all 1 properties in 8 ms. (steps per millisecond=499 )
Probabilistic random walk after 3999 steps, saw 1359 distinct states, run finished after 9 ms. (steps per millisecond=444 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p3) (NOT p1) p0), (X (NOT (AND p2 (NOT p3) p1))), (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p2), (X (AND p2 (NOT p3))), (X (NOT p3)), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X p2)), (X (X (AND p2 (NOT p3)))), (X (X (NOT p3)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p3) (NOT p0))), (F (NOT (AND p2 (NOT p3)))), (F (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (F (AND p1 p2 (NOT p3))), (F p3), (F (NOT p0)), (F (AND (NOT p3) (NOT p0))), (F (AND p1 (NOT p3) (NOT p0)))]
Knowledge based reduction with 18 factoid took 10348 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 668 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 650 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
// Phase 1: matrix 1938 rows 1514 cols
[2023-03-08 06:30:07] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-08 06:30:07] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-08 06:30:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:30:09] [INFO ] [Real]Absence check using state equation in 1941 ms returned sat
[2023-03-08 06:30:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:30:10] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-08 06:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:30:12] [INFO ] [Nat]Absence check using state equation in 2442 ms returned sat
[2023-03-08 06:30:12] [INFO ] Computed and/alt/rep : 1931/2357/1931 causal constraints (skipped 6 transitions) in 91 ms.
[2023-03-08 06:30:24] [INFO ] Added : 600 causal constraints over 120 iterations in 11993 ms. Result :unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 581 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 22226 reset in 489 ms.
Product exploration explored 100000 steps with 22270 reset in 499 ms.
Support contains 5 out of 1514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1514/1514 places, 1938/1938 transitions.
Applied a total of 0 rules in 48 ms. Remains 1514 /1514 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
[2023-03-08 06:30:26] [INFO ] Invariant cache hit.
[2023-03-08 06:30:26] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-08 06:30:26] [INFO ] Invariant cache hit.
[2023-03-08 06:30:27] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2023-03-08 06:30:27] [INFO ] Invariant cache hit.
[2023-03-08 06:30:28] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2058 ms. Remains : 1514/1514 places, 1938/1938 transitions.
Treatment of property CloudReconfiguration-PT-303-LTLFireability-05 finished in 95397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&G(F(p1))))))))'
Support contains 2 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1533 transition count 1965
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1533 transition count 1965
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 1524 transition count 1954
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 1524 transition count 1954
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 1519 transition count 1948
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 1519 transition count 1948
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1515 transition count 1944
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1515 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 1515 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 1512 transition count 1940
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 1512 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 1509 transition count 1936
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 1509 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 1507 transition count 1933
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1507 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 1505 transition count 1929
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 1505 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 1504 transition count 1928
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 1504 transition count 1928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 1504 transition count 1927
Applied a total of 92 rules in 452 ms. Remains 1504 /1549 variables (removed 45) and now considering 1927/1982 (removed 55) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2023-03-08 06:30:29] [INFO ] Computed 3 place invariants in 15 ms
[2023-03-08 06:30:29] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-08 06:30:29] [INFO ] Invariant cache hit.
[2023-03-08 06:30:30] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2023-03-08 06:30:30] [INFO ] Invariant cache hit.
[2023-03-08 06:30:31] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1504/1549 places, 1927/1982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2480 ms. Remains : 1504/1549 places, 1927/1982 transitions.
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s118 1), p0:(EQ s623 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-06 finished in 2898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&G(p1))))'
Support contains 2 out of 1549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Graph (trivial) has 1890 edges and 1549 vertex of which 696 / 1549 are part of one of the 63 SCC in 1 ms
Free SCC test removed 633 places
Ensure Unique test removed 735 transitions
Reduce isomorphic transitions removed 735 transitions.
Graph (complete) has 1416 edges and 916 vertex of which 908 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 907 transition count 742
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 523 rules applied. Total rules applied 1024 place count 408 transition count 718
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 1037 place count 396 transition count 717
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1038 place count 395 transition count 717
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1038 place count 395 transition count 672
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1128 place count 350 transition count 672
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1146 place count 332 transition count 644
Iterating global reduction 4 with 18 rules applied. Total rules applied 1164 place count 332 transition count 644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 1168 place count 332 transition count 640
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1171 place count 329 transition count 640
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1182 place count 318 transition count 624
Iterating global reduction 6 with 11 rules applied. Total rules applied 1193 place count 318 transition count 624
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1199 place count 318 transition count 618
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1202 place count 315 transition count 612
Iterating global reduction 7 with 3 rules applied. Total rules applied 1205 place count 315 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1206 place count 315 transition count 611
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1208 place count 313 transition count 607
Iterating global reduction 8 with 2 rules applied. Total rules applied 1210 place count 313 transition count 607
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1212 place count 311 transition count 603
Iterating global reduction 8 with 2 rules applied. Total rules applied 1214 place count 311 transition count 603
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1216 place count 309 transition count 599
Iterating global reduction 8 with 2 rules applied. Total rules applied 1218 place count 309 transition count 599
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1220 place count 307 transition count 595
Iterating global reduction 8 with 2 rules applied. Total rules applied 1222 place count 307 transition count 595
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1223 place count 306 transition count 588
Iterating global reduction 8 with 1 rules applied. Total rules applied 1224 place count 306 transition count 588
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 1225 place count 306 transition count 587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1226 place count 305 transition count 587
Performed 145 Post agglomeration using F-continuation condition with reduction of 85 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 10 with 290 rules applied. Total rules applied 1516 place count 160 transition count 357
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1528 place count 160 transition count 345
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1532 place count 156 transition count 340
Iterating global reduction 11 with 4 rules applied. Total rules applied 1536 place count 156 transition count 340
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1560 place count 144 transition count 326
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1572 place count 144 transition count 314
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1573 place count 143 transition count 310
Iterating global reduction 12 with 1 rules applied. Total rules applied 1574 place count 143 transition count 310
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 12 with 2 rules applied. Total rules applied 1576 place count 142 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1578 place count 142 transition count 307
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 13 with 34 rules applied. Total rules applied 1612 place count 125 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 1629 place count 125 transition count 324
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1638 place count 116 transition count 306
Iterating global reduction 14 with 9 rules applied. Total rules applied 1647 place count 116 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1653 place count 116 transition count 300
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 15 with 36 rules applied. Total rules applied 1689 place count 116 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1690 place count 115 transition count 263
Applied a total of 1690 rules in 93 ms. Remains 115 /1549 variables (removed 1434) and now considering 263/1982 (removed 1719) transitions.
[2023-03-08 06:30:31] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 115 cols
[2023-03-08 06:30:31] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 06:30:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 06:30:31] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2023-03-08 06:30:31] [INFO ] Invariant cache hit.
[2023-03-08 06:30:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 06:30:32] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [44, 45, 78]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 289 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1549 places, 263/1982 transitions.
Reduce places removed 1 places and 1 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 109 transition count 260
Applied a total of 4 rules in 4 ms. Remains 109 /112 variables (removed 3) and now considering 260/263 (removed 3) transitions.
[2023-03-08 06:30:32] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 109 cols
[2023-03-08 06:30:32] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 06:30:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 06:30:32] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2023-03-08 06:30:32] [INFO ] Invariant cache hit.
[2023-03-08 06:30:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 06:30:32] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/1549 places, 260/1982 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 549 ms. Remains : 109/1549 places, 260/1982 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s36 1), p0:(NEQ s39 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-08 finished in 675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||(X(p2) U ((X(p2)&&G(p0))||X(G(p2))))))'
Support contains 3 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1534 transition count 1966
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1534 transition count 1966
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 1526 transition count 1956
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 1526 transition count 1956
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1521 transition count 1950
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1521 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1517 transition count 1946
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1517 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 1517 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 1514 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 1514 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 1511 transition count 1938
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 1511 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 1509 transition count 1935
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 1509 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 1507 transition count 1931
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1507 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1506 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1506 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 1506 transition count 1929
Applied a total of 88 rules in 451 ms. Remains 1506 /1549 variables (removed 43) and now considering 1929/1982 (removed 53) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2023-03-08 06:30:32] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-08 06:30:33] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-08 06:30:33] [INFO ] Invariant cache hit.
[2023-03-08 06:30:34] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2023-03-08 06:30:34] [INFO ] Invariant cache hit.
[2023-03-08 06:30:34] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1549 places, 1929/1982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2470 ms. Remains : 1506/1549 places, 1929/1982 transitions.
Stuttering acceptance computed with spot in 498 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}], [{ cond=(NOT p2), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 9}, { cond=(AND p0 p2), acceptance={} source=9 dest: 10}], [{ cond=(NOT p2), acceptance={} source=10 dest: 0}, { cond=(AND p0 p2), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=11 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 11}]], initial=1, aps=[p0:(EQ s198 1), p1:(NEQ s302 1), p2:(NEQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 873 ms.
Product exploration explored 100000 steps with 50000 reset in 877 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2102 edges and 1506 vertex of which 1498 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) p2)))
Knowledge based reduction with 18 factoid took 348 ms. Reduced automaton from 12 states, 31 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-303-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-303-LTLFireability-09 finished in 5113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(!p1)))'
Support contains 2 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1534 transition count 1966
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1534 transition count 1966
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 1526 transition count 1956
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 1526 transition count 1956
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1521 transition count 1950
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1521 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1517 transition count 1946
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1517 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 1517 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 1514 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 1514 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 1511 transition count 1938
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 1511 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 1509 transition count 1935
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 1509 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 1507 transition count 1931
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1507 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1506 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1506 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 1506 transition count 1929
Applied a total of 88 rules in 455 ms. Remains 1506 /1549 variables (removed 43) and now considering 1929/1982 (removed 53) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2023-03-08 06:30:37] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-08 06:30:38] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-08 06:30:38] [INFO ] Invariant cache hit.
[2023-03-08 06:30:39] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
[2023-03-08 06:30:39] [INFO ] Invariant cache hit.
[2023-03-08 06:30:39] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1549 places, 1929/1982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2487 ms. Remains : 1506/1549 places, 1929/1982 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, true, p1, (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s1314 1), p0:(EQ s323 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-13 finished in 2617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G((p2||X(p3))))))))'
Support contains 3 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1535 transition count 1967
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1535 transition count 1967
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 1526 transition count 1956
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 1526 transition count 1956
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1521 transition count 1950
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1521 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1517 transition count 1946
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1517 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 1517 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 1514 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 1514 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 1511 transition count 1938
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 1511 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 1509 transition count 1935
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 1509 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 1507 transition count 1931
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1507 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1506 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1506 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 1506 transition count 1929
Applied a total of 88 rules in 443 ms. Remains 1506 /1549 variables (removed 43) and now considering 1929/1982 (removed 53) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2023-03-08 06:30:40] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-08 06:30:40] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-08 06:30:40] [INFO ] Invariant cache hit.
[2023-03-08 06:30:41] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
[2023-03-08 06:30:41] [INFO ] Invariant cache hit.
[2023-03-08 06:30:42] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1549 places, 1929/1982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2416 ms. Remains : 1506/1549 places, 1929/1982 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s803 1), p1:(EQ s333 0), p2:(EQ s73 0), p3:(EQ s333 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-14 finished in 2612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1534 transition count 1966
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1534 transition count 1966
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 1525 transition count 1955
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 1525 transition count 1955
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 1520 transition count 1949
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 1520 transition count 1949
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 1516 transition count 1945
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 1516 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 1516 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 1513 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 1513 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 1510 transition count 1937
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 1510 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 1508 transition count 1934
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 1508 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 1506 transition count 1930
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 1506 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 1505 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 1505 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 1505 transition count 1928
Applied a total of 90 rules in 460 ms. Remains 1505 /1549 variables (removed 44) and now considering 1928/1982 (removed 54) transitions.
// Phase 1: matrix 1928 rows 1505 cols
[2023-03-08 06:30:43] [INFO ] Computed 3 place invariants in 17 ms
[2023-03-08 06:30:43] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-08 06:30:43] [INFO ] Invariant cache hit.
[2023-03-08 06:30:44] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2023-03-08 06:30:44] [INFO ] Invariant cache hit.
[2023-03-08 06:30:45] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1505/1549 places, 1928/1982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2499 ms. Remains : 1505/1549 places, 1928/1982 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s307 1) (EQ s1382 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-15 finished in 2598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : CloudReconfiguration-PT-303-LTLFireability-00
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1549 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Graph (trivial) has 1888 edges and 1549 vertex of which 684 / 1549 are part of one of the 62 SCC in 1 ms
Free SCC test removed 622 places
Ensure Unique test removed 722 transitions
Reduce isomorphic transitions removed 722 transitions.
Graph (complete) has 1429 edges and 927 vertex of which 919 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 506 rules applied. Total rules applied 508 place count 918 transition count 748
Reduce places removed 506 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 532 rules applied. Total rules applied 1040 place count 412 transition count 722
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 1054 place count 399 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1055 place count 398 transition count 721
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1055 place count 398 transition count 674
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1149 place count 351 transition count 674
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1168 place count 332 transition count 644
Iterating global reduction 4 with 19 rules applied. Total rules applied 1187 place count 332 transition count 644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 1191 place count 332 transition count 640
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1194 place count 329 transition count 640
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1205 place count 318 transition count 624
Iterating global reduction 6 with 11 rules applied. Total rules applied 1216 place count 318 transition count 624
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1222 place count 318 transition count 618
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1225 place count 315 transition count 612
Iterating global reduction 7 with 3 rules applied. Total rules applied 1228 place count 315 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1229 place count 315 transition count 611
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1231 place count 313 transition count 607
Iterating global reduction 8 with 2 rules applied. Total rules applied 1233 place count 313 transition count 607
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1235 place count 311 transition count 603
Iterating global reduction 8 with 2 rules applied. Total rules applied 1237 place count 311 transition count 603
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1239 place count 309 transition count 599
Iterating global reduction 8 with 2 rules applied. Total rules applied 1241 place count 309 transition count 599
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1243 place count 307 transition count 595
Iterating global reduction 8 with 2 rules applied. Total rules applied 1245 place count 307 transition count 595
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1246 place count 306 transition count 588
Iterating global reduction 8 with 1 rules applied. Total rules applied 1247 place count 306 transition count 588
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 1248 place count 306 transition count 587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1249 place count 305 transition count 587
Performed 144 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 10 with 288 rules applied. Total rules applied 1537 place count 161 transition count 361
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1549 place count 161 transition count 349
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1554 place count 156 transition count 342
Iterating global reduction 11 with 5 rules applied. Total rules applied 1559 place count 156 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1560 place count 156 transition count 341
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 12 with 24 rules applied. Total rules applied 1584 place count 144 transition count 327
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 1596 place count 144 transition count 315
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1597 place count 143 transition count 311
Iterating global reduction 13 with 1 rules applied. Total rules applied 1598 place count 143 transition count 311
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1600 place count 142 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1602 place count 142 transition count 308
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 14 with 36 rules applied. Total rules applied 1638 place count 124 transition count 346
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 1655 place count 124 transition count 329
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1664 place count 115 transition count 311
Iterating global reduction 15 with 9 rules applied. Total rules applied 1673 place count 115 transition count 311
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1679 place count 115 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1680 place count 114 transition count 304
Applied a total of 1680 rules in 93 ms. Remains 114 /1549 variables (removed 1435) and now considering 304/1982 (removed 1678) transitions.
[2023-03-08 06:30:45] [INFO ] Flow matrix only has 247 transitions (discarded 57 similar events)
// Phase 1: matrix 247 rows 114 cols
[2023-03-08 06:30:45] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 06:30:45] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 06:30:45] [INFO ] Flow matrix only has 247 transitions (discarded 57 similar events)
[2023-03-08 06:30:45] [INFO ] Invariant cache hit.
[2023-03-08 06:30:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 06:30:45] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [40, 41, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 168 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 111/1549 places, 304/1982 transitions.
Reduce places removed 1 places and 1 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 108 transition count 301
Applied a total of 4 rules in 4 ms. Remains 108 /111 variables (removed 3) and now considering 301/304 (removed 3) transitions.
[2023-03-08 06:30:45] [INFO ] Flow matrix only has 244 transitions (discarded 57 similar events)
// Phase 1: matrix 244 rows 108 cols
[2023-03-08 06:30:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 06:30:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 06:30:45] [INFO ] Flow matrix only has 244 transitions (discarded 57 similar events)
[2023-03-08 06:30:45] [INFO ] Invariant cache hit.
[2023-03-08 06:30:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-08 06:30:45] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 108/1549 places, 301/1982 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 409 ms. Remains : 108/1549 places, 301/1982 transitions.
Running random walk in product with property : CloudReconfiguration-PT-303-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s60 0) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27058 reset in 147 ms.
Product exploration explored 100000 steps with 27078 reset in 160 ms.
Computed a total of 1 stabilizing places and 15 stable transitions
Computed a total of 1 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1739 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 330 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 35275 steps, run visited all 1 properties in 51 ms. (steps per millisecond=691 )
Probabilistic random walk after 35275 steps, saw 7111 distinct states, run finished after 51 ms. (steps per millisecond=691 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2023-03-08 06:30:47] [INFO ] Flow matrix only has 244 transitions (discarded 57 similar events)
[2023-03-08 06:30:47] [INFO ] Invariant cache hit.
[2023-03-08 06:30:47] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 06:30:47] [INFO ] Flow matrix only has 244 transitions (discarded 57 similar events)
[2023-03-08 06:30:47] [INFO ] Invariant cache hit.
[2023-03-08 06:30:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-08 06:30:47] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-08 06:30:47] [INFO ] Flow matrix only has 244 transitions (discarded 57 similar events)
[2023-03-08 06:30:47] [INFO ] Invariant cache hit.
[2023-03-08 06:30:47] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 108/108 places, 301/301 transitions.
Computed a total of 1 stabilizing places and 15 stable transitions
Computed a total of 1 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3882 steps, including 689 resets, run visited all 1 properties in 9 ms. (steps per millisecond=431 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27090 reset in 116 ms.
Product exploration explored 100000 steps with 27064 reset in 121 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 0 with 37 rules applied. Total rules applied 37 place count 108 transition count 264
Applied a total of 37 rules in 11 ms. Remains 108 /108 variables (removed 0) and now considering 264/301 (removed 37) transitions.
[2023-03-08 06:30:48] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-08 06:30:48] [INFO ] Flow matrix only has 207 transitions (discarded 57 similar events)
// Phase 1: matrix 207 rows 108 cols
[2023-03-08 06:30:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 06:30:48] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/108 places, 264/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 108/108 places, 264/301 transitions.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 301/301 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2023-03-08 06:30:48] [INFO ] Flow matrix only has 244 transitions (discarded 57 similar events)
// Phase 1: matrix 244 rows 108 cols
[2023-03-08 06:30:48] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 06:30:48] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 06:30:48] [INFO ] Flow matrix only has 244 transitions (discarded 57 similar events)
[2023-03-08 06:30:48] [INFO ] Invariant cache hit.
[2023-03-08 06:30:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-08 06:30:49] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-08 06:30:49] [INFO ] Flow matrix only has 244 transitions (discarded 57 similar events)
[2023-03-08 06:30:49] [INFO ] Invariant cache hit.
[2023-03-08 06:30:49] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 108/108 places, 301/301 transitions.
Treatment of property CloudReconfiguration-PT-303-LTLFireability-00 finished in 3895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!p0)) U (p1&&X(G(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(X(p0))||(p1&&G(p2))) U p3))))'
Warning : SL/CL computation failed.
[2023-03-08 06:30:59] [INFO ] Flatten gal took : 90 ms
[2023-03-08 06:30:59] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 06:30:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1549 places, 1982 transitions and 4135 arcs took 11 ms.
Total runtime 219965 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2367/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2367/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2367/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CloudReconfiguration-PT-303-LTLFireability-00
Could not compute solution for formula : CloudReconfiguration-PT-303-LTLFireability-03
Could not compute solution for formula : CloudReconfiguration-PT-303-LTLFireability-05

BK_STOP 1678257062252

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CloudReconfiguration-PT-303-LTLFireability-00
ltl formula formula --ltl=/tmp/2367/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 1549 places, 1982 transitions and 4135 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.190 real 0.040 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2367/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2367/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2367/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2367/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CloudReconfiguration-PT-303-LTLFireability-03
ltl formula formula --ltl=/tmp/2367/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 1549 places, 1982 transitions and 4135 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.190 real 0.060 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2367/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2367/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2367/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2367/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name CloudReconfiguration-PT-303-LTLFireability-05
ltl formula formula --ltl=/tmp/2367/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 1549 places, 1982 transitions and 4135 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.200 real 0.080 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2367/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2367/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2367/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2367/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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-303"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is CloudReconfiguration-PT-303, 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 r105-tall-167814480600020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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