About the Execution of ITS-Tools for CloudReconfiguration-PT-315
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 983.308 | 232610.00 | 337970.00 | 1157.60 | FTTFTFFFFFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r042-smll-165252095600324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CloudReconfiguration-PT-315, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095600324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.0K Apr 29 14:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 14:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 14:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 14:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 660K May 10 09:33 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-315-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-315-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652678884087
Running Version 202205111006
[2022-05-16 05:28:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 05:28:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 05:28:07] [INFO ] Load time of PNML (sax parser for PT used): 498 ms
[2022-05-16 05:28:07] [INFO ] Transformed 2585 places.
[2022-05-16 05:28:07] [INFO ] Transformed 3095 transitions.
[2022-05-16 05:28:07] [INFO ] Found NUPN structural information;
[2022-05-16 05:28:07] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 762 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-315-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 519 places :
Symmetric choice reduction at 0 with 519 rule applications. Total rules 519 place count 2066 transition count 2576
Iterating global reduction 0 with 519 rules applied. Total rules applied 1038 place count 2066 transition count 2576
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1067 place count 2066 transition count 2547
Discarding 236 places :
Symmetric choice reduction at 1 with 236 rule applications. Total rules 1303 place count 1830 transition count 2311
Iterating global reduction 1 with 236 rules applied. Total rules applied 1539 place count 1830 transition count 2311
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 1630 place count 1739 transition count 2220
Iterating global reduction 1 with 91 rules applied. Total rules applied 1721 place count 1739 transition count 2220
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1738 place count 1739 transition count 2203
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 1788 place count 1689 transition count 2153
Iterating global reduction 2 with 50 rules applied. Total rules applied 1838 place count 1689 transition count 2153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1847 place count 1689 transition count 2144
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1887 place count 1649 transition count 2099
Iterating global reduction 3 with 40 rules applied. Total rules applied 1927 place count 1649 transition count 2099
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1956 place count 1620 transition count 2070
Iterating global reduction 3 with 29 rules applied. Total rules applied 1985 place count 1620 transition count 2070
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 2012 place count 1593 transition count 2043
Iterating global reduction 3 with 27 rules applied. Total rules applied 2039 place count 1593 transition count 2043
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 2066 place count 1566 transition count 2016
Iterating global reduction 3 with 27 rules applied. Total rules applied 2093 place count 1566 transition count 2016
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 2116 place count 1543 transition count 1979
Iterating global reduction 3 with 23 rules applied. Total rules applied 2139 place count 1543 transition count 1979
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2147 place count 1535 transition count 1966
Iterating global reduction 3 with 8 rules applied. Total rules applied 2155 place count 1535 transition count 1966
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2163 place count 1527 transition count 1955
Iterating global reduction 3 with 8 rules applied. Total rules applied 2171 place count 1527 transition count 1955
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2173 place count 1527 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2176 place count 1524 transition count 1950
Iterating global reduction 4 with 3 rules applied. Total rules applied 2179 place count 1524 transition count 1950
Applied a total of 2179 rules in 3157 ms. Remains 1524 /2585 variables (removed 1061) and now considering 1950/3095 (removed 1145) transitions.
// Phase 1: matrix 1950 rows 1524 cols
[2022-05-16 05:28:10] [INFO ] Computed 4 place invariants in 48 ms
[2022-05-16 05:28:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:28:12] [INFO ] Implicit Places using invariants in 1312 ms returned []
// Phase 1: matrix 1950 rows 1524 cols
[2022-05-16 05:28:12] [INFO ] Computed 4 place invariants in 13 ms
[2022-05-16 05:28:12] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
// Phase 1: matrix 1950 rows 1524 cols
[2022-05-16 05:28:12] [INFO ] Computed 4 place invariants in 12 ms
[2022-05-16 05:28:14] [INFO ] Dead Transitions using invariants and state equation in 1487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1524/2585 places, 1950/3095 transitions.
Finished structural reductions, in 1 iterations. Remains : 1524/2585 places, 1950/3095 transitions.
Support contains 27 out of 1524 places after structural reductions.
[2022-05-16 05:28:14] [INFO ] Flatten gal took : 225 ms
[2022-05-16 05:28:14] [INFO ] Flatten gal took : 127 ms
[2022-05-16 05:28:15] [INFO ] Input system was already deterministic with 1950 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 1040 ms. (steps per millisecond=9 ) properties (out of 29) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 1950 rows 1524 cols
[2022-05-16 05:28:16] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-16 05:28:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2022-05-16 05:28:19] [INFO ] After 1230ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:21
[2022-05-16 05:28:19] [INFO ] After 1416ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:21
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-16 05:28:19] [INFO ] After 2882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:21
[2022-05-16 05:28:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2022-05-16 05:28:24] [INFO ] After 2910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2022-05-16 05:28:27] [INFO ] After 6050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 2402 ms.
[2022-05-16 05:28:29] [INFO ] After 9990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 19 properties in 407 ms.
Support contains 3 out of 1524 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Graph (trivial) has 1854 edges and 1524 vertex of which 682 / 1524 are part of one of the 62 SCC in 11 ms
Free SCC test removed 620 places
Drop transitions removed 782 transitions
Reduce isomorphic transitions removed 782 transitions.
Graph (complete) has 1342 edges and 904 vertex of which 895 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Discarding 9 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 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 507 rules applied. Total rules applied 509 place count 895 transition count 657
Reduce places removed 500 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 560 rules applied. Total rules applied 1069 place count 395 transition count 597
Reduce places removed 39 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 2 with 41 rules applied. Total rules applied 1110 place count 356 transition count 595
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 1113 place count 355 transition count 593
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 4 rules applied. Total rules applied 1117 place count 354 transition count 590
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 5 rules applied. Total rules applied 1122 place count 352 transition count 587
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1125 place count 349 transition count 587
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 49 Pre rules applied. Total rules applied 1125 place count 349 transition count 538
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1223 place count 300 transition count 538
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1234 place count 289 transition count 522
Iterating global reduction 7 with 11 rules applied. Total rules applied 1245 place count 289 transition count 522
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 3 rules applied. Total rules applied 1248 place count 289 transition count 519
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1251 place count 286 transition count 519
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1258 place count 279 transition count 510
Iterating global reduction 9 with 7 rules applied. Total rules applied 1265 place count 279 transition count 510
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1270 place count 279 transition count 505
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1272 place count 277 transition count 497
Iterating global reduction 10 with 2 rules applied. Total rules applied 1274 place count 277 transition count 497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1275 place count 277 transition count 496
Performed 146 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 11 with 292 rules applied. Total rules applied 1567 place count 131 transition count 254
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 1582 place count 131 transition count 239
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1586 place count 127 transition count 235
Iterating global reduction 12 with 4 rules applied. Total rules applied 1590 place count 127 transition count 235
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1591 place count 126 transition count 234
Iterating global reduction 12 with 1 rules applied. Total rules applied 1592 place count 126 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1593 place count 126 transition count 233
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 13 with 24 rules applied. Total rules applied 1617 place count 114 transition count 218
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 13 with 15 rules applied. Total rules applied 1632 place count 114 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1634 place count 113 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1636 place count 113 transition count 200
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 15 with 2 rules applied. Total rules applied 1638 place count 112 transition count 199
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1639 place count 112 transition count 198
Performed 32 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 16 with 64 rules applied. Total rules applied 1703 place count 80 transition count 230
Drop transitions removed 20 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 16 with 46 rules applied. Total rules applied 1749 place count 80 transition count 184
Discarding 23 places :
Symmetric choice reduction at 17 with 23 rule applications. Total rules 1772 place count 57 transition count 154
Iterating global reduction 17 with 23 rules applied. Total rules applied 1795 place count 57 transition count 154
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 17 with 14 rules applied. Total rules applied 1809 place count 57 transition count 140
Discarding 6 places :
Symmetric choice reduction at 18 with 6 rule applications. Total rules 1815 place count 51 transition count 128
Iterating global reduction 18 with 6 rules applied. Total rules applied 1821 place count 51 transition count 128
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 1827 place count 51 transition count 122
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 19 with 17 rules applied. Total rules applied 1844 place count 51 transition count 105
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 1846 place count 49 transition count 101
Iterating global reduction 19 with 2 rules applied. Total rules applied 1848 place count 49 transition count 101
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1849 place count 48 transition count 100
Iterating global reduction 19 with 1 rules applied. Total rules applied 1850 place count 48 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1851 place count 48 transition count 99
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 1853 place count 48 transition count 97
Free-agglomeration rule applied 3 times.
Iterating global reduction 20 with 3 rules applied. Total rules applied 1856 place count 48 transition count 94
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 1860 place count 45 transition count 93
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 21 with 5 rules applied. Total rules applied 1865 place count 45 transition count 93
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 1868 place count 45 transition count 90
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 1869 place count 44 transition count 89
Iterating global reduction 21 with 1 rules applied. Total rules applied 1870 place count 44 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 1871 place count 43 transition count 88
Applied a total of 1871 rules in 262 ms. Remains 43 /1524 variables (removed 1481) and now considering 88/1950 (removed 1862) transitions.
Finished structural reductions, in 1 iterations. Remains : 43/1524 places, 88/1950 transitions.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-16 05:28:30] [INFO ] Flow matrix only has 83 transitions (discarded 5 similar events)
// Phase 1: matrix 83 rows 43 cols
[2022-05-16 05:28:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 05:28:30] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 05:28:30] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-16 05:28:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 05:28:30] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 05:28:30] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 05:28:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 05:28:30] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 05:28:30] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-16 05:28:30] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2022-05-16 05:28:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-16 05:28:30] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2022-05-16 05:28:30] [INFO ] After 155ms 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 2 atomic propositions for a total of 14 simplifications.
FORMULA CloudReconfiguration-PT-315-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-315-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2128 edges and 1524 vertex of which 1515 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.28 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(p0))&&(G(p1)||p2)))))'
Support contains 2 out of 1524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1515 transition count 1941
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1515 transition count 1941
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1510 transition count 1935
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1510 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1509 transition count 1932
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1508 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1508 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 34 place count 1508 transition count 1930
Applied a total of 34 rules in 332 ms. Remains 1508 /1524 variables (removed 16) and now considering 1930/1950 (removed 20) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:28:31] [INFO ] Computed 4 place invariants in 15 ms
[2022-05-16 05:28:32] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:28:32] [INFO ] Computed 4 place invariants in 11 ms
[2022-05-16 05:28:32] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:28:32] [INFO ] Computed 4 place invariants in 20 ms
[2022-05-16 05:28:34] [INFO ] Dead Transitions using invariants and state equation in 1854 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1524 places, 1930/1950 transitions.
Finished structural reductions, in 1 iterations. Remains : 1508/1524 places, 1930/1950 transitions.
Stuttering acceptance computed with spot in 648 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND p2 (NOT p1)), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}]], initial=0, aps=[p2:(EQ s1381 0), p1:(EQ s1381 1), p0:(EQ s1109 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20014 reset in 1064 ms.
Product exploration explored 100000 steps with 20042 reset in 941 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.13 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (OR p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 530 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) p2), (NOT p0)]
Incomplete random walk after 10000 steps, including 77 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:28:39] [INFO ] Computed 4 place invariants in 17 ms
[2022-05-16 05:28:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 19 ms returned sat
[2022-05-16 05:28:40] [INFO ] After 1601ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-16 05:28:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 15 ms returned sat
[2022-05-16 05:28:41] [INFO ] After 1259ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (OR p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (G (NOT (AND p1 p2))), (G (OR p1 p2)), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT p0)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 13 factoid took 897 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, (NOT p0), p2, (NOT p0)]
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, (NOT p0), p2, (NOT p0)]
Support contains 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Applied a total of 0 rules in 106 ms. Remains 1508 /1508 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:28:43] [INFO ] Computed 4 place invariants in 21 ms
[2022-05-16 05:28:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:28:44] [INFO ] Implicit Places using invariants in 556 ms returned []
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:28:44] [INFO ] Computed 4 place invariants in 26 ms
[2022-05-16 05:28:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:28:45] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1557 ms to find 0 implicit places.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:28:45] [INFO ] Computed 4 place invariants in 15 ms
[2022-05-16 05:28:45] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:28:47] [INFO ] Dead Transitions using invariants and state equation in 2285 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1508/1508 places, 1930/1930 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.14 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X p2)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, (NOT p0), p2, (NOT p0)]
Finished random walk after 4384 steps, including 34 resets, run visited all 3 properties in 101 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X p2)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 420 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, (NOT p0), p2, (NOT p0)]
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, (NOT p0), p2, (NOT p0)]
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, (NOT p0), p2, (NOT p0)]
Product exploration explored 100000 steps with 20013 reset in 1005 ms.
Product exploration explored 100000 steps with 19900 reset in 767 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, (NOT p0), p2, (NOT p0)]
Support contains 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Graph (trivial) has 1838 edges and 1508 vertex of which 680 / 1508 are part of one of the 63 SCC in 5 ms
Free SCC test removed 617 places
Ensure Unique test removed 717 transitions
Reduce isomorphic transitions removed 717 transitions.
Graph (complete) has 1386 edges and 891 vertex of which 882 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 480 rules applied. Total rules applied 482 place count 882 transition count 1208
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 495 place count 882 transition count 1195
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 495 place count 882 transition count 1208
Deduced a syphon composed of 503 places in 1 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 518 place count 882 transition count 1208
Discarding 284 places :
Symmetric choice reduction at 2 with 284 rule applications. Total rules 802 place count 598 transition count 914
Deduced a syphon composed of 233 places in 1 ms
Iterating global reduction 2 with 284 rules applied. Total rules applied 1086 place count 598 transition count 914
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1096 place count 588 transition count 900
Deduced a syphon composed of 231 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1106 place count 588 transition count 900
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1110 place count 588 transition count 896
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1120 place count 578 transition count 886
Deduced a syphon composed of 223 places in 2 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 1130 place count 578 transition count 886
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1132 place count 576 transition count 882
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1134 place count 576 transition count 882
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1136 place count 574 transition count 878
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1138 place count 574 transition count 878
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1142 place count 570 transition count 874
Deduced a syphon composed of 221 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1146 place count 570 transition count 874
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1148 place count 568 transition count 870
Deduced a syphon composed of 221 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1150 place count 568 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1152 place count 566 transition count 866
Deduced a syphon composed of 221 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1154 place count 566 transition count 866
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1158 place count 562 transition count 860
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1162 place count 562 transition count 860
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1166 place count 558 transition count 844
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1170 place count 558 transition count 844
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1171 place count 558 transition count 844
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1175 place count 554 transition count 840
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1179 place count 554 transition count 840
Performed 107 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 323 places in 1 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1286 place count 554 transition count 915
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1325 place count 554 transition count 876
Discarding 102 places :
Symmetric choice reduction at 5 with 102 rule applications. Total rules 1427 place count 452 transition count 765
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 5 with 102 rules applied. Total rules applied 1529 place count 452 transition count 765
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1534 place count 447 transition count 757
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 1539 place count 447 transition count 757
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 232 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1546 place count 447 transition count 757
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1550 place count 447 transition count 753
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1565 place count 432 transition count 734
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1580 place count 432 transition count 734
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1586 place count 432 transition count 728
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1590 place count 428 transition count 724
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1594 place count 428 transition count 724
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1597 place count 428 transition count 724
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1603 place count 428 transition count 718
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1606 place count 425 transition count 715
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1609 place count 425 transition count 715
Performed 73 Post agglomeration using F-continuation condition with reduction of 127 identical transitions.
Deduced a syphon composed of 290 places in 1 ms
Iterating global reduction 8 with 73 rules applied. Total rules applied 1682 place count 425 transition count 1058
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 8 with 119 rules applied. Total rules applied 1801 place count 425 transition count 939
Discarding 128 places :
Symmetric choice reduction at 9 with 128 rule applications. Total rules 1929 place count 297 transition count 593
Deduced a syphon composed of 171 places in 1 ms
Iterating global reduction 9 with 128 rules applied. Total rules applied 2057 place count 297 transition count 593
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 2074 place count 297 transition count 576
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2101 place count 270 transition count 519
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2128 place count 270 transition count 519
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2130 place count 270 transition count 551
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2132 place count 268 transition count 533
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2134 place count 268 transition count 533
Deduced a syphon composed of 144 places in 0 ms
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 10 with 45 rules applied. Total rules applied 2179 place count 268 transition count 488
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2183 place count 264 transition count 484
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2187 place count 264 transition count 484
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2190 place count 264 transition count 544
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2193 place count 261 transition count 529
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2196 place count 261 transition count 529
Deduced a syphon composed of 140 places in 1 ms
Applied a total of 2196 rules in 767 ms. Remains 261 /1508 variables (removed 1247) and now considering 529/1930 (removed 1401) transitions.
[2022-05-16 05:28:52] [INFO ] Redundant transitions in 65 ms returned []
[2022-05-16 05:28:52] [INFO ] Flow matrix only has 472 transitions (discarded 57 similar events)
// Phase 1: matrix 472 rows 261 cols
[2022-05-16 05:28:52] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 05:28:52] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 261/1508 places, 529/1930 transitions.
Finished structural reductions, in 1 iterations. Remains : 261/1508 places, 529/1930 transitions.
Product exploration explored 100000 steps with 20071 reset in 1503 ms.
Product exploration explored 100000 steps with 20038 reset in 1376 ms.
Built C files in :
/tmp/ltsmin14779483494271786799
[2022-05-16 05:28:55] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14779483494271786799
Running compilation step : cd /tmp/ltsmin14779483494271786799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin14779483494271786799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin14779483494271786799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Applied a total of 0 rules in 105 ms. Remains 1508 /1508 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:28:59] [INFO ] Computed 4 place invariants in 18 ms
[2022-05-16 05:28:59] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:28:59] [INFO ] Implicit Places using invariants in 525 ms returned []
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:28:59] [INFO ] Computed 4 place invariants in 35 ms
[2022-05-16 05:29:00] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:29:00] [INFO ] Computed 4 place invariants in 19 ms
[2022-05-16 05:29:02] [INFO ] Dead Transitions using invariants and state equation in 2026 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1508/1508 places, 1930/1930 transitions.
Built C files in :
/tmp/ltsmin5327301546976420956
[2022-05-16 05:29:02] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5327301546976420956
Running compilation step : cd /tmp/ltsmin5327301546976420956;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin5327301546976420956;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin5327301546976420956;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 05:29:05] [INFO ] Flatten gal took : 88 ms
[2022-05-16 05:29:05] [INFO ] Flatten gal took : 81 ms
[2022-05-16 05:29:05] [INFO ] Time to serialize gal into /tmp/LTL11578146124241778269.gal : 22 ms
[2022-05-16 05:29:05] [INFO ] Time to serialize properties into /tmp/LTL1902031964896065298.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11578146124241778269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1902031964896065298.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1157814...267
Read 1 LTL properties
Checking formula 0 : !((G(X((X(X("(p1928==0)")))&&((G("(p2314==1)"))||("(p2314==0)"))))))
Formula 0 simplified : !GX(XX"(p1928==0)" & ("(p2314==0)" | G"(p2314==1)"))
Detected timeout of ITS tools.
[2022-05-16 05:29:21] [INFO ] Flatten gal took : 169 ms
[2022-05-16 05:29:21] [INFO ] Applying decomposition
[2022-05-16 05:29:21] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3332448980142120242.txt' '-o' '/tmp/graph3332448980142120242.bin' '-w' '/tmp/graph3332448980142120242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3332448980142120242.bin' '-l' '-1' '-v' '-w' '/tmp/graph3332448980142120242.weights' '-q' '0' '-e' '0.001'
[2022-05-16 05:29:21] [INFO ] Decomposing Gal with order
[2022-05-16 05:29:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 05:29:22] [INFO ] Removed a total of 514 redundant transitions.
[2022-05-16 05:29:22] [INFO ] Flatten gal took : 361 ms
[2022-05-16 05:29:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 58 ms.
[2022-05-16 05:29:22] [INFO ] Time to serialize gal into /tmp/LTL14895894962463902858.gal : 34 ms
[2022-05-16 05:29:22] [INFO ] Time to serialize properties into /tmp/LTL8617613357825885416.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14895894962463902858.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8617613357825885416.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1489589...246
Read 1 LTL properties
Checking formula 0 : !((G(X((X(X("(i29.i1.i0.u459.p1928==0)")))&&((G("(i37.i2.i5.u579.p2314==1)"))||("(i37.i2.i5.u579.p2314==0)"))))))
Formula 0 simplified : !GX(XX"(i29.i1.i0.u459.p1928==0)" & ("(i37.i2.i5.u579.p2314==0)" | G"(i37.i2.i5.u579.p2314==1)"))
Reverse transition relation is NOT exact ! Due to transitions t26, t181, t263, t294, t445, t654, t658, t750, t751, t755, t767, t796, t967, t1126, t1155, t1...2020
Computing Next relation with stutter on 89440 deadlock states
42 unique states visited
42 strongly connected components in search stack
43 transitions explored
42 items max in DFS search stack
704 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,7.40506,173924,1,0,289709,6271,22783,539856,544,31351,1213580
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-315-LTLFireability-00 finished in 59374 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(F(p1))||!p1)))'
Support contains 2 out of 1524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1514 transition count 1940
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1514 transition count 1940
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 1508 transition count 1933
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 1508 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1507 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1506 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1506 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 38 place count 1506 transition count 1928
Applied a total of 38 rules in 416 ms. Remains 1506 /1524 variables (removed 18) and now considering 1928/1950 (removed 22) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:29:31] [INFO ] Computed 4 place invariants in 15 ms
[2022-05-16 05:29:31] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:29:31] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 05:29:32] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:29:32] [INFO ] Computed 4 place invariants in 15 ms
[2022-05-16 05:29:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:29:34] [INFO ] Dead Transitions using invariants and state equation in 1826 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1524 places, 1928/1950 transitions.
Finished structural reductions, in 1 iterations. Remains : 1506/1524 places, 1928/1950 transitions.
Stuttering acceptance computed with spot in 69 ms :[false, (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s689 1), p0:(EQ s853 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1954 ms.
Product exploration explored 100000 steps with 50000 reset in 1594 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CloudReconfiguration-PT-315-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-315-LTLFireability-02 finished in 7277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((G(p1) U G(p2)))&&p0)))'
Support contains 3 out of 1524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Graph (trivial) has 1855 edges and 1524 vertex of which 681 / 1524 are part of one of the 63 SCC in 2 ms
Free SCC test removed 618 places
Ensure Unique test removed 717 transitions
Reduce isomorphic transitions removed 717 transitions.
Graph (complete) has 1406 edges and 906 vertex of which 897 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 491 place count 896 transition count 738
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 511 rules applied. Total rules applied 1002 place count 407 transition count 716
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1014 place count 396 transition count 715
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1015 place count 395 transition count 715
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1015 place count 395 transition count 667
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1111 place count 347 transition count 667
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1127 place count 331 transition count 641
Iterating global reduction 4 with 16 rules applied. Total rules applied 1143 place count 331 transition count 641
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 1146 place count 331 transition count 638
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1149 place count 328 transition count 638
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1159 place count 318 transition count 623
Iterating global reduction 6 with 10 rules applied. Total rules applied 1169 place count 318 transition count 623
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1174 place count 318 transition count 618
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1177 place count 315 transition count 612
Iterating global reduction 7 with 3 rules applied. Total rules applied 1180 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 1181 place count 315 transition count 611
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1183 place count 313 transition count 607
Iterating global reduction 8 with 2 rules applied. Total rules applied 1185 place count 313 transition count 607
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1186 place count 312 transition count 605
Iterating global reduction 8 with 1 rules applied. Total rules applied 1187 place count 312 transition count 605
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1188 place count 311 transition count 603
Iterating global reduction 8 with 1 rules applied. Total rules applied 1189 place count 311 transition count 603
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1190 place count 310 transition count 601
Iterating global reduction 8 with 1 rules applied. Total rules applied 1191 place count 310 transition count 601
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1192 place count 309 transition count 594
Iterating global reduction 8 with 1 rules applied. Total rules applied 1193 place count 309 transition count 594
Performed 141 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 141 places in 1 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 8 with 282 rules applied. Total rules applied 1475 place count 168 transition count 375
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1486 place count 168 transition count 364
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1491 place count 163 transition count 358
Iterating global reduction 9 with 5 rules applied. Total rules applied 1496 place count 163 transition count 358
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1497 place count 162 transition count 357
Iterating global reduction 9 with 1 rules applied. Total rules applied 1498 place count 162 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1499 place count 162 transition count 356
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 10 with 26 rules applied. Total rules applied 1525 place count 149 transition count 340
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1539 place count 149 transition count 326
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1540 place count 148 transition count 324
Iterating global reduction 11 with 1 rules applied. Total rules applied 1541 place count 148 transition count 324
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 1577 place count 130 transition count 364
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 11 with 23 rules applied. Total rules applied 1600 place count 130 transition count 341
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1609 place count 121 transition count 323
Iterating global reduction 12 with 9 rules applied. Total rules applied 1618 place count 121 transition count 323
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1624 place count 121 transition count 317
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 13 with 42 rules applied. Total rules applied 1666 place count 121 transition count 275
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1668 place count 121 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1669 place count 120 transition count 274
Applied a total of 1669 rules in 174 ms. Remains 120 /1524 variables (removed 1404) and now considering 274/1950 (removed 1676) transitions.
[2022-05-16 05:29:38] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
// Phase 1: matrix 217 rows 120 cols
[2022-05-16 05:29:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 05:29:38] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-05-16 05:29:38] [INFO ] Flow matrix only has 217 transitions (discarded 57 similar events)
// Phase 1: matrix 217 rows 120 cols
[2022-05-16 05:29:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 05:29:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 05:29:38] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [47, 82]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 325 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1524 places, 274/1950 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 272
Applied a total of 2 rules in 31 ms. Remains 116 /118 variables (removed 2) and now considering 272/274 (removed 2) transitions.
[2022-05-16 05:29:38] [INFO ] Flow matrix only has 215 transitions (discarded 57 similar events)
// Phase 1: matrix 215 rows 116 cols
[2022-05-16 05:29:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:29:38] [INFO ] Implicit Places using invariants in 108 ms returned []
[2022-05-16 05:29:38] [INFO ] Flow matrix only has 215 transitions (discarded 57 similar events)
// Phase 1: matrix 215 rows 116 cols
[2022-05-16 05:29:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:29:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 05:29:38] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1524 places, 272/1950 transitions.
Finished structural reductions, in 2 iterations. Remains : 116/1524 places, 272/1950 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s67 0) (EQ s9 0)), p2:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-315-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-03 finished in 1054 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X((F(F((F(p0)&&p1)))||p2))))||G(p3)))'
Support contains 3 out of 1524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1516 transition count 1942
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1516 transition count 1942
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 1510 transition count 1935
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 1510 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1509 transition count 1932
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1508 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1508 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 34 place count 1508 transition count 1930
Applied a total of 34 rules in 401 ms. Remains 1508 /1524 variables (removed 16) and now considering 1930/1950 (removed 20) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:29:39] [INFO ] Computed 4 place invariants in 13 ms
[2022-05-16 05:29:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:29:39] [INFO ] Implicit Places using invariants in 473 ms returned []
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:29:39] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-16 05:29:40] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:29:40] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-16 05:29:42] [INFO ] Dead Transitions using invariants and state equation in 1578 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1524 places, 1930/1950 transitions.
Finished structural reductions, in 1 iterations. Remains : 1508/1524 places, 1930/1950 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=p3, acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(EQ s1344 1), p1:(EQ s124 0), p0:(EQ s1344 0), p3:(EQ s107 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1310 ms.
Product exploration explored 100000 steps with 33333 reset in 1172 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0 (NOT p3)), (X (NOT p3)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p2) p1 (NOT p0)))))
Knowledge based reduction with 8 factoid took 206 ms. Reduced automaton from 7 states, 14 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA CloudReconfiguration-PT-315-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-315-LTLFireability-04 finished in 6215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||F(p1))))'
Support contains 2 out of 1524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Graph (trivial) has 1858 edges and 1524 vertex of which 696 / 1524 are part of one of the 63 SCC in 3 ms
Free SCC test removed 633 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1387 edges and 891 vertex of which 882 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 481 place count 881 transition count 729
Reduce places removed 479 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 503 rules applied. Total rules applied 984 place count 402 transition count 705
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 998 place count 390 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1000 place count 388 transition count 703
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1000 place count 388 transition count 658
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1090 place count 343 transition count 658
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1106 place count 327 transition count 632
Iterating global reduction 4 with 16 rules applied. Total rules applied 1122 place count 327 transition count 632
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 1125 place count 327 transition count 629
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1128 place count 324 transition count 629
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1138 place count 314 transition count 614
Iterating global reduction 6 with 10 rules applied. Total rules applied 1148 place count 314 transition count 614
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1153 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1155 place count 312 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1157 place count 312 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1158 place count 312 transition count 604
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1159 place count 311 transition count 602
Iterating global reduction 8 with 1 rules applied. Total rules applied 1160 place count 311 transition count 602
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1161 place count 310 transition count 600
Iterating global reduction 8 with 1 rules applied. Total rules applied 1162 place count 310 transition count 600
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1163 place count 309 transition count 598
Iterating global reduction 8 with 1 rules applied. Total rules applied 1164 place count 309 transition count 598
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1165 place count 308 transition count 596
Iterating global reduction 8 with 1 rules applied. Total rules applied 1166 place count 308 transition count 596
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1167 place count 307 transition count 589
Iterating global reduction 8 with 1 rules applied. Total rules applied 1168 place count 307 transition count 589
Performed 140 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 8 with 280 rules applied. Total rules applied 1448 place count 167 transition count 371
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1459 place count 167 transition count 360
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1464 place count 162 transition count 354
Iterating global reduction 9 with 5 rules applied. Total rules applied 1469 place count 162 transition count 354
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1470 place count 161 transition count 353
Iterating global reduction 9 with 1 rules applied. Total rules applied 1471 place count 161 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1472 place count 161 transition count 352
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 10 with 26 rules applied. Total rules applied 1498 place count 148 transition count 336
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1512 place count 148 transition count 322
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1513 place count 147 transition count 320
Iterating global reduction 11 with 1 rules applied. Total rules applied 1514 place count 147 transition count 320
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 1550 place count 129 transition count 357
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1571 place count 129 transition count 336
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1580 place count 120 transition count 318
Iterating global reduction 12 with 9 rules applied. Total rules applied 1589 place count 120 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1595 place count 120 transition count 312
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 13 with 40 rules applied. Total rules applied 1635 place count 120 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1636 place count 119 transition count 271
Applied a total of 1636 rules in 170 ms. Remains 119 /1524 variables (removed 1405) and now considering 271/1950 (removed 1679) transitions.
[2022-05-16 05:29:45] [INFO ] Flow matrix only has 213 transitions (discarded 58 similar events)
// Phase 1: matrix 213 rows 119 cols
[2022-05-16 05:29:45] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 05:29:45] [INFO ] Implicit Places using invariants in 257 ms returned []
[2022-05-16 05:29:45] [INFO ] Flow matrix only has 213 transitions (discarded 58 similar events)
// Phase 1: matrix 213 rows 119 cols
[2022-05-16 05:29:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:29:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 05:29:46] [INFO ] Implicit Places using invariants and state equation in 335 ms returned [46, 79]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 597 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/1524 places, 271/1950 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 269
Applied a total of 2 rules in 11 ms. Remains 115 /117 variables (removed 2) and now considering 269/271 (removed 2) transitions.
[2022-05-16 05:29:46] [INFO ] Flow matrix only has 211 transitions (discarded 58 similar events)
// Phase 1: matrix 211 rows 115 cols
[2022-05-16 05:29:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:29:46] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-16 05:29:46] [INFO ] Flow matrix only has 211 transitions (discarded 58 similar events)
// Phase 1: matrix 211 rows 115 cols
[2022-05-16 05:29:46] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 05:29:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 05:29:46] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/1524 places, 269/1950 transitions.
Finished structural reductions, in 2 iterations. Remains : 115/1524 places, 269/1950 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s8 1), p1:(EQ s86 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-315-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-06 finished in 1256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p0))))'
Support contains 1 out of 1524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Graph (trivial) has 1859 edges and 1524 vertex of which 692 / 1524 are part of one of the 63 SCC in 3 ms
Free SCC test removed 629 places
Ensure Unique test removed 731 transitions
Reduce isomorphic transitions removed 731 transitions.
Graph (complete) has 1392 edges and 895 vertex of which 886 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 484 transitions
Trivial Post-agglo rules discarded 484 transitions
Performed 484 trivial Post agglomeration. Transition count delta: 484
Iterating post reduction 0 with 484 rules applied. Total rules applied 486 place count 885 transition count 729
Reduce places removed 484 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 506 rules applied. Total rules applied 992 place count 401 transition count 707
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1004 place count 390 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1005 place count 389 transition count 706
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1005 place count 389 transition count 659
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1099 place count 342 transition count 659
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1115 place count 326 transition count 633
Iterating global reduction 4 with 16 rules applied. Total rules applied 1131 place count 326 transition count 633
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 1134 place count 326 transition count 630
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1137 place count 323 transition count 630
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1147 place count 313 transition count 615
Iterating global reduction 6 with 10 rules applied. Total rules applied 1157 place count 313 transition count 615
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1162 place count 313 transition count 610
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1165 place count 310 transition count 604
Iterating global reduction 7 with 3 rules applied. Total rules applied 1168 place count 310 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1169 place count 310 transition count 603
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1171 place count 308 transition count 599
Iterating global reduction 8 with 2 rules applied. Total rules applied 1173 place count 308 transition count 599
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1175 place count 306 transition count 595
Iterating global reduction 8 with 2 rules applied. Total rules applied 1177 place count 306 transition count 595
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1179 place count 304 transition count 591
Iterating global reduction 8 with 2 rules applied. Total rules applied 1181 place count 304 transition count 591
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1183 place count 302 transition count 587
Iterating global reduction 8 with 2 rules applied. Total rules applied 1185 place count 302 transition count 587
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1187 place count 300 transition count 573
Iterating global reduction 8 with 2 rules applied. Total rules applied 1189 place count 300 transition count 573
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 1190 place count 300 transition count 572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1191 place count 299 transition count 572
Performed 138 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 10 with 276 rules applied. Total rules applied 1467 place count 161 transition count 356
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 10 with 12 rules applied. Total rules applied 1479 place count 161 transition count 344
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1481 place count 160 transition count 343
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1486 place count 155 transition count 337
Iterating global reduction 12 with 5 rules applied. Total rules applied 1491 place count 155 transition count 337
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1492 place count 154 transition count 336
Iterating global reduction 12 with 1 rules applied. Total rules applied 1493 place count 154 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1494 place count 154 transition count 335
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 13 with 24 rules applied. Total rules applied 1518 place count 142 transition count 320
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 1530 place count 142 transition count 308
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 14 with 36 rules applied. Total rules applied 1566 place count 124 transition count 342
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 1583 place count 124 transition count 325
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1592 place count 115 transition count 307
Iterating global reduction 15 with 9 rules applied. Total rules applied 1601 place count 115 transition count 307
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1607 place count 115 transition count 301
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 16 with 38 rules applied. Total rules applied 1645 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1646 place count 114 transition count 262
Applied a total of 1646 rules in 157 ms. Remains 114 /1524 variables (removed 1410) and now considering 262/1950 (removed 1688) transitions.
[2022-05-16 05:29:46] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 114 cols
[2022-05-16 05:29:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:29:46] [INFO ] Implicit Places using invariants in 82 ms returned []
[2022-05-16 05:29:46] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 114 cols
[2022-05-16 05:29:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:29:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 05:29:47] [INFO ] Implicit Places using invariants and state equation in 237 ms returned [43, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 325 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1524 places, 262/1950 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 260
Applied a total of 2 rules in 12 ms. Remains 110 /112 variables (removed 2) and now considering 260/262 (removed 2) transitions.
[2022-05-16 05:29:47] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 110 cols
[2022-05-16 05:29:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 05:29:47] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-05-16 05:29:47] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 110 cols
[2022-05-16 05:29:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:29:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 05:29:47] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1524 places, 260/1950 transitions.
Finished structural reductions, in 2 iterations. Remains : 110/1524 places, 260/1950 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), p0]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-07 finished in 853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(F(X((X(X((p0 U F(p0))))&&p0)))) U p0))'
Support contains 1 out of 1524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1515 transition count 1941
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1515 transition count 1941
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1510 transition count 1935
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1510 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1509 transition count 1932
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1508 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1508 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 34 place count 1508 transition count 1930
Applied a total of 34 rules in 326 ms. Remains 1508 /1524 variables (removed 16) and now considering 1930/1950 (removed 20) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:29:47] [INFO ] Computed 4 place invariants in 13 ms
[2022-05-16 05:29:48] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:29:48] [INFO ] Computed 4 place invariants in 14 ms
[2022-05-16 05:29:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:29:49] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:29:49] [INFO ] Computed 4 place invariants in 14 ms
[2022-05-16 05:29:51] [INFO ] Dead Transitions using invariants and state equation in 2143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1524 places, 1930/1950 transitions.
Finished structural reductions, in 1 iterations. Remains : 1508/1524 places, 1930/1950 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), true, p0, p0, p0, true]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), 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={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1018 1)], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 784 reset in 252 ms.
Product exploration explored 100000 steps with 786 reset in 396 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 254 ms. Reduced automaton from 6 states, 9 edges and 1 AP to 6 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 246 ms :[true, true, p0, p0, p0, true]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 259606 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259606 steps, saw 67249 distinct states, run finished after 3003 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:29:55] [INFO ] Computed 4 place invariants in 15 ms
[2022-05-16 05:29:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 22 ms returned sat
[2022-05-16 05:29:57] [INFO ] After 1377ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 05:29:57] [INFO ] After 1556ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2022-05-16 05:29:57] [INFO ] After 2147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 123 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 416 ms. Reduced automaton from 6 states, 9 edges and 1 AP to 6 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 285 ms :[true, true, p0, p0, p0, true]
Stuttering acceptance computed with spot in 270 ms :[true, true, p0, p0, p0, true]
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:29:58] [INFO ] Computed 4 place invariants in 14 ms
Proved EG true
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), true]
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 6 states, 9 edges and 1 AP to 6 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 174 ms :[true, true, p0, p0, p0, true]
Support contains 1 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Applied a total of 0 rules in 79 ms. Remains 1508 /1508 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:30:00] [INFO ] Computed 4 place invariants in 11 ms
[2022-05-16 05:30:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:30:01] [INFO ] Implicit Places using invariants in 458 ms returned []
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:30:01] [INFO ] Computed 4 place invariants in 16 ms
[2022-05-16 05:30:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:30:02] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:30:02] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 05:30:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:30:04] [INFO ] Dead Transitions using invariants and state equation in 2149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1508/1508 places, 1930/1930 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 6 states, 9 edges and 1 AP to 6 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 218 ms :[true, true, p0, p0, p0, true]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267492 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267492 steps, saw 68983 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:30:07] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 05:30:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 18 ms returned sat
[2022-05-16 05:30:09] [INFO ] After 1505ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 05:30:09] [INFO ] After 1689ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-16 05:30:10] [INFO ] After 2101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 123 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 6 states, 9 edges and 1 AP to 6 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 257 ms :[true, true, p0, p0, p0, true]
Stuttering acceptance computed with spot in 248 ms :[true, true, p0, p0, p0, true]
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:30:10] [INFO ] Computed 4 place invariants in 20 ms
Proved EG true
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), true]
Knowledge based reduction with 4 factoid took 289 ms. Reduced automaton from 6 states, 9 edges and 1 AP to 6 states, 9 edges and 1 AP.
Stuttering acceptance computed with spot in 256 ms :[true, true, p0, p0, p0, true]
Stuttering acceptance computed with spot in 257 ms :[true, true, p0, p0, p0, true]
Product exploration explored 100000 steps with 762 reset in 246 ms.
Product exploration explored 100000 steps with 792 reset in 652 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 193 ms :[true, true, p0, p0, p0, true]
Support contains 1 out of 1508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Graph (trivial) has 1841 edges and 1508 vertex of which 693 / 1508 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1369 edges and 878 vertex of which 869 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 474 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 474 rules applied. Total rules applied 476 place count 869 transition count 1193
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 488 place count 869 transition count 1181
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 488 place count 869 transition count 1194
Deduced a syphon composed of 495 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 509 place count 869 transition count 1194
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 792 place count 586 transition count 901
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1075 place count 586 transition count 901
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1087 place count 574 transition count 885
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1099 place count 574 transition count 885
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1105 place count 574 transition count 879
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1117 place count 562 transition count 867
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1129 place count 562 transition count 867
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1131 place count 560 transition count 863
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 560 transition count 863
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1135 place count 558 transition count 859
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 558 transition count 859
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1141 place count 554 transition count 855
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1145 place count 554 transition count 855
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1147 place count 552 transition count 851
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1149 place count 552 transition count 851
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 550 transition count 847
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 550 transition count 847
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1157 place count 546 transition count 841
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1161 place count 546 transition count 841
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 542 transition count 825
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 542 transition count 825
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1170 place count 542 transition count 825
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1174 place count 538 transition count 821
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1178 place count 538 transition count 821
Performed 105 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 314 places in 0 ms
Iterating global reduction 4 with 105 rules applied. Total rules applied 1283 place count 538 transition count 896
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1322 place count 538 transition count 857
Discarding 99 places :
Symmetric choice reduction at 5 with 99 rule applications. Total rules 1421 place count 439 transition count 748
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 99 rules applied. Total rules applied 1520 place count 439 transition count 748
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1526 place count 433 transition count 739
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1532 place count 433 transition count 739
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1539 place count 433 transition count 739
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1543 place count 433 transition count 735
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1558 place count 418 transition count 716
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1573 place count 418 transition count 716
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1579 place count 418 transition count 710
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1583 place count 414 transition count 706
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1587 place count 414 transition count 706
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1590 place count 414 transition count 706
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1596 place count 414 transition count 700
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1599 place count 411 transition count 697
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1602 place count 411 transition count 697
Performed 70 Post agglomeration using F-continuation condition with reduction of 119 identical transitions.
Deduced a syphon composed of 281 places in 1 ms
Iterating global reduction 8 with 70 rules applied. Total rules applied 1672 place count 411 transition count 1010
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 8 with 120 rules applied. Total rules applied 1792 place count 411 transition count 890
Discarding 124 places :
Symmetric choice reduction at 9 with 124 rule applications. Total rules 1916 place count 287 transition count 563
Deduced a syphon composed of 166 places in 1 ms
Iterating global reduction 9 with 124 rules applied. Total rules applied 2040 place count 287 transition count 563
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2055 place count 287 transition count 548
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2082 place count 260 transition count 491
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2109 place count 260 transition count 491
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2112 place count 260 transition count 539
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2115 place count 257 transition count 512
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2118 place count 257 transition count 512
Deduced a syphon composed of 139 places in 1 ms
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 10 with 45 rules applied. Total rules applied 2163 place count 257 transition count 467
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2167 place count 253 transition count 463
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2171 place count 253 transition count 463
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2174 place count 253 transition count 523
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2177 place count 250 transition count 508
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2180 place count 250 transition count 508
Deduced a syphon composed of 135 places in 1 ms
Applied a total of 2180 rules in 335 ms. Remains 250 /1508 variables (removed 1258) and now considering 508/1930 (removed 1422) transitions.
[2022-05-16 05:30:14] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-16 05:30:14] [INFO ] Flow matrix only has 451 transitions (discarded 57 similar events)
// Phase 1: matrix 451 rows 250 cols
[2022-05-16 05:30:14] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 05:30:15] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/1508 places, 508/1930 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/1508 places, 508/1930 transitions.
Product exploration explored 100000 steps with 792 reset in 259 ms.
Product exploration explored 100000 steps with 776 reset in 259 ms.
Built C files in :
/tmp/ltsmin3499828301324948113
[2022-05-16 05:30:16] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3499828301324948113
Running compilation step : cd /tmp/ltsmin3499828301324948113;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3499828301324948113;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin3499828301324948113;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Applied a total of 0 rules in 102 ms. Remains 1508 /1508 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:30:19] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 05:30:19] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:30:19] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 05:30:20] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:30:20] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 05:30:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:30:22] [INFO ] Dead Transitions using invariants and state equation in 1940 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1508/1508 places, 1930/1930 transitions.
Built C files in :
/tmp/ltsmin14988925814795936131
[2022-05-16 05:30:22] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14988925814795936131
Running compilation step : cd /tmp/ltsmin14988925814795936131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin14988925814795936131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin14988925814795936131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 05:30:25] [INFO ] Flatten gal took : 162 ms
[2022-05-16 05:30:25] [INFO ] Flatten gal took : 143 ms
[2022-05-16 05:30:25] [INFO ] Time to serialize gal into /tmp/LTL13798281465387920095.gal : 27 ms
[2022-05-16 05:30:25] [INFO ] Time to serialize properties into /tmp/LTL8272900487629730508.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13798281465387920095.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8272900487629730508.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1379828...267
Read 1 LTL properties
Checking formula 0 : !(((!(X(F(X((X(X(("(p1727==1)")U(F("(p1727==1)")))))&&("(p1727==1)"))))))U("(p1727==1)")))
Formula 0 simplified : !(!XFX("(p1727==1)" & XX("(p1727==1)" U F"(p1727==1)")) U "(p1727==1)")
Detected timeout of ITS tools.
[2022-05-16 05:30:40] [INFO ] Flatten gal took : 84 ms
[2022-05-16 05:30:40] [INFO ] Applying decomposition
[2022-05-16 05:30:40] [INFO ] Flatten gal took : 87 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12431032826556229443.txt' '-o' '/tmp/graph12431032826556229443.bin' '-w' '/tmp/graph12431032826556229443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12431032826556229443.bin' '-l' '-1' '-v' '-w' '/tmp/graph12431032826556229443.weights' '-q' '0' '-e' '0.001'
[2022-05-16 05:30:41] [INFO ] Decomposing Gal with order
[2022-05-16 05:30:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 05:30:41] [INFO ] Removed a total of 505 redundant transitions.
[2022-05-16 05:30:41] [INFO ] Flatten gal took : 197 ms
[2022-05-16 05:30:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 36 ms.
[2022-05-16 05:30:41] [INFO ] Time to serialize gal into /tmp/LTL9329686781618213437.gal : 17 ms
[2022-05-16 05:30:41] [INFO ] Time to serialize properties into /tmp/LTL2576637888884121893.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9329686781618213437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2576637888884121893.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9329686...245
Read 1 LTL properties
Checking formula 0 : !(((!(X(F(X((X(X(("(i26.i1.i0.u398.p1727==1)")U(F("(i26.i1.i0.u398.p1727==1)")))))&&("(i26.i1.i0.u398.p1727==1)"))))))U("(i26.i1.i0.u3...171
Formula 0 simplified : !(!XFX("(i26.i1.i0.u398.p1727==1)" & XX("(i26.i1.i0.u398.p1727==1)" U F"(i26.i1.i0.u398.p1727==1)")) U "(i26.i1.i0.u398.p1727==1)")
Reverse transition relation is NOT exact ! Due to transitions t26, t211, t263, t294, t325, t374, t445, t654, t683, t736, t767, t796, t858, t967, t1155, t12...2036
Computing Next relation with stutter on 89440 deadlock states
37 unique states visited
37 strongly connected components in search stack
37 transitions explored
37 items max in DFS search stack
1064 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,10.9013,256760,1,0,400381,13903,21641,830502,575,139353,2029079
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-315-LTLFireability-08 finished in 66439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(G(p1))&&X(G(p2)))||p0)))'
Support contains 4 out of 1524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1515 transition count 1941
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1515 transition count 1941
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1510 transition count 1936
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1510 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1510 transition count 1935
Applied a total of 29 rules in 192 ms. Remains 1510 /1524 variables (removed 14) and now considering 1935/1950 (removed 15) transitions.
// Phase 1: matrix 1935 rows 1510 cols
[2022-05-16 05:30:54] [INFO ] Computed 4 place invariants in 14 ms
[2022-05-16 05:30:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:30:54] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 1935 rows 1510 cols
[2022-05-16 05:30:54] [INFO ] Computed 4 place invariants in 14 ms
[2022-05-16 05:30:55] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
// Phase 1: matrix 1935 rows 1510 cols
[2022-05-16 05:30:55] [INFO ] Computed 4 place invariants in 14 ms
[2022-05-16 05:30:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:30:57] [INFO ] Dead Transitions using invariants and state equation in 2426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1524 places, 1935/1950 transitions.
Finished structural reductions, in 1 iterations. Remains : 1510/1524 places, 1935/1950 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s191 1) (EQ s844 1)), p2:(EQ s191 1), p1:(AND (EQ s279 1) (EQ s597 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-10 finished in 4169 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0 U X(!p0)))) U (G(p1)||p2)))'
Support contains 3 out of 1524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Graph (trivial) has 1855 edges and 1524 vertex of which 679 / 1524 are part of one of the 62 SCC in 1 ms
Free SCC test removed 617 places
Ensure Unique test removed 715 transitions
Reduce isomorphic transitions removed 715 transitions.
Graph (complete) has 1408 edges and 907 vertex of which 898 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 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 487 rules applied. Total rules applied 489 place count 897 transition count 742
Reduce places removed 487 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 511 rules applied. Total rules applied 1000 place count 410 transition count 718
Reduce places removed 12 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 2 with 14 rules applied. Total rules applied 1014 place count 398 transition count 716
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions 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 1017 place count 397 transition count 714
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1021 place count 396 transition count 711
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1024 place count 394 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1025 place count 393 transition count 710
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 48 Pre rules applied. Total rules applied 1025 place count 393 transition count 662
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 1121 place count 345 transition count 662
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1136 place count 330 transition count 638
Iterating global reduction 7 with 15 rules applied. Total rules applied 1151 place count 330 transition count 638
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 3 rules applied. Total rules applied 1154 place count 330 transition count 635
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1157 place count 327 transition count 635
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1166 place count 318 transition count 622
Iterating global reduction 9 with 9 rules applied. Total rules applied 1175 place count 318 transition count 622
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1180 place count 318 transition count 617
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1182 place count 316 transition count 613
Iterating global reduction 10 with 2 rules applied. Total rules applied 1184 place count 316 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1185 place count 316 transition count 612
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1186 place count 315 transition count 610
Iterating global reduction 11 with 1 rules applied. Total rules applied 1187 place count 315 transition count 610
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1188 place count 314 transition count 608
Iterating global reduction 11 with 1 rules applied. Total rules applied 1189 place count 314 transition count 608
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1190 place count 313 transition count 606
Iterating global reduction 11 with 1 rules applied. Total rules applied 1191 place count 313 transition count 606
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1192 place count 312 transition count 604
Iterating global reduction 11 with 1 rules applied. Total rules applied 1193 place count 312 transition count 604
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1194 place count 311 transition count 597
Iterating global reduction 11 with 1 rules applied. Total rules applied 1195 place count 311 transition count 597
Performed 141 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 11 with 282 rules applied. Total rules applied 1477 place count 170 transition count 378
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1488 place count 170 transition count 367
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1493 place count 165 transition count 361
Iterating global reduction 12 with 5 rules applied. Total rules applied 1498 place count 165 transition count 361
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1499 place count 164 transition count 360
Iterating global reduction 12 with 1 rules applied. Total rules applied 1500 place count 164 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1501 place count 164 transition count 359
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 13 with 26 rules applied. Total rules applied 1527 place count 151 transition count 343
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 13 with 14 rules applied. Total rules applied 1541 place count 151 transition count 329
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1542 place count 150 transition count 327
Iterating global reduction 14 with 1 rules applied. Total rules applied 1543 place count 150 transition count 327
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 14 with 40 rules applied. Total rules applied 1583 place count 130 transition count 364
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 14 with 22 rules applied. Total rules applied 1605 place count 130 transition count 342
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1614 place count 121 transition count 324
Iterating global reduction 15 with 9 rules applied. Total rules applied 1623 place count 121 transition count 324
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1629 place count 121 transition count 318
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 16 with 42 rules applied. Total rules applied 1671 place count 121 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1672 place count 120 transition count 275
Applied a total of 1672 rules in 87 ms. Remains 120 /1524 variables (removed 1404) and now considering 275/1950 (removed 1675) transitions.
[2022-05-16 05:30:58] [INFO ] Flow matrix only has 217 transitions (discarded 58 similar events)
// Phase 1: matrix 217 rows 120 cols
[2022-05-16 05:30:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 05:30:58] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-05-16 05:30:58] [INFO ] Flow matrix only has 217 transitions (discarded 58 similar events)
// Phase 1: matrix 217 rows 120 cols
[2022-05-16 05:30:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 05:30:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 05:30:58] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [48, 81]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 425 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1524 places, 275/1950 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 273
Applied a total of 2 rules in 7 ms. Remains 116 /118 variables (removed 2) and now considering 273/275 (removed 2) transitions.
[2022-05-16 05:30:58] [INFO ] Flow matrix only has 215 transitions (discarded 58 similar events)
// Phase 1: matrix 215 rows 116 cols
[2022-05-16 05:30:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:30:58] [INFO ] Implicit Places using invariants in 100 ms returned []
[2022-05-16 05:30:58] [INFO ] Flow matrix only has 215 transitions (discarded 58 similar events)
// Phase 1: matrix 215 rows 116 cols
[2022-05-16 05:30:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:30:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 05:30:58] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1524 places, 273/1950 transitions.
Finished structural reductions, in 2 iterations. Remains : 116/1524 places, 273/1950 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s96 1), p1:(EQ s33 1), p0:(NEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-11 finished in 1029 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||p1))))'
Support contains 2 out of 1524 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Graph (trivial) has 1858 edges and 1524 vertex of which 696 / 1524 are part of one of the 63 SCC in 1 ms
Free SCC test removed 633 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1387 edges and 891 vertex of which 882 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 480 transitions
Trivial Post-agglo rules discarded 480 transitions
Performed 480 trivial Post agglomeration. Transition count delta: 480
Iterating post reduction 0 with 480 rules applied. Total rules applied 482 place count 881 transition count 728
Reduce places removed 480 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 504 rules applied. Total rules applied 986 place count 401 transition count 704
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 999 place count 389 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1000 place count 388 transition count 703
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1000 place count 388 transition count 657
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1092 place count 342 transition count 657
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1107 place count 327 transition count 633
Iterating global reduction 4 with 15 rules applied. Total rules applied 1122 place count 327 transition count 633
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 1124 place count 327 transition count 631
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1126 place count 325 transition count 631
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1136 place count 315 transition count 616
Iterating global reduction 6 with 10 rules applied. Total rules applied 1146 place count 315 transition count 616
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1151 place count 315 transition count 611
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1154 place count 312 transition count 605
Iterating global reduction 7 with 3 rules applied. Total rules applied 1157 place count 312 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1158 place count 312 transition count 604
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1160 place count 310 transition count 600
Iterating global reduction 8 with 2 rules applied. Total rules applied 1162 place count 310 transition count 600
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1164 place count 308 transition count 596
Iterating global reduction 8 with 2 rules applied. Total rules applied 1166 place count 308 transition count 596
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1168 place count 306 transition count 592
Iterating global reduction 8 with 2 rules applied. Total rules applied 1170 place count 306 transition count 592
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1172 place count 304 transition count 588
Iterating global reduction 8 with 2 rules applied. Total rules applied 1174 place count 304 transition count 588
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1176 place count 302 transition count 574
Iterating global reduction 8 with 2 rules applied. Total rules applied 1178 place count 302 transition count 574
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 1179 place count 302 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1180 place count 301 transition count 573
Performed 140 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 10 with 280 rules applied. Total rules applied 1460 place count 161 transition count 354
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 10 with 12 rules applied. Total rules applied 1472 place count 161 transition count 342
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1474 place count 160 transition count 341
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1479 place count 155 transition count 335
Iterating global reduction 12 with 5 rules applied. Total rules applied 1484 place count 155 transition count 335
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1485 place count 154 transition count 334
Iterating global reduction 12 with 1 rules applied. Total rules applied 1486 place count 154 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1487 place count 154 transition count 333
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 1509 place count 143 transition count 320
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 13 with 11 rules applied. Total rules applied 1520 place count 143 transition count 309
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 14 with 34 rules applied. Total rules applied 1554 place count 126 transition count 343
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 1571 place count 126 transition count 326
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1580 place count 117 transition count 308
Iterating global reduction 15 with 9 rules applied. Total rules applied 1589 place count 117 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1595 place count 117 transition count 302
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 16 with 37 rules applied. Total rules applied 1632 place count 117 transition count 265
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1633 place count 117 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1634 place count 116 transition count 264
Applied a total of 1634 rules in 154 ms. Remains 116 /1524 variables (removed 1408) and now considering 264/1950 (removed 1686) transitions.
[2022-05-16 05:30:59] [INFO ] Flow matrix only has 207 transitions (discarded 57 similar events)
// Phase 1: matrix 207 rows 116 cols
[2022-05-16 05:30:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:30:59] [INFO ] Implicit Places using invariants in 90 ms returned []
[2022-05-16 05:30:59] [INFO ] Flow matrix only has 207 transitions (discarded 57 similar events)
// Phase 1: matrix 207 rows 116 cols
[2022-05-16 05:30:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:30:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 05:30:59] [INFO ] Implicit Places using invariants and state equation in 249 ms returned [41, 76]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 346 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1524 places, 264/1950 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 262
Applied a total of 2 rules in 7 ms. Remains 112 /114 variables (removed 2) and now considering 262/264 (removed 2) transitions.
[2022-05-16 05:30:59] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 112 cols
[2022-05-16 05:30:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:30:59] [INFO ] Implicit Places using invariants in 85 ms returned []
[2022-05-16 05:30:59] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 112 cols
[2022-05-16 05:30:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 05:30:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 05:30:59] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1524 places, 262/1950 transitions.
Finished structural reductions, in 2 iterations. Remains : 112/1524 places, 262/1950 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s60 1), p0:(EQ s106 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3197 steps with 307 reset in 28 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-12 finished in 955 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0) U X(p0))))'
Support contains 1 out of 1524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1515 transition count 1941
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1515 transition count 1941
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1510 transition count 1935
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1510 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1509 transition count 1932
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1508 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1508 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 34 place count 1508 transition count 1930
Applied a total of 34 rules in 444 ms. Remains 1508 /1524 variables (removed 16) and now considering 1930/1950 (removed 20) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:31:00] [INFO ] Computed 4 place invariants in 15 ms
[2022-05-16 05:31:00] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:31:00] [INFO ] Computed 4 place invariants in 14 ms
[2022-05-16 05:31:01] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1338 ms to find 0 implicit places.
// Phase 1: matrix 1930 rows 1508 cols
[2022-05-16 05:31:01] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 05:31:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:31:03] [INFO ] Dead Transitions using invariants and state equation in 2026 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1508/1524 places, 1930/1950 transitions.
Finished structural reductions, in 1 iterations. Remains : 1508/1524 places, 1930/1950 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1363 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][false, false]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-315-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-315-LTLFireability-14 finished in 3957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G((X(p0)||p1))))))'
Support contains 2 out of 1524 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1524/1524 places, 1950/1950 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1514 transition count 1940
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1514 transition count 1940
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 1508 transition count 1933
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 1508 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1508 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1507 transition count 1930
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1507 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1506 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1506 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 38 place count 1506 transition count 1928
Applied a total of 38 rules in 506 ms. Remains 1506 /1524 variables (removed 18) and now considering 1928/1950 (removed 22) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:31:04] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 05:31:04] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:31:04] [INFO ] Implicit Places using invariants in 520 ms returned []
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:31:04] [INFO ] Computed 4 place invariants in 15 ms
[2022-05-16 05:31:05] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:31:05] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:31:05] [INFO ] Computed 4 place invariants in 13 ms
[2022-05-16 05:31:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:31:07] [INFO ] Dead Transitions using invariants and state equation in 1730 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1506/1524 places, 1928/1950 transitions.
Finished structural reductions, in 1 iterations. Remains : 1506/1524 places, 1928/1950 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-315-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s191 0), p0:(EQ s382 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 759 reset in 292 ms.
Product exploration explored 100000 steps with 752 reset in 353 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 513 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 78 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:31:09] [INFO ] Computed 4 place invariants in 12 ms
[2022-05-16 05:31:09] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 05:31:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 20 ms returned sat
[2022-05-16 05:31:11] [INFO ] After 1267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 05:31:11] [INFO ] After 1393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-05-16 05:31:11] [INFO ] After 1881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1831 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Drop transitions removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1304 edges and 876 vertex of which 867 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 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 484 transitions
Trivial Post-agglo rules discarded 484 transitions
Performed 484 trivial Post agglomeration. Transition count delta: 484
Iterating post reduction 0 with 490 rules applied. Total rules applied 492 place count 867 transition count 638
Reduce places removed 484 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 544 rules applied. Total rules applied 1036 place count 383 transition count 578
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 1078 place count 344 transition count 575
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1081 place count 341 transition count 575
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1081 place count 341 transition count 526
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1179 place count 292 transition count 526
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1190 place count 281 transition count 510
Iterating global reduction 4 with 11 rules applied. Total rules applied 1201 place count 281 transition count 510
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 1204 place count 281 transition count 507
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1207 place count 278 transition count 507
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1215 place count 270 transition count 497
Iterating global reduction 6 with 8 rules applied. Total rules applied 1223 place count 270 transition count 497
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 270 transition count 491
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1230 place count 269 transition count 485
Iterating global reduction 7 with 1 rules applied. Total rules applied 1231 place count 269 transition count 485
Performed 141 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 7 with 282 rules applied. Total rules applied 1513 place count 128 transition count 248
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1527 place count 128 transition count 234
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1530 place count 125 transition count 231
Iterating global reduction 8 with 3 rules applied. Total rules applied 1533 place count 125 transition count 231
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 8 with 26 rules applied. Total rules applied 1559 place count 112 transition count 215
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1574 place count 112 transition count 200
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 1576 place count 111 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1578 place count 111 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1580 place count 110 transition count 196
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1582 place count 110 transition count 194
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 11 with 66 rules applied. Total rules applied 1648 place count 77 transition count 225
Drop transitions removed 21 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 11 with 46 rules applied. Total rules applied 1694 place count 77 transition count 179
Discarding 23 places :
Symmetric choice reduction at 12 with 23 rule applications. Total rules 1717 place count 54 transition count 149
Iterating global reduction 12 with 23 rules applied. Total rules applied 1740 place count 54 transition count 149
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1754 place count 54 transition count 135
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1760 place count 48 transition count 123
Iterating global reduction 13 with 6 rules applied. Total rules applied 1766 place count 48 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1772 place count 48 transition count 117
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1793 place count 48 transition count 96
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1795 place count 46 transition count 90
Iterating global reduction 14 with 2 rules applied. Total rules applied 1797 place count 46 transition count 90
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1799 place count 44 transition count 88
Iterating global reduction 14 with 2 rules applied. Total rules applied 1801 place count 44 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1802 place count 44 transition count 87
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1803 place count 44 transition count 86
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1806 place count 44 transition count 83
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 1810 place count 41 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1811 place count 41 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1812 place count 40 transition count 81
Applied a total of 1812 rules in 70 ms. Remains 40 /1506 variables (removed 1466) and now considering 81/1928 (removed 1847) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/1506 places, 81/1928 transitions.
Finished random walk after 328 steps, including 12 resets, run visited all 1 properties in 2 ms. (steps per millisecond=164 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 597 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 96 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:31:12] [INFO ] Computed 4 place invariants in 12 ms
[2022-05-16 05:31:13] [INFO ] Implicit Places using invariants in 527 ms returned []
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:31:13] [INFO ] Computed 4 place invariants in 13 ms
[2022-05-16 05:31:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 05:31:14] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:31:14] [INFO ] Computed 4 place invariants in 12 ms
[2022-05-16 05:31:16] [INFO ] Dead Transitions using invariants and state equation in 2032 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 406 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:31:17] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 05:31:17] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 05:31:18] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 20 ms returned sat
[2022-05-16 05:31:19] [INFO ] After 1467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 05:31:20] [INFO ] After 1855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 432 ms.
[2022-05-16 05:31:20] [INFO ] After 2901ms 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 31 ms.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1831 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Drop transitions removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1304 edges and 876 vertex of which 867 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 484 transitions
Trivial Post-agglo rules discarded 484 transitions
Performed 484 trivial Post agglomeration. Transition count delta: 484
Iterating post reduction 0 with 490 rules applied. Total rules applied 492 place count 867 transition count 638
Reduce places removed 484 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 544 rules applied. Total rules applied 1036 place count 383 transition count 578
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 1078 place count 344 transition count 575
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1081 place count 341 transition count 575
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1081 place count 341 transition count 526
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1179 place count 292 transition count 526
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1190 place count 281 transition count 510
Iterating global reduction 4 with 11 rules applied. Total rules applied 1201 place count 281 transition count 510
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 1204 place count 281 transition count 507
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1207 place count 278 transition count 507
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1215 place count 270 transition count 497
Iterating global reduction 6 with 8 rules applied. Total rules applied 1223 place count 270 transition count 497
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 270 transition count 491
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1230 place count 269 transition count 485
Iterating global reduction 7 with 1 rules applied. Total rules applied 1231 place count 269 transition count 485
Performed 141 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 7 with 282 rules applied. Total rules applied 1513 place count 128 transition count 248
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1527 place count 128 transition count 234
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1530 place count 125 transition count 231
Iterating global reduction 8 with 3 rules applied. Total rules applied 1533 place count 125 transition count 231
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 8 with 26 rules applied. Total rules applied 1559 place count 112 transition count 215
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1574 place count 112 transition count 200
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 1576 place count 111 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1578 place count 111 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1580 place count 110 transition count 196
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1582 place count 110 transition count 194
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 11 with 66 rules applied. Total rules applied 1648 place count 77 transition count 225
Drop transitions removed 21 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 11 with 46 rules applied. Total rules applied 1694 place count 77 transition count 179
Discarding 23 places :
Symmetric choice reduction at 12 with 23 rule applications. Total rules 1717 place count 54 transition count 149
Iterating global reduction 12 with 23 rules applied. Total rules applied 1740 place count 54 transition count 149
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1754 place count 54 transition count 135
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1760 place count 48 transition count 123
Iterating global reduction 13 with 6 rules applied. Total rules applied 1766 place count 48 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1772 place count 48 transition count 117
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1793 place count 48 transition count 96
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1795 place count 46 transition count 90
Iterating global reduction 14 with 2 rules applied. Total rules applied 1797 place count 46 transition count 90
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1799 place count 44 transition count 88
Iterating global reduction 14 with 2 rules applied. Total rules applied 1801 place count 44 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1802 place count 44 transition count 87
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1803 place count 44 transition count 86
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1806 place count 44 transition count 83
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 1810 place count 41 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1811 place count 41 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1812 place count 40 transition count 81
Applied a total of 1812 rules in 130 ms. Remains 40 /1506 variables (removed 1466) and now considering 81/1928 (removed 1847) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/1506 places, 81/1928 transitions.
Finished random walk after 28 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 727 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 783 reset in 266 ms.
Product exploration explored 100000 steps with 775 reset in 273 ms.
Built C files in :
/tmp/ltsmin7947460945012200277
[2022-05-16 05:31:22] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7947460945012200277
Running compilation step : cd /tmp/ltsmin7947460945012200277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7947460945012200277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7947460945012200277;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 66 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:31:25] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 05:31:25] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:31:25] [INFO ] Computed 4 place invariants in 8 ms
[2022-05-16 05:31:26] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
// Phase 1: matrix 1928 rows 1506 cols
[2022-05-16 05:31:26] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-16 05:31:27] [INFO ] Dead Transitions using invariants and state equation in 1265 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1506/1506 places, 1928/1928 transitions.
Built C files in :
/tmp/ltsmin4975481565192474722
[2022-05-16 05:31:27] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4975481565192474722
Running compilation step : cd /tmp/ltsmin4975481565192474722;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4975481565192474722;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4975481565192474722;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 05:31:30] [INFO ] Flatten gal took : 51 ms
[2022-05-16 05:31:30] [INFO ] Flatten gal took : 52 ms
[2022-05-16 05:31:30] [INFO ] Time to serialize gal into /tmp/LTL16390485190023366059.gal : 36 ms
[2022-05-16 05:31:30] [INFO ] Time to serialize properties into /tmp/LTL3898431577155063793.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16390485190023366059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3898431577155063793.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1639048...267
Read 1 LTL properties
Checking formula 0 : !((F(X(X(G((X("(p704==1)"))||("(p388==0)")))))))
Formula 0 simplified : !FXXG("(p388==0)" | X"(p704==1)")
Detected timeout of ITS tools.
[2022-05-16 05:31:45] [INFO ] Flatten gal took : 46 ms
[2022-05-16 05:31:45] [INFO ] Applying decomposition
[2022-05-16 05:31:46] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6341731424236035639.txt' '-o' '/tmp/graph6341731424236035639.bin' '-w' '/tmp/graph6341731424236035639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6341731424236035639.bin' '-l' '-1' '-v' '-w' '/tmp/graph6341731424236035639.weights' '-q' '0' '-e' '0.001'
[2022-05-16 05:31:46] [INFO ] Decomposing Gal with order
[2022-05-16 05:31:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 05:31:46] [INFO ] Removed a total of 498 redundant transitions.
[2022-05-16 05:31:46] [INFO ] Flatten gal took : 107 ms
[2022-05-16 05:31:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 41 ms.
[2022-05-16 05:31:46] [INFO ] Time to serialize gal into /tmp/LTL15996959685705441185.gal : 16 ms
[2022-05-16 05:31:46] [INFO ] Time to serialize properties into /tmp/LTL9087250057446677706.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15996959685705441185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9087250057446677706.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1599695...246
Read 1 LTL properties
Checking formula 0 : !((F(X(X(G((X("(i10.i0.i3.u145.p704==1)"))||("(i3.u72.p388==0)")))))))
Formula 0 simplified : !FXXG("(i3.u72.p388==0)" | X"(i10.i0.i3.u145.p704==1)")
Reverse transition relation is NOT exact ! Due to transitions t26, t181, t263, t294, t374, t445, t654, t736, t767, t796, t845, t967, t1126, t1155, t1207, t...2038
Computing Next relation with stutter on 89440 deadlock states
39 unique states visited
38 strongly connected components in search stack
41 transitions explored
39 items max in DFS search stack
865 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.91037,203936,1,0,317947,11734,22186,726215,678,87423,1410620
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-315-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudReconfiguration-PT-315-LTLFireability-15 finished in 52610 ms.
All properties solved by simple procedures.
Total runtime 230175 ms.
BK_STOP 1652679116697
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-315"
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-4028"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-315, 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 r042-smll-165252095600324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-315.tgz
mv CloudReconfiguration-PT-315 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 '
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 ;