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.r060-tall-165254771700188.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 DLCround-PT-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254771700188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.4K Apr 30 07:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 07:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:28 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 963K 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 DLCround-PT-07b-LTLFireability-00
FORMULA_NAME DLCround-PT-07b-LTLFireability-01
FORMULA_NAME DLCround-PT-07b-LTLFireability-02
FORMULA_NAME DLCround-PT-07b-LTLFireability-03
FORMULA_NAME DLCround-PT-07b-LTLFireability-04
FORMULA_NAME DLCround-PT-07b-LTLFireability-05
FORMULA_NAME DLCround-PT-07b-LTLFireability-06
FORMULA_NAME DLCround-PT-07b-LTLFireability-07
FORMULA_NAME DLCround-PT-07b-LTLFireability-08
FORMULA_NAME DLCround-PT-07b-LTLFireability-09
FORMULA_NAME DLCround-PT-07b-LTLFireability-10
FORMULA_NAME DLCround-PT-07b-LTLFireability-11
FORMULA_NAME DLCround-PT-07b-LTLFireability-12
FORMULA_NAME DLCround-PT-07b-LTLFireability-13
FORMULA_NAME DLCround-PT-07b-LTLFireability-14
FORMULA_NAME DLCround-PT-07b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652574394568

Running Version 202205111006
[2022-05-15 00:26:35] [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-15 00:26:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 00:26:35] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2022-05-15 00:26:36] [INFO ] Transformed 2703 places.
[2022-05-15 00:26:36] [INFO ] Transformed 4071 transitions.
[2022-05-15 00:26:36] [INFO ] Found NUPN structural information;
[2022-05-15 00:26:36] [INFO ] Parsed PT model containing 2703 places and 4071 transitions in 341 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DLCround-PT-07b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 2703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2703/2703 places, 4071/4071 transitions.
Discarding 472 places :
Symmetric choice reduction at 0 with 472 rule applications. Total rules 472 place count 2231 transition count 3599
Iterating global reduction 0 with 472 rules applied. Total rules applied 944 place count 2231 transition count 3599
Discarding 373 places :
Symmetric choice reduction at 0 with 373 rule applications. Total rules 1317 place count 1858 transition count 3226
Iterating global reduction 0 with 373 rules applied. Total rules applied 1690 place count 1858 transition count 3226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 1698 place count 1858 transition count 3218
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 1753 place count 1803 transition count 3100
Iterating global reduction 1 with 55 rules applied. Total rules applied 1808 place count 1803 transition count 3100
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 1842 place count 1769 transition count 3066
Iterating global reduction 1 with 34 rules applied. Total rules applied 1876 place count 1769 transition count 3066
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1879 place count 1769 transition count 3063
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1898 place count 1750 transition count 3044
Iterating global reduction 2 with 19 rules applied. Total rules applied 1917 place count 1750 transition count 3044
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1936 place count 1731 transition count 3025
Iterating global reduction 2 with 19 rules applied. Total rules applied 1955 place count 1731 transition count 3025
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1974 place count 1712 transition count 3006
Iterating global reduction 2 with 19 rules applied. Total rules applied 1993 place count 1712 transition count 3006
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 2004 place count 1701 transition count 2995
Iterating global reduction 2 with 11 rules applied. Total rules applied 2015 place count 1701 transition count 2995
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2022 place count 1694 transition count 2988
Iterating global reduction 2 with 7 rules applied. Total rules applied 2029 place count 1694 transition count 2988
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2036 place count 1687 transition count 2981
Iterating global reduction 2 with 7 rules applied. Total rules applied 2043 place count 1687 transition count 2981
Applied a total of 2043 rules in 1443 ms. Remains 1687 /2703 variables (removed 1016) and now considering 2981/4071 (removed 1090) transitions.
// Phase 1: matrix 2981 rows 1687 cols
[2022-05-15 00:26:37] [INFO ] Computed 132 place invariants in 34 ms
[2022-05-15 00:26:38] [INFO ] Implicit Places using invariants in 682 ms returned []
// Phase 1: matrix 2981 rows 1687 cols
[2022-05-15 00:26:38] [INFO ] Computed 132 place invariants in 16 ms
[2022-05-15 00:26:39] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 2161 ms to find 0 implicit places.
// Phase 1: matrix 2981 rows 1687 cols
[2022-05-15 00:26:39] [INFO ] Computed 132 place invariants in 15 ms
[2022-05-15 00:26:41] [INFO ] Dead Transitions using invariants and state equation in 1282 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1687/2703 places, 2981/4071 transitions.
Finished structural reductions, in 1 iterations. Remains : 1687/2703 places, 2981/4071 transitions.
Support contains 37 out of 1687 places after structural reductions.
[2022-05-15 00:26:41] [INFO ] Flatten gal took : 195 ms
[2022-05-15 00:26:41] [INFO ] Flatten gal took : 133 ms
[2022-05-15 00:26:41] [INFO ] Input system was already deterministic with 2981 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 877 ms. (steps per millisecond=11 ) properties (out of 29) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2981 rows 1687 cols
[2022-05-15 00:26:43] [INFO ] Computed 132 place invariants in 29 ms
[2022-05-15 00:26:44] [INFO ] [Real]Absence check using 132 positive place invariants in 80 ms returned sat
[2022-05-15 00:26:44] [INFO ] After 1129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-15 00:26:45] [INFO ] [Nat]Absence check using 132 positive place invariants in 87 ms returned sat
[2022-05-15 00:26:46] [INFO ] After 1565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-15 00:26:48] [INFO ] After 3215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 853 ms.
[2022-05-15 00:26:49] [INFO ] After 4963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 8 properties in 290 ms.
Support contains 6 out of 1687 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Graph (trivial) has 1507 edges and 1687 vertex of which 436 / 1687 are part of one of the 36 SCC in 7 ms
Free SCC test removed 400 places
Drop transitions removed 456 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 469 transitions.
Drop transitions removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 270 place count 1287 transition count 2243
Reduce places removed 269 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 307 rules applied. Total rules applied 577 place count 1018 transition count 2205
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 602 place count 993 transition count 2205
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 602 place count 993 transition count 2075
Deduced a syphon composed of 130 places in 5 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 862 place count 863 transition count 2075
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 926 place count 799 transition count 1673
Iterating global reduction 3 with 64 rules applied. Total rules applied 990 place count 799 transition count 1673
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 994 place count 799 transition count 1669
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 994 place count 799 transition count 1663
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1006 place count 793 transition count 1663
Performed 299 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 299 places in 1 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 4 with 598 rules applied. Total rules applied 1604 place count 494 transition count 1356
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1612 place count 494 transition count 1348
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1633 place count 473 transition count 1129
Iterating global reduction 5 with 21 rules applied. Total rules applied 1654 place count 473 transition count 1129
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1674 place count 473 transition count 1109
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -298
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 1742 place count 439 transition count 1407
Drop transitions removed 13 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1758 place count 439 transition count 1391
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 1775 place count 422 transition count 1030
Iterating global reduction 7 with 17 rules applied. Total rules applied 1792 place count 422 transition count 1030
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 1809 place count 422 transition count 1013
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1815 place count 419 transition count 1032
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 8 with 108 rules applied. Total rules applied 1923 place count 419 transition count 924
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1931 place count 411 transition count 835
Iterating global reduction 8 with 8 rules applied. Total rules applied 1939 place count 411 transition count 835
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1947 place count 411 transition count 827
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1955 place count 407 transition count 856
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1960 place count 407 transition count 851
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 1982 place count 407 transition count 829
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1990 place count 403 transition count 856
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1996 place count 403 transition count 850
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 2017 place count 403 transition count 829
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2025 place count 399 transition count 858
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2031 place count 399 transition count 852
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 2052 place count 399 transition count 831
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2060 place count 395 transition count 858
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 2066 place count 395 transition count 852
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 2087 place count 395 transition count 831
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2095 place count 391 transition count 860
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2101 place count 391 transition count 854
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 2122 place count 391 transition count 833
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2130 place count 387 transition count 860
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2136 place count 387 transition count 854
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 2157 place count 387 transition count 833
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2165 place count 383 transition count 862
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2171 place count 383 transition count 856
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 2192 place count 383 transition count 835
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2200 place count 379 transition count 862
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2206 place count 379 transition count 856
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 2227 place count 379 transition count 835
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2235 place count 375 transition count 863
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2241 place count 375 transition count 857
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 2262 place count 375 transition count 836
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2270 place count 371 transition count 871
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2276 place count 371 transition count 865
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2297 place count 371 transition count 844
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2305 place count 367 transition count 881
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2311 place count 367 transition count 875
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2332 place count 367 transition count 854
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2340 place count 363 transition count 881
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2346 place count 363 transition count 875
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2367 place count 363 transition count 854
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2375 place count 359 transition count 883
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2381 place count 359 transition count 877
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2402 place count 359 transition count 856
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2410 place count 355 transition count 883
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2416 place count 355 transition count 877
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 2437 place count 355 transition count 856
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 2445 place count 351 transition count 883
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 23 with 5 rules applied. Total rules applied 2450 place count 351 transition count 878
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 2471 place count 351 transition count 857
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 2479 place count 347 transition count 876
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 2483 place count 347 transition count 872
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 25 with 19 rules applied. Total rules applied 2502 place count 347 transition count 853
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 2510 place count 343 transition count 872
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 2514 place count 343 transition count 868
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 26 with 19 rules applied. Total rules applied 2533 place count 343 transition count 849
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 2541 place count 339 transition count 868
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 2545 place count 339 transition count 864
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 27 with 19 rules applied. Total rules applied 2564 place count 339 transition count 845
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 2572 place count 335 transition count 864
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 2576 place count 335 transition count 860
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 28 with 19 rules applied. Total rules applied 2595 place count 335 transition count 841
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 2603 place count 331 transition count 860
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2607 place count 331 transition count 856
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 2626 place count 331 transition count 837
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 2634 place count 327 transition count 856
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 2638 place count 327 transition count 852
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 2657 place count 327 transition count 833
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 2665 place count 323 transition count 852
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 2669 place count 323 transition count 848
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 2688 place count 323 transition count 829
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 2696 place count 319 transition count 848
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 2700 place count 319 transition count 844
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 2719 place count 319 transition count 825
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 2727 place count 315 transition count 852
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 2731 place count 315 transition count 848
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 2750 place count 315 transition count 829
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 2758 place count 311 transition count 860
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 2762 place count 311 transition count 856
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 2781 place count 311 transition count 837
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 2789 place count 307 transition count 856
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 2793 place count 307 transition count 852
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 2812 place count 307 transition count 833
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 2820 place count 303 transition count 852
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 2824 place count 303 transition count 848
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 36 with 19 rules applied. Total rules applied 2843 place count 303 transition count 829
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 2851 place count 299 transition count 848
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 2855 place count 299 transition count 844
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 2874 place count 299 transition count 825
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 37 with 2 rules applied. Total rules applied 2876 place count 298 transition count 827
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 37 with 1 rules applied. Total rules applied 2877 place count 298 transition count 826
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 38 with 2 rules applied. Total rules applied 2879 place count 298 transition count 824
Free-agglomeration rule applied 33 times with reduction of 2 identical transitions.
Iterating global reduction 38 with 33 rules applied. Total rules applied 2912 place count 298 transition count 789
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 275 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 276 transitions.
Graph (complete) has 788 edges and 265 vertex of which 167 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.4 ms
Discarding 98 places :
Also discarding 0 output transitions
Iterating post reduction 38 with 310 rules applied. Total rules applied 3222 place count 167 transition count 513
Drop transitions removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 39 with 98 rules applied. Total rules applied 3320 place count 167 transition count 415
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 40 with 42 rules applied. Total rules applied 3362 place count 167 transition count 373
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 40 with 1 rules applied. Total rules applied 3363 place count 166 transition count 372
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 40 with 8 rules applied. Total rules applied 3371 place count 159 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 41 with 1 rules applied. Total rules applied 3372 place count 158 transition count 371
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 42 with 84 rules applied. Total rules applied 3456 place count 102 transition count 343
Drop transitions removed 28 transitions
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 42 with 93 rules applied. Total rules applied 3549 place count 102 transition count 250
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 43 with 96 rules applied. Total rules applied 3645 place count 38 transition count 218
Drop transitions removed 60 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 119 transitions.
Graph (trivial) has 13 edges and 38 vertex of which 11 / 38 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 43 with 120 rules applied. Total rules applied 3765 place count 32 transition count 99
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 65 edges and 29 vertex of which 21 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 44 with 48 rules applied. Total rules applied 3813 place count 21 transition count 52
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 45 with 6 rules applied. Total rules applied 3819 place count 21 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 46 with 9 rules applied. Total rules applied 3828 place count 15 transition count 43
Drop transitions removed 3 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 46 with 15 rules applied. Total rules applied 3843 place count 15 transition count 28
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 47 with 4 rules applied. Total rules applied 3847 place count 15 transition count 24
Applied a total of 3847 rules in 1248 ms. Remains 15 /1687 variables (removed 1672) and now considering 24/2981 (removed 2957) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/1687 places, 24/2981 transitions.
Finished random walk after 79 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=39 )
Computed a total of 265 stabilizing places and 265 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 2 out of 1687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Graph (trivial) has 1514 edges and 1687 vertex of which 436 / 1687 are part of one of the 36 SCC in 2 ms
Free SCC test removed 400 places
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 272 place count 1286 transition count 2276
Reduce places removed 271 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 309 rules applied. Total rules applied 581 place count 1015 transition count 2238
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 606 place count 990 transition count 2238
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 606 place count 990 transition count 2108
Deduced a syphon composed of 130 places in 6 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 866 place count 860 transition count 2108
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 931 place count 795 transition count 1695
Iterating global reduction 3 with 65 rules applied. Total rules applied 996 place count 795 transition count 1695
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1000 place count 795 transition count 1691
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 1000 place count 795 transition count 1685
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1012 place count 789 transition count 1685
Performed 296 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 4 with 592 rules applied. Total rules applied 1604 place count 493 transition count 1382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1612 place count 493 transition count 1374
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1633 place count 472 transition count 1155
Iterating global reduction 5 with 21 rules applied. Total rules applied 1654 place count 472 transition count 1155
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1674 place count 472 transition count 1135
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1698 place count 460 transition count 1226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1702 place count 460 transition count 1222
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1706 place count 456 transition count 1154
Iterating global reduction 7 with 4 rules applied. Total rules applied 1710 place count 456 transition count 1154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1714 place count 456 transition count 1150
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1722 place count 452 transition count 1176
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 8 with 33 rules applied. Total rules applied 1755 place count 452 transition count 1143
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1770 place count 437 transition count 1113
Iterating global reduction 8 with 15 rules applied. Total rules applied 1785 place count 437 transition count 1113
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1800 place count 422 transition count 944
Iterating global reduction 8 with 15 rules applied. Total rules applied 1815 place count 422 transition count 944
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1830 place count 422 transition count 929
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1831 place count 422 transition count 929
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1832 place count 422 transition count 928
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1833 place count 421 transition count 926
Iterating global reduction 9 with 1 rules applied. Total rules applied 1834 place count 421 transition count 926
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1835 place count 420 transition count 915
Iterating global reduction 9 with 1 rules applied. Total rules applied 1836 place count 420 transition count 915
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1837 place count 420 transition count 914
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1838 place count 419 transition count 913
Applied a total of 1838 rules in 352 ms. Remains 419 /1687 variables (removed 1268) and now considering 913/2981 (removed 2068) transitions.
[2022-05-15 00:26:51] [INFO ] Flow matrix only has 889 transitions (discarded 24 similar events)
// Phase 1: matrix 889 rows 419 cols
[2022-05-15 00:26:51] [INFO ] Computed 132 place invariants in 8 ms
[2022-05-15 00:26:51] [INFO ] Implicit Places using invariants in 184 ms returned []
[2022-05-15 00:26:51] [INFO ] Flow matrix only has 889 transitions (discarded 24 similar events)
// Phase 1: matrix 889 rows 419 cols
[2022-05-15 00:26:51] [INFO ] Computed 132 place invariants in 3 ms
[2022-05-15 00:26:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 00:26:52] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2022-05-15 00:26:52] [INFO ] Redundant transitions in 50 ms returned []
[2022-05-15 00:26:52] [INFO ] Flow matrix only has 889 transitions (discarded 24 similar events)
// Phase 1: matrix 889 rows 419 cols
[2022-05-15 00:26:52] [INFO ] Computed 132 place invariants in 2 ms
[2022-05-15 00:26:52] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/1687 places, 913/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/1687 places, 913/2981 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s59 1) (EQ s409 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 2 ms.
FORMULA DLCround-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-00 finished in 1502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Graph (trivial) has 1514 edges and 1687 vertex of which 436 / 1687 are part of one of the 36 SCC in 2 ms
Free SCC test removed 400 places
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 270 place count 1286 transition count 2278
Reduce places removed 269 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 307 rules applied. Total rules applied 577 place count 1017 transition count 2240
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 602 place count 992 transition count 2240
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 602 place count 992 transition count 2109
Deduced a syphon composed of 131 places in 6 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 864 place count 861 transition count 2109
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 929 place count 796 transition count 1686
Iterating global reduction 3 with 65 rules applied. Total rules applied 994 place count 796 transition count 1686
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 998 place count 796 transition count 1682
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 998 place count 796 transition count 1677
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1008 place count 791 transition count 1677
Performed 298 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 298 places in 0 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 4 with 596 rules applied. Total rules applied 1604 place count 493 transition count 1371
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1612 place count 493 transition count 1363
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1633 place count 472 transition count 1144
Iterating global reduction 5 with 21 rules applied. Total rules applied 1654 place count 472 transition count 1144
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1674 place count 472 transition count 1124
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1700 place count 459 transition count 1220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1704 place count 459 transition count 1216
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1708 place count 455 transition count 1148
Iterating global reduction 7 with 4 rules applied. Total rules applied 1712 place count 455 transition count 1148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1716 place count 455 transition count 1144
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1724 place count 451 transition count 1170
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 1760 place count 451 transition count 1134
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1776 place count 435 transition count 1102
Iterating global reduction 8 with 16 rules applied. Total rules applied 1792 place count 435 transition count 1102
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1808 place count 419 transition count 920
Iterating global reduction 8 with 16 rules applied. Total rules applied 1824 place count 419 transition count 920
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1840 place count 419 transition count 904
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1841 place count 418 transition count 903
Applied a total of 1841 rules in 238 ms. Remains 418 /1687 variables (removed 1269) and now considering 903/2981 (removed 2078) transitions.
[2022-05-15 00:26:53] [INFO ] Flow matrix only has 878 transitions (discarded 25 similar events)
// Phase 1: matrix 878 rows 418 cols
[2022-05-15 00:26:53] [INFO ] Computed 132 place invariants in 8 ms
[2022-05-15 00:26:53] [INFO ] Implicit Places using invariants in 171 ms returned []
[2022-05-15 00:26:53] [INFO ] Flow matrix only has 878 transitions (discarded 25 similar events)
// Phase 1: matrix 878 rows 418 cols
[2022-05-15 00:26:53] [INFO ] Computed 132 place invariants in 1 ms
[2022-05-15 00:26:53] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-05-15 00:26:53] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2022-05-15 00:26:53] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-15 00:26:53] [INFO ] Flow matrix only has 878 transitions (discarded 25 similar events)
// Phase 1: matrix 878 rows 418 cols
[2022-05-15 00:26:53] [INFO ] Computed 132 place invariants in 3 ms
[2022-05-15 00:26:53] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 418/1687 places, 903/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/1687 places, 903/2981 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s336 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 277 steps with 0 reset in 18 ms.
FORMULA DLCround-PT-07b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-01 finished in 1187 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Graph (trivial) has 1514 edges and 1687 vertex of which 436 / 1687 are part of one of the 36 SCC in 1 ms
Free SCC test removed 400 places
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 271 place count 1286 transition count 2277
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 308 rules applied. Total rules applied 579 place count 1016 transition count 2239
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 604 place count 991 transition count 2239
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 604 place count 991 transition count 2109
Deduced a syphon composed of 130 places in 6 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 864 place count 861 transition count 2109
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 929 place count 796 transition count 1696
Iterating global reduction 3 with 65 rules applied. Total rules applied 994 place count 796 transition count 1696
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 998 place count 796 transition count 1692
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 998 place count 796 transition count 1686
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1010 place count 790 transition count 1686
Performed 297 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 297 places in 0 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 4 with 594 rules applied. Total rules applied 1604 place count 493 transition count 1382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1612 place count 493 transition count 1374
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1633 place count 472 transition count 1155
Iterating global reduction 5 with 21 rules applied. Total rules applied 1654 place count 472 transition count 1155
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1674 place count 472 transition count 1135
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1698 place count 460 transition count 1227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1702 place count 460 transition count 1223
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1706 place count 456 transition count 1153
Iterating global reduction 7 with 4 rules applied. Total rules applied 1710 place count 456 transition count 1153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1714 place count 456 transition count 1149
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1722 place count 452 transition count 1174
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 8 with 33 rules applied. Total rules applied 1755 place count 452 transition count 1141
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1771 place count 436 transition count 1109
Iterating global reduction 8 with 16 rules applied. Total rules applied 1787 place count 436 transition count 1109
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1803 place count 420 transition count 931
Iterating global reduction 8 with 16 rules applied. Total rules applied 1819 place count 420 transition count 931
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1835 place count 420 transition count 915
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1836 place count 419 transition count 914
Applied a total of 1836 rules in 217 ms. Remains 419 /1687 variables (removed 1268) and now considering 914/2981 (removed 2067) transitions.
[2022-05-15 00:26:54] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 419 cols
[2022-05-15 00:26:54] [INFO ] Computed 132 place invariants in 4 ms
[2022-05-15 00:26:54] [INFO ] Implicit Places using invariants in 160 ms returned []
[2022-05-15 00:26:54] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 419 cols
[2022-05-15 00:26:54] [INFO ] Computed 132 place invariants in 2 ms
[2022-05-15 00:26:54] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 00:26:54] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2022-05-15 00:26:54] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-15 00:26:54] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 419 cols
[2022-05-15 00:26:54] [INFO ] Computed 132 place invariants in 3 ms
[2022-05-15 00:26:55] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/1687 places, 914/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/1687 places, 914/2981 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-02 finished in 1142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U F(X(X(F((p1||(G(p2)&&X(p0)))))))))'
Support contains 4 out of 1687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1675 transition count 2948
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1675 transition count 2948
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1670 transition count 2943
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1670 transition count 2943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1670 transition count 2942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1668 transition count 2940
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1668 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1667 transition count 2939
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1667 transition count 2939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1666 transition count 2938
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1666 transition count 2938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1665 transition count 2937
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1665 transition count 2937
Applied a total of 45 rules in 329 ms. Remains 1665 /1687 variables (removed 22) and now considering 2937/2981 (removed 44) transitions.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:26:55] [INFO ] Computed 132 place invariants in 15 ms
[2022-05-15 00:26:55] [INFO ] Implicit Places using invariants in 422 ms returned []
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:26:55] [INFO ] Computed 132 place invariants in 15 ms
[2022-05-15 00:26:57] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:26:57] [INFO ] Computed 132 place invariants in 6 ms
[2022-05-15 00:26:58] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1665/1687 places, 2937/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 1665/1687 places, 2937/2981 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s267 1) (EQ s1333 1)), p2:(EQ s784 1), p0:(EQ s154 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 16 reset in 587 ms.
Product exploration explored 100000 steps with 18 reset in 650 ms.
Computed a total of 261 stabilizing places and 261 stable transitions
Computed a total of 261 stabilizing places and 261 stable transitions
Detected a total of 261/1665 stabilizing places and 261/2937 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1692 steps, including 0 resets, run visited all 4 properties in 41 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:27:01] [INFO ] Computed 132 place invariants in 15 ms
[2022-05-15 00:27:02] [INFO ] [Real]Absence check using 132 positive place invariants in 168 ms returned sat
[2022-05-15 00:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 00:27:06] [INFO ] [Real]Absence check using state equation in 4038 ms returned sat
[2022-05-15 00:27:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 00:27:07] [INFO ] [Nat]Absence check using 132 positive place invariants in 173 ms returned sat
[2022-05-15 00:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 00:27:12] [INFO ] [Nat]Absence check using state equation in 4349 ms returned sat
[2022-05-15 00:27:12] [INFO ] Computed and/alt/rep : 2736/4628/2736 causal constraints (skipped 200 transitions) in 146 ms.
[2022-05-15 00:27:21] [INFO ] Added : 380 causal constraints over 76 iterations in 9359 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:27:21] [INFO ] Computed 132 place invariants in 10 ms
[2022-05-15 00:27:22] [INFO ] [Real]Absence check using 132 positive place invariants in 160 ms returned sat
[2022-05-15 00:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 00:27:27] [INFO ] [Real]Absence check using state equation in 4111 ms returned sat
[2022-05-15 00:27:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 00:27:28] [INFO ] [Nat]Absence check using 132 positive place invariants in 163 ms returned sat
[2022-05-15 00:27:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 00:27:32] [INFO ] [Nat]Absence check using state equation in 4300 ms returned sat
[2022-05-15 00:27:32] [INFO ] Computed and/alt/rep : 2736/4628/2736 causal constraints (skipped 200 transitions) in 141 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 00:27:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 1665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1665/1665 places, 2937/2937 transitions.
Applied a total of 0 rules in 51 ms. Remains 1665 /1665 variables (removed 0) and now considering 2937/2937 (removed 0) transitions.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:27:42] [INFO ] Computed 132 place invariants in 12 ms
[2022-05-15 00:27:42] [INFO ] Implicit Places using invariants in 403 ms returned []
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:27:42] [INFO ] Computed 132 place invariants in 5 ms
[2022-05-15 00:27:43] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:27:43] [INFO ] Computed 132 place invariants in 11 ms
[2022-05-15 00:27:45] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1665/1665 places, 2937/2937 transitions.
Computed a total of 261 stabilizing places and 261 stable transitions
Computed a total of 261 stabilizing places and 261 stable transitions
Detected a total of 261/1665 stabilizing places and 261/2937 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1469 steps, including 0 resets, run visited all 4 properties in 30 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 273 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:27:46] [INFO ] Computed 132 place invariants in 6 ms
[2022-05-15 00:27:47] [INFO ] [Real]Absence check using 132 positive place invariants in 159 ms returned sat
[2022-05-15 00:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 00:27:51] [INFO ] [Real]Absence check using state equation in 4042 ms returned sat
[2022-05-15 00:27:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 00:27:52] [INFO ] [Nat]Absence check using 132 positive place invariants in 176 ms returned sat
[2022-05-15 00:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 00:27:56] [INFO ] [Nat]Absence check using state equation in 4196 ms returned sat
[2022-05-15 00:27:56] [INFO ] Computed and/alt/rep : 2736/4628/2736 causal constraints (skipped 200 transitions) in 153 ms.
[2022-05-15 00:28:07] [INFO ] Deduced a trap composed of 10 places in 816 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 00:28:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:28:07] [INFO ] Computed 132 place invariants in 7 ms
[2022-05-15 00:28:08] [INFO ] [Real]Absence check using 132 positive place invariants in 159 ms returned sat
[2022-05-15 00:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 00:28:12] [INFO ] [Real]Absence check using state equation in 3846 ms returned sat
[2022-05-15 00:28:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 00:28:13] [INFO ] [Nat]Absence check using 132 positive place invariants in 177 ms returned sat
[2022-05-15 00:28:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 00:28:17] [INFO ] [Nat]Absence check using state equation in 4196 ms returned sat
[2022-05-15 00:28:18] [INFO ] Computed and/alt/rep : 2736/4628/2736 causal constraints (skipped 200 transitions) in 132 ms.
[2022-05-15 00:28:28] [INFO ] Deduced a trap composed of 10 places in 748 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 00:28:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14 reset in 497 ms.
Product exploration explored 100000 steps with 13 reset in 546 ms.
Built C files in :
/tmp/ltsmin13661836163557612156
[2022-05-15 00:28:30] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13661836163557612156
Running compilation step : cd /tmp/ltsmin13661836163557612156;'/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/ltsmin13661836163557612156;'/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/ltsmin13661836163557612156;'/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 4 out of 1665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1665/1665 places, 2937/2937 transitions.
Applied a total of 0 rules in 44 ms. Remains 1665 /1665 variables (removed 0) and now considering 2937/2937 (removed 0) transitions.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:28:33] [INFO ] Computed 132 place invariants in 10 ms
[2022-05-15 00:28:33] [INFO ] Implicit Places using invariants in 424 ms returned []
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:28:33] [INFO ] Computed 132 place invariants in 5 ms
[2022-05-15 00:28:34] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:28:34] [INFO ] Computed 132 place invariants in 5 ms
[2022-05-15 00:28:36] [INFO ] Dead Transitions using invariants and state equation in 1215 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1665/1665 places, 2937/2937 transitions.
Built C files in :
/tmp/ltsmin1822341717199492969
[2022-05-15 00:28:36] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1822341717199492969
Running compilation step : cd /tmp/ltsmin1822341717199492969;'/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/ltsmin1822341717199492969;'/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/ltsmin1822341717199492969;'/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-15 00:28:39] [INFO ] Flatten gal took : 85 ms
[2022-05-15 00:28:39] [INFO ] Flatten gal took : 87 ms
[2022-05-15 00:28:39] [INFO ] Time to serialize gal into /tmp/LTL10173164080352301651.gal : 16 ms
[2022-05-15 00:28:39] [INFO ] Time to serialize properties into /tmp/LTL9792006390979629562.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/LTL10173164080352301651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9792006390979629562.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/LTL1017316...267
Read 1 LTL properties
Checking formula 0 : !(((X(G("(p320==1)")))U(F(X(X(F(("((p521==1)&&(p2149==1))")||((G("(p1315==1)"))&&(X("(p320==1)"))))))))))
Formula 0 simplified : !(XG"(p320==1)" U FXXF("((p521==1)&&(p2149==1))" | (G"(p1315==1)" & X"(p320==1)")))
Detected timeout of ITS tools.
[2022-05-15 00:28:54] [INFO ] Flatten gal took : 78 ms
[2022-05-15 00:28:54] [INFO ] Applying decomposition
[2022-05-15 00:28:55] [INFO ] Flatten gal took : 95 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/graph2173654078809240734.txt' '-o' '/tmp/graph2173654078809240734.bin' '-w' '/tmp/graph2173654078809240734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2173654078809240734.bin' '-l' '-1' '-v' '-w' '/tmp/graph2173654078809240734.weights' '-q' '0' '-e' '0.001'
[2022-05-15 00:28:55] [INFO ] Decomposing Gal with order
[2022-05-15 00:28:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 00:28:55] [INFO ] Removed a total of 2678 redundant transitions.
[2022-05-15 00:28:55] [INFO ] Flatten gal took : 203 ms
[2022-05-15 00:28:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 55 ms.
[2022-05-15 00:28:55] [INFO ] Time to serialize gal into /tmp/LTL1706627068633641709.gal : 22 ms
[2022-05-15 00:28:55] [INFO ] Time to serialize properties into /tmp/LTL10219472573480180952.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/LTL1706627068633641709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10219472573480180952.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/LTL1706627...246
Read 1 LTL properties
Checking formula 0 : !(((X(G("(i2.u65.p320==1)")))U(F(X(X(F(("((i4.u112.p521==1)&&(i4.u512.p2149==1))")||((G("(i16.u325.p1315==1)"))&&(X("(i2.u65.p320==1)"...165
Formula 0 simplified : !(XG"(i2.u65.p320==1)" U FXXF("((i4.u112.p521==1)&&(i4.u512.p2149==1))" | (G"(i16.u325.p1315==1)" & X"(i2.u65.p320==1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8935401658768197328
[2022-05-15 00:29:10] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8935401658768197328
Running compilation step : cd /tmp/ltsmin8935401658768197328;'/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/ltsmin8935401658768197328;'/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/ltsmin8935401658768197328;'/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)
Treatment of property DLCround-PT-07b-LTLFireability-03 finished in 138813 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&p1))||(G(p2)&&X(p3))))'
Support contains 4 out of 1687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1676 transition count 2949
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1676 transition count 2949
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 1670 transition count 2943
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 1670 transition count 2943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1670 transition count 2942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1668 transition count 2940
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1668 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1667 transition count 2939
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1667 transition count 2939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1666 transition count 2938
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1666 transition count 2938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1665 transition count 2937
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1665 transition count 2937
Applied a total of 45 rules in 339 ms. Remains 1665 /1687 variables (removed 22) and now considering 2937/2981 (removed 44) transitions.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:29:15] [INFO ] Computed 132 place invariants in 10 ms
[2022-05-15 00:29:15] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:29:15] [INFO ] Computed 132 place invariants in 9 ms
[2022-05-15 00:29:16] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 1734 ms to find 0 implicit places.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:29:16] [INFO ] Computed 132 place invariants in 8 ms
[2022-05-15 00:29:17] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1665/1687 places, 2937/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 1665/1687 places, 2937/2981 transitions.
Stuttering acceptance computed with spot in 889 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=0 dest: 5}, { cond=(AND p1 p0 p2), acceptance={} source=0 dest: 6}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=6 dest: 4}]], initial=0, aps=[p1:(OR (EQ s515 0) (EQ s1518 0)), p2:(EQ s1425 0), p0:(EQ s1648 1), p3:(EQ s1648 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 491 ms.
Product exploration explored 100000 steps with 0 reset in 664 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0) p3), (X (NOT (AND p1 p0))), (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (AND (NOT p0) p2)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p0)), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 907 ms. Reduced automaton from 7 states, 22 edges and 4 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:29:21] [INFO ] Computed 132 place invariants in 5 ms
[2022-05-15 00:29:22] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 00:29:22] [INFO ] [Nat]Absence check using 132 positive place invariants in 81 ms returned sat
[2022-05-15 00:29:23] [INFO ] After 1332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-15 00:29:25] [INFO ] After 2373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 562 ms.
[2022-05-15 00:29:25] [INFO ] After 3562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Finished Parikh walk after 266 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=33 )
Parikh walk visited 7 properties in 77 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0) p3), (X (NOT (AND p1 p0))), (X (NOT (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (X (AND (NOT p0) p2)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p0)), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 p0 (NOT p2))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (F p0), (F (AND p1 p0 p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))), (F (AND p1 p0)), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 27 factoid took 1267 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 1665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1665/1665 places, 2937/2937 transitions.
Applied a total of 0 rules in 48 ms. Remains 1665 /1665 variables (removed 0) and now considering 2937/2937 (removed 0) transitions.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:29:27] [INFO ] Computed 132 place invariants in 11 ms
[2022-05-15 00:29:27] [INFO ] Implicit Places using invariants in 438 ms returned []
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:29:27] [INFO ] Computed 132 place invariants in 5 ms
[2022-05-15 00:29:29] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:29:29] [INFO ] Computed 132 place invariants in 6 ms
[2022-05-15 00:29:30] [INFO ] Dead Transitions using invariants and state equation in 1199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1665/1665 places, 2937/2937 transitions.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 516 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:29:31] [INFO ] Computed 132 place invariants in 14 ms
[2022-05-15 00:29:31] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 00:29:31] [INFO ] [Nat]Absence check using 132 positive place invariants in 82 ms returned sat
[2022-05-15 00:29:32] [INFO ] After 889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 00:29:33] [INFO ] After 1145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-05-15 00:29:33] [INFO ] After 1597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 275 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=68 )
Parikh walk visited 2 properties in 16 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 p0 (NOT p2))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p0) p2)))), (F p0), (F (AND p1 p0 p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))), (F (AND p1 p0)), (F (NOT (AND (NOT p0) p2))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 16 factoid took 4023 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 495 ms.
Product exploration explored 100000 steps with 0 reset in 657 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 1665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1665/1665 places, 2937/2937 transitions.
Graph (trivial) has 1490 edges and 1665 vertex of which 436 / 1665 are part of one of the 36 SCC in 1 ms
Free SCC test removed 400 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Performed 258 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 258 rules applied. Total rules applied 259 place count 1265 transition count 2505
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 283 place count 1265 transition count 2493
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 283 place count 1265 transition count 2499
Deduced a syphon composed of 280 places in 7 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 293 place count 1265 transition count 2499
Discarding 131 places :
Symmetric choice reduction at 2 with 131 rule applications. Total rules 424 place count 1134 transition count 2030
Deduced a syphon composed of 204 places in 6 ms
Iterating global reduction 2 with 131 rules applied. Total rules applied 555 place count 1134 transition count 2030
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 559 place count 1134 transition count 2026
Performed 422 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 626 places in 0 ms
Iterating global reduction 3 with 422 rules applied. Total rules applied 981 place count 1134 transition count 2034
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 989 place count 1134 transition count 2026
Renaming transitions due to excessive name length > 1024 char.
Discarding 310 places :
Symmetric choice reduction at 4 with 310 rule applications. Total rules 1299 place count 824 transition count 1528
Deduced a syphon composed of 336 places in 1 ms
Iterating global reduction 4 with 310 rules applied. Total rules applied 1609 place count 824 transition count 1528
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 1628 place count 824 transition count 1509
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1636 place count 816 transition count 1501
Deduced a syphon composed of 328 places in 0 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 1644 place count 816 transition count 1501
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -180
Deduced a syphon composed of 355 places in 1 ms
Iterating global reduction 5 with 27 rules applied. Total rules applied 1671 place count 816 transition count 1681
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1687 place count 816 transition count 1665
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1727 place count 776 transition count 1521
Deduced a syphon composed of 319 places in 0 ms
Iterating global reduction 6 with 40 rules applied. Total rules applied 1767 place count 776 transition count 1521
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1775 place count 776 transition count 1513
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1783 place count 768 transition count 1497
Deduced a syphon composed of 311 places in 1 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1791 place count 768 transition count 1497
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 315 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1795 place count 768 transition count 1529
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1799 place count 764 transition count 1521
Deduced a syphon composed of 311 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1803 place count 764 transition count 1521
Deduced a syphon composed of 311 places in 0 ms
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1837 place count 764 transition count 1487
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1853 place count 748 transition count 1455
Deduced a syphon composed of 311 places in 0 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 1869 place count 748 transition count 1455
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1885 place count 732 transition count 1273
Deduced a syphon composed of 311 places in 0 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 1901 place count 732 transition count 1273
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 1925 place count 732 transition count 1249
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1941 place count 716 transition count 1225
Deduced a syphon composed of 295 places in 0 ms
Iterating global reduction 8 with 16 rules applied. Total rules applied 1957 place count 716 transition count 1225
Deduced a syphon composed of 295 places in 1 ms
Applied a total of 1957 rules in 896 ms. Remains 716 /1665 variables (removed 949) and now considering 1225/2937 (removed 1712) transitions.
[2022-05-15 00:29:40] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-15 00:29:40] [INFO ] Flow matrix only has 1202 transitions (discarded 23 similar events)
// Phase 1: matrix 1202 rows 716 cols
[2022-05-15 00:29:40] [INFO ] Computed 132 place invariants in 25 ms
[2022-05-15 00:29:40] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 716/1665 places, 1225/2937 transitions.
Finished structural reductions, in 1 iterations. Remains : 716/1665 places, 1225/2937 transitions.
Stuttering criterion allowed to conclude after 354 steps with 0 reset in 8 ms.
FORMULA DLCround-PT-07b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-04 finished in 26733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p1)||(X(X(p2))&&X(p3)))))'
Support contains 3 out of 1687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1677 transition count 2950
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1677 transition count 2950
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 1672 transition count 2945
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 1672 transition count 2945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1672 transition count 2944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1671 transition count 2943
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1671 transition count 2943
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1670 transition count 2942
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1670 transition count 2942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1669 transition count 2941
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1669 transition count 2941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1668 transition count 2940
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1668 transition count 2940
Applied a total of 39 rules in 352 ms. Remains 1668 /1687 variables (removed 19) and now considering 2940/2981 (removed 41) transitions.
// Phase 1: matrix 2940 rows 1668 cols
[2022-05-15 00:29:41] [INFO ] Computed 132 place invariants in 12 ms
[2022-05-15 00:29:41] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 2940 rows 1668 cols
[2022-05-15 00:29:41] [INFO ] Computed 132 place invariants in 11 ms
[2022-05-15 00:29:42] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
// Phase 1: matrix 2940 rows 1668 cols
[2022-05-15 00:29:42] [INFO ] Computed 132 place invariants in 5 ms
[2022-05-15 00:29:44] [INFO ] Dead Transitions using invariants and state equation in 1141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1668/1687 places, 2940/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 1668/1687 places, 2940/2981 transitions.
Stuttering acceptance computed with spot in 1677 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p0) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0 p3), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0 p3), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p3)) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p3), acceptance={} source=4 dest: 0}, { cond=(OR (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p2:(EQ s1465 1), p1:(EQ s1448 1), p0:(EQ s418 0), p3:(EQ s1465 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-06 finished in 5022 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(G((F(p1)||p0))))||p2)))'
Support contains 6 out of 1687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Graph (trivial) has 1507 edges and 1687 vertex of which 436 / 1687 are part of one of the 36 SCC in 1 ms
Free SCC test removed 400 places
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 270 place count 1286 transition count 2278
Reduce places removed 269 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 307 rules applied. Total rules applied 577 place count 1017 transition count 2240
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 602 place count 992 transition count 2240
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 602 place count 992 transition count 2110
Deduced a syphon composed of 130 places in 6 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 862 place count 862 transition count 2110
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 926 place count 798 transition count 1708
Iterating global reduction 3 with 64 rules applied. Total rules applied 990 place count 798 transition count 1708
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 994 place count 798 transition count 1704
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 994 place count 798 transition count 1698
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1006 place count 792 transition count 1698
Performed 296 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 296 places in 0 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 4 with 592 rules applied. Total rules applied 1598 place count 496 transition count 1394
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1605 place count 496 transition count 1387
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1626 place count 475 transition count 1168
Iterating global reduction 5 with 21 rules applied. Total rules applied 1647 place count 475 transition count 1168
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1667 place count 475 transition count 1148
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1691 place count 463 transition count 1245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1694 place count 463 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1697 place count 460 transition count 1190
Iterating global reduction 7 with 3 rules applied. Total rules applied 1700 place count 460 transition count 1190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1703 place count 460 transition count 1187
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1709 place count 457 transition count 1207
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 1741 place count 457 transition count 1175
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1754 place count 444 transition count 1149
Iterating global reduction 8 with 13 rules applied. Total rules applied 1767 place count 444 transition count 1149
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1780 place count 431 transition count 1002
Iterating global reduction 8 with 13 rules applied. Total rules applied 1793 place count 431 transition count 1002
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1806 place count 431 transition count 989
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1808 place count 431 transition count 989
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1809 place count 431 transition count 988
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1810 place count 430 transition count 986
Iterating global reduction 9 with 1 rules applied. Total rules applied 1811 place count 430 transition count 986
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1812 place count 429 transition count 975
Iterating global reduction 9 with 1 rules applied. Total rules applied 1813 place count 429 transition count 975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1814 place count 429 transition count 974
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1815 place count 428 transition count 973
Applied a total of 1815 rules in 261 ms. Remains 428 /1687 variables (removed 1259) and now considering 973/2981 (removed 2008) transitions.
[2022-05-15 00:29:46] [INFO ] Flow matrix only has 947 transitions (discarded 26 similar events)
// Phase 1: matrix 947 rows 428 cols
[2022-05-15 00:29:46] [INFO ] Computed 132 place invariants in 2 ms
[2022-05-15 00:29:46] [INFO ] Implicit Places using invariants in 258 ms returned []
[2022-05-15 00:29:46] [INFO ] Flow matrix only has 947 transitions (discarded 26 similar events)
// Phase 1: matrix 947 rows 428 cols
[2022-05-15 00:29:46] [INFO ] Computed 132 place invariants in 4 ms
[2022-05-15 00:29:46] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 00:29:46] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2022-05-15 00:29:46] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-15 00:29:46] [INFO ] Flow matrix only has 947 transitions (discarded 26 similar events)
// Phase 1: matrix 947 rows 428 cols
[2022-05-15 00:29:46] [INFO ] Computed 132 place invariants in 4 ms
[2022-05-15 00:29:47] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 428/1687 places, 973/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 428/1687 places, 973/2981 transitions.
Stuttering acceptance computed with spot in 442 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s56 1) (EQ s370 1) (EQ s184 1)), p0:(OR (EQ s56 0) (EQ s370 0) (EQ s15 1)), p1:(AND (EQ s37 1) (EQ s307 1))], 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 887 steps with 0 reset in 14 ms.
FORMULA DLCround-PT-07b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-07 finished in 1824 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 1687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1675 transition count 2948
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1675 transition count 2948
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1670 transition count 2943
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1670 transition count 2943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1670 transition count 2942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1668 transition count 2940
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1668 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1667 transition count 2939
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1667 transition count 2939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1666 transition count 2938
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1666 transition count 2938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1665 transition count 2937
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1665 transition count 2937
Applied a total of 45 rules in 331 ms. Remains 1665 /1687 variables (removed 22) and now considering 2937/2981 (removed 44) transitions.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:29:47] [INFO ] Computed 132 place invariants in 14 ms
[2022-05-15 00:29:48] [INFO ] Implicit Places using invariants in 449 ms returned []
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:29:48] [INFO ] Computed 132 place invariants in 12 ms
[2022-05-15 00:29:49] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
// Phase 1: matrix 2937 rows 1665 cols
[2022-05-15 00:29:49] [INFO ] Computed 132 place invariants in 9 ms
[2022-05-15 00:29:50] [INFO ] Dead Transitions using invariants and state equation in 1147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1665/1687 places, 2937/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 1665/1687 places, 2937/2981 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1321 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 887 steps with 0 reset in 4 ms.
FORMULA DLCround-PT-07b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-09 finished in 3488 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p0))))'
Support contains 1 out of 1687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Graph (trivial) has 1513 edges and 1687 vertex of which 436 / 1687 are part of one of the 36 SCC in 1 ms
Free SCC test removed 400 places
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 271 place count 1286 transition count 2277
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 305 rules applied. Total rules applied 576 place count 1016 transition count 2242
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 24 rules applied. Total rules applied 600 place count 993 transition count 2241
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 603 place count 992 transition count 2239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 604 place count 991 transition count 2239
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 130 Pre rules applied. Total rules applied 604 place count 991 transition count 2109
Deduced a syphon composed of 130 places in 6 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 5 with 260 rules applied. Total rules applied 864 place count 861 transition count 2109
Discarding 66 places :
Symmetric choice reduction at 5 with 66 rule applications. Total rules 930 place count 795 transition count 1685
Iterating global reduction 5 with 66 rules applied. Total rules applied 996 place count 795 transition count 1685
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1000 place count 795 transition count 1681
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 1000 place count 795 transition count 1675
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1012 place count 789 transition count 1675
Performed 296 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 296 places in 1 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 6 with 592 rules applied. Total rules applied 1604 place count 493 transition count 1371
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1611 place count 493 transition count 1364
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 1632 place count 472 transition count 1145
Iterating global reduction 7 with 21 rules applied. Total rules applied 1653 place count 472 transition count 1145
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1673 place count 472 transition count 1125
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1697 place count 460 transition count 1216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1701 place count 460 transition count 1212
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1705 place count 456 transition count 1144
Iterating global reduction 9 with 4 rules applied. Total rules applied 1709 place count 456 transition count 1144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1713 place count 456 transition count 1140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1721 place count 452 transition count 1166
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 10 with 32 rules applied. Total rules applied 1753 place count 452 transition count 1134
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 1767 place count 438 transition count 1106
Iterating global reduction 10 with 14 rules applied. Total rules applied 1781 place count 438 transition count 1106
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 1795 place count 424 transition count 948
Iterating global reduction 10 with 14 rules applied. Total rules applied 1809 place count 424 transition count 948
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1823 place count 424 transition count 934
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1824 place count 424 transition count 934
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1825 place count 424 transition count 933
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1826 place count 423 transition count 931
Iterating global reduction 11 with 1 rules applied. Total rules applied 1827 place count 423 transition count 931
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1828 place count 422 transition count 920
Iterating global reduction 11 with 1 rules applied. Total rules applied 1829 place count 422 transition count 920
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1830 place count 422 transition count 919
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1831 place count 421 transition count 918
Applied a total of 1831 rules in 253 ms. Remains 421 /1687 variables (removed 1266) and now considering 918/2981 (removed 2063) transitions.
[2022-05-15 00:29:51] [INFO ] Flow matrix only has 893 transitions (discarded 25 similar events)
// Phase 1: matrix 893 rows 421 cols
[2022-05-15 00:29:51] [INFO ] Computed 132 place invariants in 3 ms
[2022-05-15 00:29:51] [INFO ] Implicit Places using invariants in 175 ms returned []
[2022-05-15 00:29:51] [INFO ] Flow matrix only has 893 transitions (discarded 25 similar events)
// Phase 1: matrix 893 rows 421 cols
[2022-05-15 00:29:51] [INFO ] Computed 132 place invariants in 2 ms
[2022-05-15 00:29:51] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 00:29:51] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2022-05-15 00:29:51] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-15 00:29:51] [INFO ] Flow matrix only has 893 transitions (discarded 25 similar events)
// Phase 1: matrix 893 rows 421 cols
[2022-05-15 00:29:51] [INFO ] Computed 132 place invariants in 5 ms
[2022-05-15 00:29:52] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 421/1687 places, 918/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/1687 places, 918/2981 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-10 finished in 1233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(G(X(p0)) U p0))||G(p1)))'
Support contains 2 out of 1687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1675 transition count 2948
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1675 transition count 2948
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1670 transition count 2943
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1670 transition count 2943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1670 transition count 2942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1669 transition count 2941
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1669 transition count 2941
Applied a total of 37 rules in 196 ms. Remains 1669 /1687 variables (removed 18) and now considering 2941/2981 (removed 40) transitions.
// Phase 1: matrix 2941 rows 1669 cols
[2022-05-15 00:29:52] [INFO ] Computed 132 place invariants in 12 ms
[2022-05-15 00:29:52] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 2941 rows 1669 cols
[2022-05-15 00:29:52] [INFO ] Computed 132 place invariants in 11 ms
[2022-05-15 00:29:54] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 1839 ms to find 0 implicit places.
// Phase 1: matrix 2941 rows 1669 cols
[2022-05-15 00:29:54] [INFO ] Computed 132 place invariants in 12 ms
[2022-05-15 00:29:55] [INFO ] Dead Transitions using invariants and state equation in 1125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1669/1687 places, 2941/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 1669/1687 places, 2941/2981 transitions.
Stuttering acceptance computed with spot in 724 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s1584 1), p1:(EQ s34 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 938 ms.
Product exploration explored 100000 steps with 50000 reset in 916 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (AND p1 (NOT p0)))
Knowledge based reduction with 11 factoid took 170 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DLCround-PT-07b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-07b-LTLFireability-11 finished in 5990 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||p1)))'
Support contains 3 out of 1687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1674 transition count 2947
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1674 transition count 2947
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 1668 transition count 2941
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 1668 transition count 2941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1668 transition count 2940
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1666 transition count 2938
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1666 transition count 2938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1665 transition count 2937
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1665 transition count 2937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1664 transition count 2936
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1664 transition count 2936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1663 transition count 2935
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1663 transition count 2935
Applied a total of 49 rules in 339 ms. Remains 1663 /1687 variables (removed 24) and now considering 2935/2981 (removed 46) transitions.
// Phase 1: matrix 2935 rows 1663 cols
[2022-05-15 00:29:58] [INFO ] Computed 132 place invariants in 16 ms
[2022-05-15 00:29:59] [INFO ] Implicit Places using invariants in 410 ms returned []
// Phase 1: matrix 2935 rows 1663 cols
[2022-05-15 00:29:59] [INFO ] Computed 132 place invariants in 6 ms
[2022-05-15 00:30:00] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
// Phase 1: matrix 2935 rows 1663 cols
[2022-05-15 00:30:00] [INFO ] Computed 132 place invariants in 15 ms
[2022-05-15 00:30:01] [INFO ] Dead Transitions using invariants and state equation in 1123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1663/1687 places, 2935/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 1663/1687 places, 2935/2981 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s29 1) (EQ s1283 1)), p0:(NEQ s1273 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 901 ms.
Product exploration explored 100000 steps with 50000 reset in 886 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Detected a total of 259/1663 stabilizing places and 259/2935 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DLCround-PT-07b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-07b-LTLFireability-12 finished in 5244 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X((p0 U !(p1 U p2)))))))'
Support contains 4 out of 1687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1675 transition count 2948
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1675 transition count 2948
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1669 transition count 2942
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1669 transition count 2942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1669 transition count 2941
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1667 transition count 2939
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1667 transition count 2939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1666 transition count 2938
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1666 transition count 2938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1665 transition count 2937
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1665 transition count 2937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1664 transition count 2936
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1664 transition count 2936
Applied a total of 47 rules in 349 ms. Remains 1664 /1687 variables (removed 23) and now considering 2936/2981 (removed 45) transitions.
// Phase 1: matrix 2936 rows 1664 cols
[2022-05-15 00:30:03] [INFO ] Computed 132 place invariants in 13 ms
[2022-05-15 00:30:04] [INFO ] Implicit Places using invariants in 411 ms returned []
// Phase 1: matrix 2936 rows 1664 cols
[2022-05-15 00:30:04] [INFO ] Computed 132 place invariants in 5 ms
[2022-05-15 00:30:05] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1730 ms to find 0 implicit places.
// Phase 1: matrix 2936 rows 1664 cols
[2022-05-15 00:30:05] [INFO ] Computed 132 place invariants in 9 ms
[2022-05-15 00:30:06] [INFO ] Dead Transitions using invariants and state equation in 1130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1664/1687 places, 2936/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 1664/1687 places, 2936/2981 transitions.
Stuttering acceptance computed with spot in 648 ms :[p2, p2, p2, true, p2, p2]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s402 1), p0:(AND (EQ s637 1) (EQ s1542 1)), p1:(NEQ s633 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-14 finished in 3892 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||X(p1)||X(p2)))'
Support contains 4 out of 1687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1675 transition count 2949
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1675 transition count 2949
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1670 transition count 2944
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1670 transition count 2944
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1668 transition count 2942
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1668 transition count 2942
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1667 transition count 2941
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1667 transition count 2941
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1666 transition count 2940
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1666 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1665 transition count 2939
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1665 transition count 2939
Applied a total of 44 rules in 356 ms. Remains 1665 /1687 variables (removed 22) and now considering 2939/2981 (removed 42) transitions.
// Phase 1: matrix 2939 rows 1665 cols
[2022-05-15 00:30:07] [INFO ] Computed 132 place invariants in 11 ms
[2022-05-15 00:30:08] [INFO ] Implicit Places using invariants in 408 ms returned []
// Phase 1: matrix 2939 rows 1665 cols
[2022-05-15 00:30:08] [INFO ] Computed 132 place invariants in 6 ms
[2022-05-15 00:30:09] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1640 ms to find 0 implicit places.
// Phase 1: matrix 2939 rows 1665 cols
[2022-05-15 00:30:09] [INFO ] Computed 132 place invariants in 9 ms
[2022-05-15 00:30:10] [INFO ] Dead Transitions using invariants and state equation in 1127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1665/1687 places, 2939/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 1665/1687 places, 2939/2981 transitions.
Stuttering acceptance computed with spot in 1228 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s98 0), p2:(EQ s341 0), p0:(OR (EQ s36 0) (EQ s1093 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 839 ms.
Product exploration explored 100000 steps with 50000 reset in 872 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DLCround-PT-07b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-07b-LTLFireability-15 finished in 6386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U F(X(X(F((p1||(G(p2)&&X(p0)))))))))'
Found a CL insensitive property : DLCround-PT-07b-LTLFireability-03
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1687 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1687/1687 places, 2981/2981 transitions.
Graph (trivial) has 1509 edges and 1687 vertex of which 430 / 1687 are part of one of the 35 SCC in 1 ms
Free SCC test removed 395 places
Ensure Unique test removed 428 transitions
Reduce isomorphic transitions removed 428 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 270 rules applied. Total rules applied 271 place count 1291 transition count 2282
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 308 rules applied. Total rules applied 579 place count 1021 transition count 2244
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 604 place count 996 transition count 2244
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 604 place count 996 transition count 2113
Deduced a syphon composed of 131 places in 6 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 866 place count 865 transition count 2113
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 930 place count 801 transition count 1701
Iterating global reduction 3 with 64 rules applied. Total rules applied 994 place count 801 transition count 1701
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 998 place count 801 transition count 1697
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 998 place count 801 transition count 1691
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1010 place count 795 transition count 1691
Performed 298 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 4 with 596 rules applied. Total rules applied 1606 place count 497 transition count 1385
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1614 place count 497 transition count 1377
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1635 place count 476 transition count 1158
Iterating global reduction 5 with 21 rules applied. Total rules applied 1656 place count 476 transition count 1158
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1675 place count 476 transition count 1139
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -102
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1701 place count 463 transition count 1241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1705 place count 463 transition count 1237
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1709 place count 459 transition count 1167
Iterating global reduction 7 with 4 rules applied. Total rules applied 1713 place count 459 transition count 1167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1717 place count 459 transition count 1163
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1725 place count 455 transition count 1188
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1729 place count 455 transition count 1184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1730 place count 454 transition count 1183
Applied a total of 1730 rules in 160 ms. Remains 454 /1687 variables (removed 1233) and now considering 1183/2981 (removed 1798) transitions.
[2022-05-15 00:30:14] [INFO ] Flow matrix only has 1144 transitions (discarded 39 similar events)
// Phase 1: matrix 1144 rows 454 cols
[2022-05-15 00:30:14] [INFO ] Computed 132 place invariants in 2 ms
[2022-05-15 00:30:14] [INFO ] Implicit Places using invariants in 189 ms returned []
[2022-05-15 00:30:14] [INFO ] Flow matrix only has 1144 transitions (discarded 39 similar events)
// Phase 1: matrix 1144 rows 454 cols
[2022-05-15 00:30:14] [INFO ] Computed 132 place invariants in 1 ms
[2022-05-15 00:30:14] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-15 00:30:14] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2022-05-15 00:30:14] [INFO ] Flow matrix only has 1144 transitions (discarded 39 similar events)
// Phase 1: matrix 1144 rows 454 cols
[2022-05-15 00:30:14] [INFO ] Computed 132 place invariants in 1 ms
[2022-05-15 00:30:15] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 454/1687 places, 1183/2981 transitions.
Finished structural reductions, in 1 iterations. Remains : 454/1687 places, 1183/2981 transitions.
Running random walk in product with property : DLCround-PT-07b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s30 1) (EQ s288 1)), p2:(EQ s92 1), p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property DLCround-PT-07b-LTLFireability-03 finished in 1517 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-15 00:30:15] [INFO ] Flatten gal took : 67 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17685012269806001032
[2022-05-15 00:30:15] [INFO ] Too many transitions (2981) to apply POR reductions. Disabling POR matrices.
[2022-05-15 00:30:15] [INFO ] Applying decomposition
[2022-05-15 00:30:15] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17685012269806001032
Running compilation step : cd /tmp/ltsmin17685012269806001032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-15 00:30:15] [INFO ] Flatten gal took : 69 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/graph2078235175497942345.txt' '-o' '/tmp/graph2078235175497942345.bin' '-w' '/tmp/graph2078235175497942345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2078235175497942345.bin' '-l' '-1' '-v' '-w' '/tmp/graph2078235175497942345.weights' '-q' '0' '-e' '0.001'
[2022-05-15 00:30:15] [INFO ] Decomposing Gal with order
[2022-05-15 00:30:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 00:30:15] [INFO ] Removed a total of 2716 redundant transitions.
[2022-05-15 00:30:16] [INFO ] Flatten gal took : 151 ms
[2022-05-15 00:30:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 32 ms.
[2022-05-15 00:30:16] [INFO ] Time to serialize gal into /tmp/LTLFireability3084654188300242861.gal : 15 ms
[2022-05-15 00:30:16] [INFO ] Time to serialize properties into /tmp/LTLFireability10800133010871120985.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/LTLFireability3084654188300242861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10800133010871120985.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/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((X(G("(i2.i0.i3.u69.p320==1)")))U(F(X(X(F(("((i6.u116.p521==1)&&(i6.u515.p2149==1))")||((G("(i19.u332.p1315==1)"))&&(X("(i2.i0.i3.u...177
Formula 0 simplified : !(XG"(i2.i0.i3.u69.p320==1)" U FXXF("((i6.u116.p521==1)&&(i6.u515.p2149==1))" | (G"(i19.u332.p1315==1)" & X"(i2.i0.i3.u69.p320==1)")...157
Compilation finished in 8038 ms.
Running link step : cd /tmp/ltsmin17685012269806001032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin17685012269806001032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([]((LTLAPp0==true))) U <>(X(X(<>(((LTLAPp1==true)||([]((LTLAPp2==true))&&X((LTLAPp0==true)))))))))' '--buchi-type=spotba'
LTSmin run took 524 ms.
FORMULA DLCround-PT-07b-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 228474 ms.

BK_STOP 1652574624280

--------------------
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="DLCround-PT-07b"
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 DLCround-PT-07b, 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 r060-tall-165254771700188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-07b.tgz
mv DLCround-PT-07b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;