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.r101-tall-167814474800020.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 itstools
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 r101-tall-167814474800020
=====================================================================

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

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-303
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-07 19:59:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-07 19:59:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 19:59:22] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-07 19:59:22] [INFO ] Transformed 2584 places.
[2023-03-07 19:59:22] [INFO ] Transformed 3094 transitions.
[2023-03-07 19:59:22] [INFO ] Found NUPN structural information;
[2023-03-07 19:59:22] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 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 1618 ms. Remains 1550 /2584 variables (removed 1034) and now considering 1982/3094 (removed 1112) transitions.
// Phase 1: matrix 1982 rows 1550 cols
[2023-03-07 19:59:24] [INFO ] Computed 4 place invariants in 35 ms
[2023-03-07 19:59:25] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-07 19:59:25] [INFO ] Invariant cache hit.
[2023-03-07 19:59:26] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned [1539]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1606 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 3272 ms. Remains : 1549/2584 places, 1982/3094 transitions.
Support contains 37 out of 1549 places after structural reductions.
[2023-03-07 19:59:26] [INFO ] Flatten gal took : 123 ms
[2023-03-07 19:59:26] [INFO ] Flatten gal took : 70 ms
[2023-03-07 19:59:26] [INFO ] Input system was already deterministic with 1982 transitions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 33) seen :5
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) 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 28) seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 1982 rows 1549 cols
[2023-03-07 19:59:27] [INFO ] Computed 3 place invariants in 32 ms
[2023-03-07 19:59:28] [INFO ] After 915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-07 19:59:29] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 19 ms returned sat
[2023-03-07 19:59:32] [INFO ] After 2508ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :27
[2023-03-07 19:59:35] [INFO ] After 5521ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :27
Attempting to minimize the solution found.
Minimization took 1771 ms.
[2023-03-07 19:59:37] [INFO ] After 8899ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :27
Fused 28 Parikh solutions to 26 different solutions.
Parikh walk visited 19 properties in 227 ms.
Support contains 9 out of 1549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1549/1549 places, 1982/1982 transitions.
Graph (trivial) has 1872 edges and 1549 vertex of which 653 / 1549 are part of one of the 60 SCC in 7 ms
Free SCC test removed 593 places
Drop transitions removed 742 transitions
Reduce isomorphic transitions removed 742 transitions.
Graph (complete) has 1410 edges and 956 vertex of which 948 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 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 522 transitions
Trivial Post-agglo rules discarded 522 transitions
Performed 522 trivial Post agglomeration. Transition count delta: 522
Iterating post reduction 0 with 529 rules applied. Total rules applied 531 place count 948 transition count 707
Reduce places removed 522 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 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 583 rules applied. Total rules applied 1114 place count 426 transition count 646
Reduce places removed 39 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 42 rules applied. Total rules applied 1156 place count 387 transition count 643
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 1159 place count 386 transition count 641
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 4 with 5 rules applied. Total rules applied 1164 place count 385 transition count 637
Reduce places removed 4 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 7 rules applied. Total rules applied 1171 place count 381 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1172 place count 380 transition count 634
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 48 Pre rules applied. Total rules applied 1172 place count 380 transition count 586
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 1268 place count 332 transition count 586
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1280 place count 320 transition count 570
Iterating global reduction 7 with 12 rules applied. Total rules applied 1292 place count 320 transition count 570
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 7 with 4 rules applied. Total rules applied 1296 place count 320 transition count 566
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1299 place count 317 transition count 566
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1306 place count 310 transition count 558
Iterating global reduction 9 with 7 rules applied. Total rules applied 1313 place count 310 transition count 558
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1319 place count 310 transition count 552
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1320 place count 309 transition count 550
Iterating global reduction 10 with 1 rules applied. Total rules applied 1321 place count 309 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1322 place count 309 transition count 549
Performed 164 Post agglomeration using F-continuation condition with reduction of 100 identical transitions.
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 11 with 328 rules applied. Total rules applied 1650 place count 145 transition count 285
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1670 place count 145 transition count 265
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1674 place count 141 transition count 260
Iterating global reduction 12 with 4 rules applied. Total rules applied 1678 place count 141 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1679 place count 141 transition count 259
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 13 with 22 rules applied. Total rules applied 1701 place count 130 transition count 246
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 1713 place count 130 transition count 234
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 14 with 74 rules applied. Total rules applied 1787 place count 93 transition count 264
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 14 with 32 rules applied. Total rules applied 1819 place count 93 transition count 232
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 1840 place count 72 transition count 190
Iterating global reduction 15 with 21 rules applied. Total rules applied 1861 place count 72 transition count 190
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 1873 place count 72 transition count 178
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 1879 place count 66 transition count 166
Iterating global reduction 16 with 6 rules applied. Total rules applied 1885 place count 66 transition count 166
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1891 place count 66 transition count 160
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 17 with 6 rules applied. Total rules applied 1897 place count 66 transition count 154
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 1902 place count 66 transition count 149
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 1909 place count 61 transition count 147
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 1914 place count 61 transition count 147
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1915 place count 61 transition count 146
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1916 place count 60 transition count 145
Iterating global reduction 18 with 1 rules applied. Total rules applied 1917 place count 60 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1918 place count 59 transition count 144
Applied a total of 1918 rules in 143 ms. Remains 59 /1549 variables (removed 1490) and now considering 144/1982 (removed 1838) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 59/1549 places, 144/1982 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-07 19:59:37] [INFO ] Flow matrix only has 133 transitions (discarded 11 similar events)
// Phase 1: matrix 133 rows 59 cols
[2023-03-07 19:59:37] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-07 19:59:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-07 19:59:37] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-07 19:59:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:59:38] [INFO ] After 9ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-07 19:59:38] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-07 19:59:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-07 19:59:38] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-07 19:59:38] [INFO ] After 9ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-07 19:59:38] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2023-03-07 19:59:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-07 19:59:38] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2023-03-07 19:59:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-07 19:59:38] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-07 19:59:38] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
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.29 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 408 ms. Remains 1504 /1549 variables (removed 45) and now considering 1927/1982 (removed 55) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2023-03-07 19:59:39] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-07 19:59:39] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-07 19:59:39] [INFO ] Invariant cache hit.
[2023-03-07 19:59:40] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
[2023-03-07 19:59:40] [INFO ] Invariant cache hit.
[2023-03-07 19:59:41] [INFO ] Dead Transitions using invariants and state equation in 759 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 2380 ms. Remains : 1504/1549 places, 1927/1982 transitions.
Stuttering acceptance computed with spot in 395 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 599 ms.
Product exploration explored 100000 steps with 25000 reset in 536 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.9 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 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 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 483465 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 483465 steps, saw 114928 distinct states, run finished after 3003 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 19:59:45] [INFO ] Invariant cache hit.
[2023-03-07 19:59:46] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 19:59:46] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 17 ms returned sat
[2023-03-07 19:59:47] [INFO ] After 733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 19:59:47] [INFO ] After 847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-07 19:59:47] [INFO ] After 1125ms 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 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 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 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 49 ms. Remains 1504 /1504 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
[2023-03-07 19:59:47] [INFO ] Invariant cache hit.
[2023-03-07 19:59:47] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-07 19:59:47] [INFO ] Invariant cache hit.
[2023-03-07 19:59:48] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2023-03-07 19:59:48] [INFO ] Invariant cache hit.
[2023-03-07 19:59:49] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2005 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.14 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 93 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 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 121 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 496707 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 496707 steps, saw 117360 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 19:59:52] [INFO ] Invariant cache hit.
[2023-03-07 19:59:53] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 19:59:53] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 17 ms returned sat
[2023-03-07 19:59:54] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 19:59:54] [INFO ] After 833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-07 19:59:54] [INFO ] After 1100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 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 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 483 ms.
Product exploration explored 100000 steps with 25000 reset in 486 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 156 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 6 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 1 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 1 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 0 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 1 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 0 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 1 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 1 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 1 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 0 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 1 ms
Applied a total of 2201 rules in 366 ms. Remains 253 /1504 variables (removed 1251) and now considering 495/1927 (removed 1432) transitions.
[2023-03-07 19:59:56] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-07 19:59:56] [INFO ] Flow matrix only has 441 transitions (discarded 54 similar events)
// Phase 1: matrix 441 rows 253 cols
[2023-03-07 19:59:56] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-07 19:59:56] [INFO ] Dead Transitions using invariants and state equation in 183 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 601 ms. Remains : 253/1504 places, 495/1927 transitions.
Built C files in :
/tmp/ltsmin17878339013599926284
[2023-03-07 19:59:56] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17878339013599926284
Running compilation step : cd /tmp/ltsmin17878339013599926284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17878339013599926284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17878339013599926284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 53 ms. Remains 1504 /1504 variables (removed 0) and now considering 1927/1927 (removed 0) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2023-03-07 19:59:59] [INFO ] Computed 3 place invariants in 20 ms
[2023-03-07 20:00:00] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-07 20:00:00] [INFO ] Invariant cache hit.
[2023-03-07 20:00:01] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
[2023-03-07 20:00:01] [INFO ] Invariant cache hit.
[2023-03-07 20:00:01] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1972 ms. Remains : 1504/1504 places, 1927/1927 transitions.
Built C files in :
/tmp/ltsmin16794445790598543406
[2023-03-07 20:00:01] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16794445790598543406
Running compilation step : cd /tmp/ltsmin16794445790598543406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16794445790598543406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16794445790598543406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-07 20:00:05] [INFO ] Flatten gal took : 55 ms
[2023-03-07 20:00:05] [INFO ] Flatten gal took : 52 ms
[2023-03-07 20:00:05] [INFO ] Time to serialize gal into /tmp/LTL14677364502074015715.gal : 17 ms
[2023-03-07 20:00:05] [INFO ] Time to serialize properties into /tmp/LTL6352215416383431242.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14677364502074015715.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10055025611500011994.hoa' '-atoms' '/tmp/LTL6352215416383431242.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6352215416383431242.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10055025611500011994.hoa
Detected timeout of ITS tools.
[2023-03-07 20:00:20] [INFO ] Flatten gal took : 46 ms
[2023-03-07 20:00:20] [INFO ] Flatten gal took : 42 ms
[2023-03-07 20:00:20] [INFO ] Time to serialize gal into /tmp/LTL6754267454203264676.gal : 8 ms
[2023-03-07 20:00:20] [INFO ] Time to serialize properties into /tmp/LTL16485994095957768274.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6754267454203264676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16485994095957768274.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((p1480==0)||(p2018==1))"))))))
Formula 0 simplified : XXXG!"((p1480==0)||(p2018==1))"
Detected timeout of ITS tools.
[2023-03-07 20:00:35] [INFO ] Flatten gal took : 42 ms
[2023-03-07 20:00:35] [INFO ] Applying decomposition
[2023-03-07 20:00:35] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13111413172174143540.txt' '-o' '/tmp/graph13111413172174143540.bin' '-w' '/tmp/graph13111413172174143540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13111413172174143540.bin' '-l' '-1' '-v' '-w' '/tmp/graph13111413172174143540.weights' '-q' '0' '-e' '0.001'
[2023-03-07 20:00:35] [INFO ] Decomposing Gal with order
[2023-03-07 20:00:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 20:00:35] [INFO ] Removed a total of 508 redundant transitions.
[2023-03-07 20:00:35] [INFO ] Flatten gal took : 132 ms
[2023-03-07 20:00:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 26 ms.
[2023-03-07 20:00:36] [INFO ] Time to serialize gal into /tmp/LTL12015059570212145577.gal : 26 ms
[2023-03-07 20:00:36] [INFO ] Time to serialize properties into /tmp/LTL5163657412527782082.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12015059570212145577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5163657412527782082.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((i22.i1.i3.u347.p1480==0)||(i29.i0.i1.u477.p2018==1))"))))))
Formula 0 simplified : XXXG!"((i22.i1.i3.u347.p1480==0)||(i29.i0.i1.u477.p2018==1))"
Reverse transition relation is NOT exact ! Due to transitions t26, t216, t270, t332, t381, t452, t703, t755, t815, t864, t1152, t1233, t1264, t1343, t1627,...2077
Computing Next relation with stutter on 32080 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
242 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.70834,111816,1,0,165260,3759,18318,284176,501,19686,837967
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-303-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-303-LTLFireability-00 finished in 60499 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 564 ms. Remains 1506 /1549 variables (removed 43) and now considering 1930/1982 (removed 52) transitions.
// Phase 1: matrix 1930 rows 1506 cols
[2023-03-07 20:00:39] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-07 20:00:39] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-07 20:00:39] [INFO ] Invariant cache hit.
[2023-03-07 20:00:40] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
[2023-03-07 20:00:40] [INFO ] Invariant cache hit.
[2023-03-07 20:00:41] [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, 1930/1982 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2616 ms. Remains : 1506/1549 places, 1930/1982 transitions.
Stuttering acceptance computed with spot in 243 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 992 ms.
Product exploration explored 100000 steps with 50000 reset in 912 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 378 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 5182 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 2 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.2 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 1 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 0 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 104 ms. Remains 113 /1549 variables (removed 1436) and now considering 262/1982 (removed 1720) transitions.
[2023-03-07 20:00:44] [INFO ] Flow matrix only has 204 transitions (discarded 58 similar events)
// Phase 1: matrix 204 rows 113 cols
[2023-03-07 20:00:44] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 20:00:44] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-07 20:00:44] [INFO ] Flow matrix only has 204 transitions (discarded 58 similar events)
[2023-03-07 20:00:44] [INFO ] Invariant cache hit.
[2023-03-07 20:00:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 20:00:44] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [42, 43, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 222 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-07 20:00:44] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
// Phase 1: matrix 201 rows 107 cols
[2023-03-07 20:00:44] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 20:00:44] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-07 20:00:44] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2023-03-07 20:00:44] [INFO ] Invariant cache hit.
[2023-03-07 20:00:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 20:00:44] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 126 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 458 ms. Remains : 107/1549 places, 259/1982 transitions.
Stuttering acceptance computed with spot in 84 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 557 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 471 ms. Remains 1510 /1549 variables (removed 39) and now considering 1936/1982 (removed 46) transitions.
// Phase 1: matrix 1936 rows 1510 cols
[2023-03-07 20:00:45] [INFO ] Computed 3 place invariants in 17 ms
[2023-03-07 20:00:45] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-07 20:00:45] [INFO ] Invariant cache hit.
[2023-03-07 20:00:46] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
[2023-03-07 20:00:46] [INFO ] Invariant cache hit.
[2023-03-07 20:00:47] [INFO ] Dead Transitions using invariants and state equation in 746 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 2422 ms. Remains : 1510/1549 places, 1936/1982 transitions.
Stuttering acceptance computed with spot in 138 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 1056 reset in 210 ms.
Product exploration explored 100000 steps with 1084 reset in 321 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.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 343 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 127 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Incomplete random walk after 10000 steps, including 107 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 23 ms. (steps per millisecond=434 ) 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
Interrupted probabilistic random walk after 337393 steps, run timeout after 3009 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 337393 steps, saw 85769 distinct states, run finished after 3016 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-07 20:00:51] [INFO ] Invariant cache hit.
[2023-03-07 20:00:51] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-07 20:00:52] [INFO ] After 828ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-07 20:00:52] [INFO ] After 943ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-07 20:00:52] [INFO ] After 1198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-07 20:00:53] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-07 20:00:53] [INFO ] After 738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-07 20:00:54] [INFO ] After 969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-07 20:00:54] [INFO ] After 1365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 3 ms.
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1936/1936 transitions.
Graph (trivial) has 1843 edges and 1510 vertex of which 695 / 1510 are part of one of the 63 SCC in 1 ms
Free SCC test removed 632 places
Drop transitions removed 798 transitions
Reduce isomorphic transitions removed 798 transitions.
Graph (complete) has 1307 edges and 878 vertex of which 870 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 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 870 transition count 642
Reduce places removed 486 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 546 rules applied. Total rules applied 1040 place count 384 transition count 582
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 1082 place count 345 transition count 579
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1085 place count 342 transition count 579
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1085 place count 342 transition count 529
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1185 place count 292 transition count 529
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1196 place count 281 transition count 513
Iterating global reduction 4 with 11 rules applied. Total rules applied 1207 place count 281 transition count 513
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 1210 place count 281 transition count 510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1213 place count 278 transition count 510
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1221 place count 270 transition count 500
Iterating global reduction 6 with 8 rules applied. Total rules applied 1229 place count 270 transition count 500
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1235 place count 270 transition count 494
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1237 place count 268 transition count 482
Iterating global reduction 7 with 2 rules applied. Total rules applied 1239 place count 268 transition count 482
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 1240 place count 268 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1241 place count 267 transition count 481
Performed 142 Post agglomeration using F-continuation condition with reduction of 98 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 1525 place count 125 transition count 241
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 1538 place count 125 transition count 228
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 1540 place count 124 transition count 227
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1543 place count 121 transition count 224
Iterating global reduction 11 with 3 rules applied. Total rules applied 1546 place count 121 transition count 224
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 1572 place count 108 transition count 208
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1584 place count 108 transition count 196
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 1650 place count 75 transition count 226
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 12 with 27 rules applied. Total rules applied 1677 place count 75 transition count 199
Discarding 21 places :
Symmetric choice reduction at 13 with 21 rule applications. Total rules 1698 place count 54 transition count 157
Iterating global reduction 13 with 21 rules applied. Total rules applied 1719 place count 54 transition count 157
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 1731 place count 54 transition count 145
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1737 place count 48 transition count 133
Iterating global reduction 14 with 6 rules applied. Total rules applied 1743 place count 48 transition count 133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1749 place count 48 transition count 127
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1750 place count 48 transition count 126
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1751 place count 48 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1752 place count 47 transition count 125
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1753 place count 47 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1754 place count 46 transition count 124
Applied a total of 1754 rules in 54 ms. Remains 46 /1510 variables (removed 1464) and now considering 124/1936 (removed 1812) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 46/1510 places, 124/1936 transitions.
Finished random walk after 1488 steps, including 195 resets, run visited all 1 properties in 3 ms. (steps per millisecond=496 )
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 290 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 138 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
[2023-03-07 20:00:54] [INFO ] Invariant cache hit.
[2023-03-07 20:00:55] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-07 20:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 20:00:56] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2023-03-07 20:00:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 20:00:56] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-07 20:00:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 20:00:57] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2023-03-07 20:00:57] [INFO ] Computed and/alt/rep : 1929/2358/1929 causal constraints (skipped 6 transitions) in 95 ms.
[2023-03-07 20:01:11] [INFO ] Added : 760 causal constraints over 152 iterations in 13613 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 44 ms. Remains 1510 /1510 variables (removed 0) and now considering 1936/1936 (removed 0) transitions.
[2023-03-07 20:01:11] [INFO ] Invariant cache hit.
[2023-03-07 20:01:11] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-07 20:01:11] [INFO ] Invariant cache hit.
[2023-03-07 20:01:12] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2023-03-07 20:01:12] [INFO ] Invariant cache hit.
[2023-03-07 20:01:13] [INFO ] Dead Transitions using invariants and state equation in 794 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2086 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.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 201 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 139 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Incomplete random walk after 10000 steps, including 103 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 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 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 370133 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 370133 steps, saw 92018 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-07 20:01:16] [INFO ] Invariant cache hit.
[2023-03-07 20:01:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-07 20:01:17] [INFO ] After 761ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-07 20:01:17] [INFO ] After 871ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-07 20:01:17] [INFO ] After 1117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-07 20:01:18] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-07 20:01:18] [INFO ] After 730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-07 20:01:19] [INFO ] After 961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-07 20:01:19] [INFO ] After 1358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 3 ms.
Support contains 2 out of 1510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1510/1510 places, 1936/1936 transitions.
Graph (trivial) has 1843 edges and 1510 vertex of which 695 / 1510 are part of one of the 63 SCC in 1 ms
Free SCC test removed 632 places
Drop transitions removed 798 transitions
Reduce isomorphic transitions removed 798 transitions.
Graph (complete) has 1307 edges and 878 vertex of which 870 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 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 492 rules applied. Total rules applied 494 place count 870 transition count 642
Reduce places removed 486 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 546 rules applied. Total rules applied 1040 place count 384 transition count 582
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 1082 place count 345 transition count 579
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1085 place count 342 transition count 579
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1085 place count 342 transition count 529
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 1185 place count 292 transition count 529
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1196 place count 281 transition count 513
Iterating global reduction 4 with 11 rules applied. Total rules applied 1207 place count 281 transition count 513
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 1210 place count 281 transition count 510
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1213 place count 278 transition count 510
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1221 place count 270 transition count 500
Iterating global reduction 6 with 8 rules applied. Total rules applied 1229 place count 270 transition count 500
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1235 place count 270 transition count 494
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1237 place count 268 transition count 482
Iterating global reduction 7 with 2 rules applied. Total rules applied 1239 place count 268 transition count 482
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 1240 place count 268 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1241 place count 267 transition count 481
Performed 142 Post agglomeration using F-continuation condition with reduction of 98 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 1525 place count 125 transition count 241
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 1538 place count 125 transition count 228
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 1540 place count 124 transition count 227
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1543 place count 121 transition count 224
Iterating global reduction 11 with 3 rules applied. Total rules applied 1546 place count 121 transition count 224
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 1572 place count 108 transition count 208
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1584 place count 108 transition count 196
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 1650 place count 75 transition count 226
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 12 with 27 rules applied. Total rules applied 1677 place count 75 transition count 199
Discarding 21 places :
Symmetric choice reduction at 13 with 21 rule applications. Total rules 1698 place count 54 transition count 157
Iterating global reduction 13 with 21 rules applied. Total rules applied 1719 place count 54 transition count 157
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 1731 place count 54 transition count 145
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 1737 place count 48 transition count 133
Iterating global reduction 14 with 6 rules applied. Total rules applied 1743 place count 48 transition count 133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1749 place count 48 transition count 127
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1750 place count 48 transition count 126
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1751 place count 48 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1752 place count 47 transition count 125
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1753 place count 47 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1754 place count 46 transition count 124
Applied a total of 1754 rules in 50 ms. Remains 46 /1510 variables (removed 1464) and now considering 124/1936 (removed 1812) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 46/1510 places, 124/1936 transitions.
Finished random walk after 27 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
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 254 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 144 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
[2023-03-07 20:01:19] [INFO ] Invariant cache hit.
[2023-03-07 20:01:20] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-07 20:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 20:01:21] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2023-03-07 20:01:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 20:01:21] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-07 20:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 20:01:22] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2023-03-07 20:01:22] [INFO ] Computed and/alt/rep : 1929/2358/1929 causal constraints (skipped 6 transitions) in 95 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:605)
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:261)
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-07 20:01:36] [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 p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, true]
Product exploration explored 100000 steps with 1084 reset in 167 ms.
Product exploration explored 100000 steps with 1112 reset in 179 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 128 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.1 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 1 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 0 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 1 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 0 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 0 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 0 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 1 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 1 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 1 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 0 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 0 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 201 ms. Remains 253 /1510 variables (removed 1257) and now considering 512/1936 (removed 1424) transitions.
[2023-03-07 20:01:37] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-07 20:01:37] [INFO ] Flow matrix only has 455 transitions (discarded 57 similar events)
// Phase 1: matrix 455 rows 253 cols
[2023-03-07 20:01:37] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-07 20:01:37] [INFO ] Dead Transitions using invariants and state equation in 158 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 402 ms. Remains : 253/1510 places, 512/1936 transitions.
Built C files in :
/tmp/ltsmin11362264350042730171
[2023-03-07 20:01:37] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11362264350042730171
Running compilation step : cd /tmp/ltsmin11362264350042730171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11362264350042730171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11362264350042730171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 53 ms. Remains 1510 /1510 variables (removed 0) and now considering 1936/1936 (removed 0) transitions.
// Phase 1: matrix 1936 rows 1510 cols
[2023-03-07 20:01:40] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-07 20:01:40] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-07 20:01:40] [INFO ] Invariant cache hit.
[2023-03-07 20:01:41] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
[2023-03-07 20:01:41] [INFO ] Invariant cache hit.
[2023-03-07 20:01:42] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2071 ms. Remains : 1510/1510 places, 1936/1936 transitions.
Built C files in :
/tmp/ltsmin2295623959831011147
[2023-03-07 20:01:42] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2295623959831011147
Running compilation step : cd /tmp/ltsmin2295623959831011147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2295623959831011147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2295623959831011147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-07 20:01:45] [INFO ] Flatten gal took : 50 ms
[2023-03-07 20:01:45] [INFO ] Flatten gal took : 62 ms
[2023-03-07 20:01:45] [INFO ] Time to serialize gal into /tmp/LTL8722037821026052376.gal : 12 ms
[2023-03-07 20:01:45] [INFO ] Time to serialize properties into /tmp/LTL3782535915024177115.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8722037821026052376.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10906595578835011478.hoa' '-atoms' '/tmp/LTL3782535915024177115.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3782535915024177115.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10906595578835011478.hoa
Detected timeout of ITS tools.
[2023-03-07 20:02:00] [INFO ] Flatten gal took : 31 ms
[2023-03-07 20:02:00] [INFO ] Flatten gal took : 31 ms
[2023-03-07 20:02:00] [INFO ] Time to serialize gal into /tmp/LTL5821831893340937319.gal : 6 ms
[2023-03-07 20:02:00] [INFO ] Time to serialize properties into /tmp/LTL16192257923621291113.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5821831893340937319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16192257923621291113.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(G(!("((p572==1)&&(p1681==1))"))))U(("(p2119==1)")&&(X(G(!("((p572==1)&&(p1681==1))"))))))))
Formula 0 simplified : X(!"(p2119==1)" W XF"((p572==1)&&(p1681==1))")
Detected timeout of ITS tools.
[2023-03-07 20:02:16] [INFO ] Flatten gal took : 31 ms
[2023-03-07 20:02:16] [INFO ] Applying decomposition
[2023-03-07 20:02:16] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph854491672458733073.txt' '-o' '/tmp/graph854491672458733073.bin' '-w' '/tmp/graph854491672458733073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph854491672458733073.bin' '-l' '-1' '-v' '-w' '/tmp/graph854491672458733073.weights' '-q' '0' '-e' '0.001'
[2023-03-07 20:02:16] [INFO ] Decomposing Gal with order
[2023-03-07 20:02:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 20:02:16] [INFO ] Removed a total of 520 redundant transitions.
[2023-03-07 20:02:16] [INFO ] Flatten gal took : 72 ms
[2023-03-07 20:02:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 22 ms.
[2023-03-07 20:02:16] [INFO ] Time to serialize gal into /tmp/LTL3475397276849074174.gal : 15 ms
[2023-03-07 20:02:16] [INFO ] Time to serialize properties into /tmp/LTL9152578342837174612.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3475397276849074174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9152578342837174612.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((X(G(!("((i19.i0.i0.u73.p572==1)&&(i27.i2.i3.u403.p1681==1))"))))U(("(i33.i1.i2.u512.p2119==1)")&&(X(G(!("((i19.i0.i0.u73.p572==1...193
Formula 0 simplified : X(!"(i33.i1.i2.u512.p2119==1)" W XF"((i19.i0.i0.u73.p572==1)&&(i27.i2.i3.u403.p1681==1))")
Reverse transition relation is NOT exact ! Due to transitions t26, t216, t270, t332, t381, t452, t674, t755, t786, t815, t864, t1181, t1233, t1293, t1343, ...2105
Computing Next relation with stutter on 33680 deadlock states
37 unique states visited
37 strongly connected components in search stack
37 transitions explored
37 items max in DFS search stack
861 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.78279,296932,1,0,504696,7295,22106,1.06977e+06,664,42882,1894803
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-303-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-303-LTLFireability-03 finished in 101955 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 0 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 1 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 0 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 72 ms. Remains 114 /1549 variables (removed 1435) and now considering 262/1982 (removed 1720) transitions.
[2023-03-07 20:02:26] [INFO ] Flow matrix only has 206 transitions (discarded 56 similar events)
// Phase 1: matrix 206 rows 114 cols
[2023-03-07 20:02:26] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 20:02:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-07 20:02:26] [INFO ] Flow matrix only has 206 transitions (discarded 56 similar events)
[2023-03-07 20:02:26] [INFO ] Invariant cache hit.
[2023-03-07 20:02:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 20:02:27] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [41, 42, 75]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 155 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 4 ms. Remains 108 /111 variables (removed 3) and now considering 259/262 (removed 3) transitions.
[2023-03-07 20:02:27] [INFO ] Flow matrix only has 203 transitions (discarded 56 similar events)
// Phase 1: matrix 203 rows 108 cols
[2023-03-07 20:02:27] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-07 20:02:27] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-07 20:02:27] [INFO ] Flow matrix only has 203 transitions (discarded 56 similar events)
[2023-03-07 20:02:27] [INFO ] Invariant cache hit.
[2023-03-07 20:02:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 20:02:27] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 130 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 362 ms. Remains : 108/1549 places, 259/1982 transitions.
Stuttering acceptance computed with spot in 31 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 117 steps with 13 reset in 2 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-04 finished in 420 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 486 ms. Remains 1514 /1549 variables (removed 35) and now considering 1938/1982 (removed 44) transitions.
// Phase 1: matrix 1938 rows 1514 cols
[2023-03-07 20:02:27] [INFO ] Computed 3 place invariants in 14 ms
[2023-03-07 20:02:27] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-07 20:02:27] [INFO ] Invariant cache hit.
[2023-03-07 20:02:28] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2023-03-07 20:02:28] [INFO ] Invariant cache hit.
[2023-03-07 20:02:29] [INFO ] Dead Transitions using invariants and state equation in 719 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 2380 ms. Remains : 1514/1549 places, 1938/1982 transitions.
Stuttering acceptance computed with spot in 678 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 22284 reset in 514 ms.
Product exploration explored 100000 steps with 22274 reset in 550 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 5054 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 612 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 103 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :5
Running SMT prover for 9 properties.
[2023-03-07 20:02:38] [INFO ] Invariant cache hit.
[2023-03-07 20:02:38] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 21 ms returned sat
[2023-03-07 20:02:39] [INFO ] After 1356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-07 20:02:40] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-07 20:02:41] [INFO ] After 1342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-07 20:02:42] [INFO ] After 2490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 813 ms.
[2023-03-07 20:02:43] [INFO ] After 3896ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 24 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 0 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 41 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 42 ms. Remains : 53/1514 places, 136/1938 transitions.
Incomplete random walk after 10000 steps, including 1361 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 296 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-07 20:02:43] [INFO ] Flow matrix only has 124 transitions (discarded 12 similar events)
// Phase 1: matrix 124 rows 53 cols
[2023-03-07 20:02:43] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-07 20:02:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 20:02:43] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-07 20:02:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 20:02:43] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-07 20:02:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-07 20:02:44] [INFO ] After 24ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-07 20:02:44] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-07 20:02:44] [INFO ] After 148ms 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 5 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 2 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 2 ms. Remains : 53/53 places, 136/136 transitions.
Incomplete random walk after 10000 steps, including 1367 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 315 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Probably explored full state space saw : 7808 states, properties seen :1
Probabilistic random walk after 29132 steps, saw 7808 distinct states, run finished after 85 ms. (steps per millisecond=342 ) properties seen :1
Explored full state space saw : 7808 states, properties seen :0
Exhaustive walk after 29132 steps, saw 7808 distinct states, run finished after 90 ms. (steps per millisecond=323 ) 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 6213 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 640 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 644 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-07 20:02:51] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-07 20:02:52] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-07 20:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 20:02:54] [INFO ] [Real]Absence check using state equation in 1896 ms returned sat
[2023-03-07 20:02:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 20:02:55] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-07 20:02:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 20:02:57] [INFO ] [Nat]Absence check using state equation in 2343 ms returned sat
[2023-03-07 20:02:57] [INFO ] Computed and/alt/rep : 1931/2357/1931 causal constraints (skipped 6 transitions) in 103 ms.
[2023-03-07 20:03:09] [INFO ] Added : 625 causal constraints over 125 iterations in 12063 ms. Result :unknown
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-07 20:03:09] [INFO ] Invariant cache hit.
[2023-03-07 20:03:09] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-07 20:03:09] [INFO ] Invariant cache hit.
[2023-03-07 20:03:10] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2023-03-07 20:03:10] [INFO ] Invariant cache hit.
[2023-03-07 20:03:11] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1997 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.4 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 9708 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 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))]
Incomplete random walk after 10000 steps, including 104 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 217916 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217916 steps, saw 58337 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-07 20:03:25] [INFO ] Invariant cache hit.
[2023-03-07 20:03:26] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 19 ms returned sat
[2023-03-07 20:03:27] [INFO ] After 1342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-07 20:03:27] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 19 ms returned sat
[2023-03-07 20:03:29] [INFO ] After 1607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-07 20:03:30] [INFO ] After 2951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 904 ms.
[2023-03-07 20:03:31] [INFO ] After 4469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 58 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 42 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 42 ms. Remains : 53/1514 places, 136/1938 transitions.
Incomplete random walk after 10000 steps, including 1365 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 319 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-07 20:03:31] [INFO ] Flow matrix only has 124 transitions (discarded 12 similar events)
// Phase 1: matrix 124 rows 53 cols
[2023-03-07 20:03:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-07 20:03:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-07 20:03:31] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 20:03:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-07 20:03:31] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 20:03:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-07 20:03:31] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 20:03:31] [INFO ] After 25ms 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-07 20:03:32] [INFO ] After 94ms 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 3 ms. Remains : 51/53 places, 133/136 transitions.
Incomplete random walk after 10000 steps, including 1406 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished Best-First random walk after 9164 steps, including 256 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1527 )
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 10209 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 607 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 553 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-07 20:03:43] [INFO ] Computed 3 place invariants in 11 ms
[2023-03-07 20:03:44] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-07 20:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 20:03:45] [INFO ] [Real]Absence check using state equation in 1939 ms returned sat
[2023-03-07 20:03:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 20:03:46] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-07 20:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 20:03:49] [INFO ] [Nat]Absence check using state equation in 2443 ms returned sat
[2023-03-07 20:03:49] [INFO ] Computed and/alt/rep : 1931/2357/1931 causal constraints (skipped 6 transitions) in 102 ms.
[2023-03-07 20:04:01] [INFO ] Added : 605 causal constraints over 121 iterations in 11966 ms. Result :unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 559 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 22227 reset in 489 ms.
Product exploration explored 100000 steps with 22220 reset in 478 ms.
Built C files in :
/tmp/ltsmin13295495127238403031
[2023-03-07 20:04:02] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13295495127238403031
Running compilation step : cd /tmp/ltsmin13295495127238403031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13295495127238403031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13295495127238403031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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-07 20:04:06] [INFO ] Invariant cache hit.
[2023-03-07 20:04:06] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-07 20:04:06] [INFO ] Invariant cache hit.
[2023-03-07 20:04:07] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2023-03-07 20:04:07] [INFO ] Invariant cache hit.
[2023-03-07 20:04:08] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2055 ms. Remains : 1514/1514 places, 1938/1938 transitions.
Built C files in :
/tmp/ltsmin17980716568145010077
[2023-03-07 20:04:08] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17980716568145010077
Running compilation step : cd /tmp/ltsmin17980716568145010077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17980716568145010077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17980716568145010077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-07 20:04:11] [INFO ] Flatten gal took : 30 ms
[2023-03-07 20:04:11] [INFO ] Flatten gal took : 31 ms
[2023-03-07 20:04:11] [INFO ] Time to serialize gal into /tmp/LTL5525419273845590964.gal : 5 ms
[2023-03-07 20:04:11] [INFO ] Time to serialize properties into /tmp/LTL8803712199810129181.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5525419273845590964.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5893133264595881523.hoa' '-atoms' '/tmp/LTL8803712199810129181.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8803712199810129181.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5893133264595881523.hoa
Detected timeout of ITS tools.
[2023-03-07 20:04:26] [INFO ] Flatten gal took : 33 ms
[2023-03-07 20:04:26] [INFO ] Flatten gal took : 30 ms
[2023-03-07 20:04:26] [INFO ] Time to serialize gal into /tmp/LTL17801183848387510565.gal : 15 ms
[2023-03-07 20:04:26] [INFO ] Time to serialize properties into /tmp/LTL2221657200686437781.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17801183848387510565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2221657200686437781.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(((X(X("(p1004!=1)")))||(("(p1637==1)")&&(G("(p78!=1)"))))U("((p572==1)&&(p1864==1))")))))
Formula 0 simplified : GF((XX!"(p1004!=1)" & (!"(p1637==1)" | F!"(p78!=1)")) R !"((p572==1)&&(p1864==1))")
Detected timeout of ITS tools.
[2023-03-07 20:04:41] [INFO ] Flatten gal took : 45 ms
[2023-03-07 20:04:41] [INFO ] Applying decomposition
[2023-03-07 20:04:41] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14861733084518787608.txt' '-o' '/tmp/graph14861733084518787608.bin' '-w' '/tmp/graph14861733084518787608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14861733084518787608.bin' '-l' '-1' '-v' '-w' '/tmp/graph14861733084518787608.weights' '-q' '0' '-e' '0.001'
[2023-03-07 20:04:41] [INFO ] Decomposing Gal with order
[2023-03-07 20:04:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 20:04:41] [INFO ] Removed a total of 518 redundant transitions.
[2023-03-07 20:04:41] [INFO ] Flatten gal took : 67 ms
[2023-03-07 20:04:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 17 ms.
[2023-03-07 20:04:41] [INFO ] Time to serialize gal into /tmp/LTL12744977769398068577.gal : 17 ms
[2023-03-07 20:04:41] [INFO ] Time to serialize properties into /tmp/LTL17281261326288440548.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12744977769398068577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17281261326288440548.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G(((X(X("(i17.i1.i2.u226.p1004!=1)")))||(("(i28.i0.i1.u386.p1637==1)")&&(G("(i0.u15.p78!=1)"))))U("((i8.i0.i0.u100.p572==1)&&(i28...183
Formula 0 simplified : GF((XX!"(i17.i1.i2.u226.p1004!=1)" & (!"(i28.i0.i1.u386.p1637==1)" | F!"(i0.u15.p78!=1)")) R !"((i8.i0.i0.u100.p572==1)&&(i28.i0.i6....172
Reverse transition relation is NOT exact ! Due to transitions t26, t187, t216, t270, t301, t381, t452, t674, t703, t755, t815, t864, t1181, t1233, t1264, t...2017
Computing Next relation with stutter on 33680 deadlock states
40 unique states visited
40 strongly connected components in search stack
41 transitions explored
40 items max in DFS search stack
479 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.96826,182748,1,0,314701,6147,21466,595793,508,33856,1199997
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-303-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-303-LTLFireability-05 finished in 140533 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 501 ms. Remains 1504 /1549 variables (removed 45) and now considering 1927/1982 (removed 55) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2023-03-07 20:04:48] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-07 20:04:48] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-07 20:04:48] [INFO ] Invariant cache hit.
[2023-03-07 20:04:49] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
[2023-03-07 20:04:49] [INFO ] Invariant cache hit.
[2023-03-07 20:04:50] [INFO ] Dead Transitions using invariants and state equation in 774 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 2472 ms. Remains : 1504/1549 places, 1927/1982 transitions.
Stuttering acceptance computed with spot in 304 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 53 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-303-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-303-LTLFireability-06 finished in 2806 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 2 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.2 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 0 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 0 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 85 ms. Remains 115 /1549 variables (removed 1434) and now considering 263/1982 (removed 1719) transitions.
[2023-03-07 20:04:50] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 115 cols
[2023-03-07 20:04:50] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 20:04:50] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-07 20:04:50] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2023-03-07 20:04:50] [INFO ] Invariant cache hit.
[2023-03-07 20:04:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 20:04:50] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [44, 45, 78]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 157 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 5 ms. Remains 109 /112 variables (removed 3) and now considering 260/263 (removed 3) transitions.
[2023-03-07 20:04:50] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 109 cols
[2023-03-07 20:04:50] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 20:04:50] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-07 20:04:50] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2023-03-07 20:04:50] [INFO ] Invariant cache hit.
[2023-03-07 20:04:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 20:04:50] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/1549 places, 260/1982 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 388 ms. Remains : 109/1549 places, 260/1982 transitions.
Stuttering acceptance computed with spot in 122 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 533 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 493 ms. Remains 1506 /1549 variables (removed 43) and now considering 1929/1982 (removed 53) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2023-03-07 20:04:51] [INFO ] Computed 3 place invariants in 14 ms
[2023-03-07 20:04:51] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-07 20:04:51] [INFO ] Invariant cache hit.
[2023-03-07 20:04:52] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
[2023-03-07 20:04:52] [INFO ] Invariant cache hit.
[2023-03-07 20:04:53] [INFO ] Dead Transitions using invariants and state equation in 754 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 2452 ms. Remains : 1506/1549 places, 1929/1982 transitions.
Stuttering acceptance computed with spot in 457 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 871 ms.
Product exploration explored 100000 steps with 50000 reset in 870 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 313 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 5015 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 494 ms. Remains 1506 /1549 variables (removed 43) and now considering 1929/1982 (removed 53) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2023-03-07 20:04:56] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-07 20:04:56] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-07 20:04:56] [INFO ] Invariant cache hit.
[2023-03-07 20:04:57] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2023-03-07 20:04:57] [INFO ] Invariant cache hit.
[2023-03-07 20:04:58] [INFO ] Dead Transitions using invariants and state equation in 748 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 2440 ms. Remains : 1506/1549 places, 1929/1982 transitions.
Stuttering acceptance computed with spot in 130 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 2599 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 464 ms. Remains 1506 /1549 variables (removed 43) and now considering 1929/1982 (removed 53) transitions.
// Phase 1: matrix 1929 rows 1506 cols
[2023-03-07 20:04:59] [INFO ] Computed 3 place invariants in 14 ms
[2023-03-07 20:04:59] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-07 20:04:59] [INFO ] Invariant cache hit.
[2023-03-07 20:05:00] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2023-03-07 20:05:00] [INFO ] Invariant cache hit.
[2023-03-07 20:05:01] [INFO ] Dead Transitions using invariants and state equation in 793 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 2415 ms. Remains : 1506/1549 places, 1929/1982 transitions.
Stuttering acceptance computed with spot in 268 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 91 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 2719 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 482 ms. Remains 1505 /1549 variables (removed 44) and now considering 1928/1982 (removed 54) transitions.
// Phase 1: matrix 1928 rows 1505 cols
[2023-03-07 20:05:01] [INFO ] Computed 3 place invariants in 14 ms
[2023-03-07 20:05:02] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-07 20:05:02] [INFO ] Invariant cache hit.
[2023-03-07 20:05:03] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
[2023-03-07 20:05:03] [INFO ] Invariant cache hit.
[2023-03-07 20:05:03] [INFO ] Dead Transitions using invariants and state equation in 766 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 2473 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 2575 ms.
All properties solved by simple procedures.
Total runtime 341419 ms.

BK_STOP 1678219505058

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r101-tall-167814474800020"
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 ;