Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592700139.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-09a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592700139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 839K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678501607873

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 02:26:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 02:26:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:26:50] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-11 02:26:50] [INFO ] Transformed 1991 places.
[2023-03-11 02:26:50] [INFO ] Transformed 2919 transitions.
[2023-03-11 02:26:50] [INFO ] Found NUPN structural information;
[2023-03-11 02:26:50] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
FORMULA ASLink-PT-09a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 1991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 36 places
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 1937 transition count 2888
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 1924 transition count 2827
Ensure Unique test removed 1 places
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 1923 transition count 2827
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 1923 transition count 2825
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1922 transition count 2817
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1922 transition count 2817
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1921 transition count 2809
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1921 transition count 2809
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1920 transition count 2801
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1920 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 1919 transition count 2793
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 1919 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 1918 transition count 2785
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 1918 transition count 2785
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 1917 transition count 2777
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 1917 transition count 2777
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 1916 transition count 2769
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 1916 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1915 transition count 2761
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1915 transition count 2761
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1914 transition count 2753
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1914 transition count 2753
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1913 transition count 2745
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1913 transition count 2745
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1912 transition count 2737
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1912 transition count 2737
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1911 transition count 2729
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1911 transition count 2729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 1910 transition count 2721
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1910 transition count 2721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 1909 transition count 2713
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1909 transition count 2713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 1908 transition count 2705
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1908 transition count 2705
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 1907 transition count 2697
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 1907 transition count 2697
Applied a total of 115 rules in 1776 ms. Remains 1907 /1991 variables (removed 84) and now considering 2697/2888 (removed 191) transitions.
// Phase 1: matrix 2697 rows 1907 cols
[2023-03-11 02:26:52] [INFO ] Computed 329 place invariants in 157 ms
[2023-03-11 02:26:54] [INFO ] Implicit Places using invariants in 2378 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 240, 258, 387, 403, 408, 409, 410, 428, 446, 575, 591, 596, 597, 598, 616, 634, 763, 779, 784, 785, 786, 804, 822, 951, 967, 972, 973, 974, 992, 1010, 1139, 1155, 1160, 1161, 1162, 1180, 1198, 1327, 1343, 1348, 1349, 1350, 1368, 1386, 1515, 1531, 1536, 1537, 1538, 1556, 1574, 1703, 1708, 1720, 1725, 1726, 1727, 1745, 1747, 1750, 1768, 1769, 1770, 1771, 1788, 1796, 1804, 1810, 1816, 1822, 1828, 1836, 1842, 1848, 1856]
Discarding 86 places :
Implicit Place search using SMT only with invariants took 2411 ms to find 86 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1821/1991 places, 2697/2888 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1808 transition count 2684
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1808 transition count 2684
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1798 transition count 2674
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1798 transition count 2674
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1793 transition count 2669
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1793 transition count 2669
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1791 transition count 2667
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1791 transition count 2667
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1789 transition count 2665
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1789 transition count 2665
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1788 transition count 2664
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1788 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1787 transition count 2663
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1787 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1786 transition count 2662
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1786 transition count 2662
Applied a total of 70 rules in 885 ms. Remains 1786 /1821 variables (removed 35) and now considering 2662/2697 (removed 35) transitions.
// Phase 1: matrix 2662 rows 1786 cols
[2023-03-11 02:26:55] [INFO ] Computed 243 place invariants in 94 ms
[2023-03-11 02:26:58] [INFO ] Implicit Places using invariants in 2778 ms returned []
[2023-03-11 02:26:58] [INFO ] Invariant cache hit.
[2023-03-11 02:27:00] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 4615 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1786/1991 places, 2662/2888 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9689 ms. Remains : 1786/1991 places, 2662/2888 transitions.
Support contains 36 out of 1786 places after structural reductions.
[2023-03-11 02:27:00] [INFO ] Flatten gal took : 225 ms
[2023-03-11 02:27:00] [INFO ] Flatten gal took : 130 ms
[2023-03-11 02:27:01] [INFO ] Input system was already deterministic with 2662 transitions.
Support contains 32 out of 1786 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-11 02:27:01] [INFO ] Invariant cache hit.
[2023-03-11 02:27:02] [INFO ] After 598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 02:27:03] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2023-03-11 02:27:03] [INFO ] [Nat]Absence check using 60 positive and 183 generalized place invariants in 103 ms returned sat
[2023-03-11 02:27:27] [INFO ] After 23256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-11 02:27:27] [INFO ] After 23657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-11 02:27:27] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 1 properties in 318 ms.
Support contains 16 out of 1786 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1786/1786 places, 2662/2662 transitions.
Drop transitions removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 1786 transition count 2324
Reduce places removed 338 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 339 rules applied. Total rules applied 677 place count 1448 transition count 2323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 678 place count 1447 transition count 2323
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 678 place count 1447 transition count 2085
Deduced a syphon composed of 238 places in 3 ms
Ensure Unique test removed 76 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 552 rules applied. Total rules applied 1230 place count 1133 transition count 2085
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 21 rules applied. Total rules applied 1251 place count 1121 transition count 2076
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1260 place count 1112 transition count 2076
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 34 Pre rules applied. Total rules applied 1260 place count 1112 transition count 2042
Deduced a syphon composed of 34 places in 4 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 1328 place count 1078 transition count 2042
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1333 place count 1073 transition count 2037
Iterating global reduction 5 with 5 rules applied. Total rules applied 1338 place count 1073 transition count 2037
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 1342 place count 1073 transition count 2033
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1343 place count 1072 transition count 2033
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1343 place count 1072 transition count 2032
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1345 place count 1071 transition count 2032
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 7 with 178 rules applied. Total rules applied 1523 place count 982 transition count 1943
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1532 place count 982 transition count 1934
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1541 place count 973 transition count 1934
Free-agglomeration rule (complex) applied 41 times.
Iterating global reduction 8 with 41 rules applied. Total rules applied 1582 place count 973 transition count 1893
Ensure Unique test removed 1 places
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 8 with 42 rules applied. Total rules applied 1624 place count 931 transition count 1893
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1631 place count 931 transition count 1886
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 1657 place count 931 transition count 1886
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1658 place count 931 transition count 1886
Applied a total of 1658 rules in 633 ms. Remains 931 /1786 variables (removed 855) and now considering 1886/2662 (removed 776) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 633 ms. Remains : 931/1786 places, 1886/2662 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 212576 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{0=1, 4=1, 5=1, 7=1, 8=1}
Probabilistic random walk after 212576 steps, saw 75762 distinct states, run finished after 3003 ms. (steps per millisecond=70 ) properties seen :5
Running SMT prover for 4 properties.
// Phase 1: matrix 1886 rows 931 cols
[2023-03-11 02:27:32] [INFO ] Computed 154 place invariants in 41 ms
[2023-03-11 02:27:32] [INFO ] [Real]Absence check using 29 positive place invariants in 8 ms returned sat
[2023-03-11 02:27:32] [INFO ] [Real]Absence check using 29 positive and 125 generalized place invariants in 45 ms returned sat
[2023-03-11 02:27:32] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 02:27:32] [INFO ] [Nat]Absence check using 29 positive place invariants in 9 ms returned sat
[2023-03-11 02:27:32] [INFO ] [Nat]Absence check using 29 positive and 125 generalized place invariants in 77 ms returned sat
[2023-03-11 02:27:39] [INFO ] After 6420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 02:27:39] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-11 02:27:42] [INFO ] After 2795ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 02:27:43] [INFO ] After 3750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7534 ms.
[2023-03-11 02:27:50] [INFO ] After 18080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 178 ms.
Support contains 5 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 1886/1886 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 931 transition count 1885
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 930 transition count 1885
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 930 transition count 1884
Deduced a syphon composed of 1 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 928 transition count 1884
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 928 transition count 1883
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 927 transition count 1883
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 926 transition count 1877
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 926 transition count 1877
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 925 transition count 1877
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 20 place count 920 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 919 transition count 1871
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 919 transition count 1871
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 919 transition count 1870
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 919 transition count 1869
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 918 transition count 1869
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 918 transition count 1868
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 27 place count 917 transition count 1868
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 29 place count 917 transition count 1868
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 30 place count 916 transition count 1867
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 39 place count 907 transition count 1867
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 18 Pre rules applied. Total rules applied 39 place count 907 transition count 1849
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 9 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 45 rules applied. Total rules applied 84 place count 880 transition count 1849
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 93 place count 871 transition count 1840
Iterating global reduction 6 with 9 rules applied. Total rules applied 102 place count 871 transition count 1840
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 111 place count 871 transition count 1831
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 113 place count 870 transition count 1830
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 114 place count 870 transition count 1829
Applied a total of 114 rules in 548 ms. Remains 870 /931 variables (removed 61) and now considering 1829/1886 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 870/931 places, 1829/1886 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 258472 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 258472 steps, saw 83303 distinct states, run finished after 3004 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1829 rows 870 cols
[2023-03-11 02:27:54] [INFO ] Computed 134 place invariants in 42 ms
[2023-03-11 02:27:55] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2023-03-11 02:27:55] [INFO ] [Real]Absence check using 24 positive and 110 generalized place invariants in 49 ms returned sat
[2023-03-11 02:27:55] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:27:55] [INFO ] [Nat]Absence check using 24 positive place invariants in 40 ms returned sat
[2023-03-11 02:27:55] [INFO ] [Nat]Absence check using 24 positive and 110 generalized place invariants in 24 ms returned sat
[2023-03-11 02:27:56] [INFO ] After 924ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:27:56] [INFO ] After 1363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-11 02:27:56] [INFO ] After 1879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 56 ms.
Support contains 5 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 1829/1829 transitions.
Applied a total of 0 rules in 26 ms. Remains 870 /870 variables (removed 0) and now considering 1829/1829 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 870/870 places, 1829/1829 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 1829/1829 transitions.
Applied a total of 0 rules in 28 ms. Remains 870 /870 variables (removed 0) and now considering 1829/1829 (removed 0) transitions.
[2023-03-11 02:27:57] [INFO ] Invariant cache hit.
[2023-03-11 02:27:57] [INFO ] Implicit Places using invariants in 720 ms returned [71, 89, 95, 97, 100, 101, 106, 107, 108, 161, 182, 188, 191, 193, 194, 199, 200, 252, 269, 275, 278, 281, 282, 287, 288, 340, 357, 363, 366, 368, 369, 374, 375, 427, 444, 451, 454, 456, 457, 462, 463, 515, 532, 538, 541, 543, 544, 549, 550, 602, 620, 626, 629, 631, 632, 637, 638, 690, 708, 714, 717, 719, 720, 725, 726, 778, 795, 801, 804, 806, 807]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 738 ms to find 71 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 799/870 places, 1829/1829 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 799 transition count 1824
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 794 transition count 1824
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 36 place count 768 transition count 1798
Iterating global reduction 2 with 26 rules applied. Total rules applied 62 place count 768 transition count 1798
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 760 transition count 1790
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 760 transition count 1790
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 116 place count 741 transition count 1771
Free-agglomeration rule applied 26 times.
Iterating global reduction 2 with 26 rules applied. Total rules applied 142 place count 741 transition count 1745
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 168 place count 715 transition count 1745
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 177 place count 715 transition count 1736
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 186 place count 706 transition count 1736
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 187 place count 706 transition count 1736
Applied a total of 187 rules in 317 ms. Remains 706 /799 variables (removed 93) and now considering 1736/1829 (removed 93) transitions.
// Phase 1: matrix 1736 rows 706 cols
[2023-03-11 02:27:58] [INFO ] Computed 63 place invariants in 17 ms
[2023-03-11 02:27:58] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-11 02:27:58] [INFO ] Invariant cache hit.
[2023-03-11 02:28:00] [INFO ] Implicit Places using invariants and state equation in 1804 ms returned []
Implicit Place search using SMT with State Equation took 2493 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 706/870 places, 1736/1829 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3576 ms. Remains : 706/870 places, 1736/1829 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 205832 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205832 steps, saw 110131 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 02:28:03] [INFO ] Invariant cache hit.
[2023-03-11 02:28:03] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 02:28:03] [INFO ] [Real]Absence check using 14 positive and 49 generalized place invariants in 15 ms returned sat
[2023-03-11 02:28:03] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:28:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-11 02:28:04] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 25 ms returned sat
[2023-03-11 02:28:05] [INFO ] After 855ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:28:05] [INFO ] After 1123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-11 02:28:05] [INFO ] After 1489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 59 ms.
Support contains 3 out of 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 1736/1736 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 706 transition count 1735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 705 transition count 1735
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 705 transition count 1734
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 704 transition count 1734
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 703 transition count 1733
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 703 transition count 1733
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 702 transition count 1732
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 702 transition count 1732
Applied a total of 8 rules in 57 ms. Remains 702 /706 variables (removed 4) and now considering 1732/1736 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 702/706 places, 1732/1736 transitions.
Incomplete random walk after 10000 steps, including 164 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 220836 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220836 steps, saw 123885 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1732 rows 702 cols
[2023-03-11 02:28:08] [INFO ] Computed 63 place invariants in 12 ms
[2023-03-11 02:28:08] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 02:28:08] [INFO ] [Real]Absence check using 14 positive and 49 generalized place invariants in 20 ms returned sat
[2023-03-11 02:28:09] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:28:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 29 ms returned sat
[2023-03-11 02:28:09] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 74 ms returned sat
[2023-03-11 02:28:10] [INFO ] After 1030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:28:10] [INFO ] After 1307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-11 02:28:11] [INFO ] After 1614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1732/1732 transitions.
Applied a total of 0 rules in 21 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 702/702 places, 1732/1732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1732/1732 transitions.
Applied a total of 0 rules in 20 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2023-03-11 02:28:11] [INFO ] Invariant cache hit.
[2023-03-11 02:28:11] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-11 02:28:11] [INFO ] Invariant cache hit.
[2023-03-11 02:28:13] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
[2023-03-11 02:28:13] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-11 02:28:13] [INFO ] Invariant cache hit.
[2023-03-11 02:28:13] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2862 ms. Remains : 702/702 places, 1732/1732 transitions.
Applied a total of 0 rules in 21 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-11 02:28:14] [INFO ] Invariant cache hit.
[2023-03-11 02:28:14] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-11 02:28:14] [INFO ] [Real]Absence check using 14 positive and 49 generalized place invariants in 46 ms returned sat
[2023-03-11 02:28:14] [INFO ] After 593ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:28:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 02:28:14] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 25 ms returned sat
[2023-03-11 02:28:15] [INFO ] After 768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:28:15] [INFO ] After 984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-11 02:28:15] [INFO ] After 1371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ASLink-PT-09a-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ASLink-PT-09a-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p1)&&G(p2))))'
Support contains 5 out of 1786 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1786/1786 places, 2662/2662 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1785 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1785 transition count 2656
Applied a total of 2 rules in 97 ms. Remains 1785 /1786 variables (removed 1) and now considering 2656/2662 (removed 6) transitions.
// Phase 1: matrix 2656 rows 1785 cols
[2023-03-11 02:28:16] [INFO ] Computed 243 place invariants in 49 ms
[2023-03-11 02:28:17] [INFO ] Implicit Places using invariants in 856 ms returned [210]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 859 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1784/1786 places, 2656/2662 transitions.
Applied a total of 0 rules in 56 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1012 ms. Remains : 1784/1786 places, 2656/2662 transitions.
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(OR (EQ s95 0) (EQ s519 1)), p0:(OR (EQ s978 0) (EQ s824 1)), p1:(EQ s1178 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1901 ms.
Product exploration explored 100000 steps with 50000 reset in 1844 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 11 factoid took 197 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-09a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-09a-LTLCardinality-01 finished in 5344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1786 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1786/1786 places, 2662/2662 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 1785 transition count 2313
Reduce places removed 357 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 365 rules applied. Total rules applied 713 place count 1428 transition count 2305
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 721 place count 1420 transition count 2305
Performed 260 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 260 Pre rules applied. Total rules applied 721 place count 1420 transition count 2045
Deduced a syphon composed of 260 places in 3 ms
Ensure Unique test removed 77 places
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 597 rules applied. Total rules applied 1318 place count 1083 transition count 2045
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 49 rules applied. Total rules applied 1367 place count 1061 transition count 2018
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 1394 place count 1034 transition count 2018
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 1394 place count 1034 transition count 1981
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1468 place count 997 transition count 1981
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1483 place count 982 transition count 1961
Iterating global reduction 5 with 15 rules applied. Total rules applied 1498 place count 982 transition count 1961
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 14 rules applied. Total rules applied 1512 place count 981 transition count 1948
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1513 place count 980 transition count 1948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1513 place count 980 transition count 1947
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1515 place count 979 transition count 1947
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 3 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 7 with 170 rules applied. Total rules applied 1685 place count 894 transition count 1862
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1686 place count 893 transition count 1861
Iterating global reduction 7 with 1 rules applied. Total rules applied 1687 place count 893 transition count 1861
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1688 place count 893 transition count 1861
Applied a total of 1688 rules in 297 ms. Remains 893 /1786 variables (removed 893) and now considering 1861/2662 (removed 801) transitions.
// Phase 1: matrix 1861 rows 893 cols
[2023-03-11 02:28:21] [INFO ] Computed 134 place invariants in 12 ms
[2023-03-11 02:28:22] [INFO ] Implicit Places using invariants in 533 ms returned [72, 89, 95, 102, 110, 163, 184, 190, 195, 197, 257, 274, 280, 285, 287, 347, 364, 370, 375, 377, 437, 454, 460, 465, 467, 527, 544, 550, 555, 557, 617, 634, 640, 645, 647, 707, 724, 730, 735, 737, 797, 814, 820, 825, 827, 890]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 535 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 847/1786 places, 1861/2662 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 847 transition count 1856
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 842 transition count 1856
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 28 place count 824 transition count 1838
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 824 transition count 1838
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 64 place count 806 transition count 1820
Iterating global reduction 2 with 18 rules applied. Total rules applied 82 place count 806 transition count 1820
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 91 place count 797 transition count 1811
Iterating global reduction 2 with 9 rules applied. Total rules applied 100 place count 797 transition count 1811
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 138 place count 778 transition count 1792
Applied a total of 138 rules in 101 ms. Remains 778 /847 variables (removed 69) and now considering 1792/1861 (removed 69) transitions.
// Phase 1: matrix 1792 rows 778 cols
[2023-03-11 02:28:22] [INFO ] Computed 88 place invariants in 12 ms
[2023-03-11 02:28:22] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-11 02:28:22] [INFO ] Invariant cache hit.
[2023-03-11 02:28:24] [INFO ] Implicit Places using invariants and state equation in 1956 ms returned []
Implicit Place search using SMT with State Equation took 2380 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 778/1786 places, 1792/2662 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3314 ms. Remains : 778/1786 places, 1792/2662 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s89 0) (EQ s526 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1291 reset in 343 ms.
Product exploration explored 100000 steps with 1232 reset in 365 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 318892 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318892 steps, saw 198783 distinct states, run finished after 3006 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:28:28] [INFO ] Invariant cache hit.
[2023-03-11 02:28:29] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:28:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 02:28:29] [INFO ] [Nat]Absence check using 14 positive and 74 generalized place invariants in 23 ms returned sat
[2023-03-11 02:28:29] [INFO ] After 580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:28:29] [INFO ] After 720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8112 ms.
[2023-03-11 02:28:38] [INFO ] After 8987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 1792/1792 transitions.
Free-agglomeration rule applied 36 times.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 778 transition count 1756
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 81 place count 742 transition count 1747
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 107 place count 742 transition count 1721
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 133 place count 716 transition count 1721
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 716 transition count 1721
Applied a total of 134 rules in 89 ms. Remains 716 /778 variables (removed 62) and now considering 1721/1792 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 716/778 places, 1721/1792 transitions.
Incomplete random walk after 10000 steps, including 172 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 277980 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 277980 steps, saw 137736 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1721 rows 716 cols
[2023-03-11 02:28:41] [INFO ] Computed 88 place invariants in 14 ms
[2023-03-11 02:28:41] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:28:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 02:28:41] [INFO ] [Nat]Absence check using 14 positive and 74 generalized place invariants in 95 ms returned sat
[2023-03-11 02:28:46] [INFO ] After 5010ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:28:52] [INFO ] After 10726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 871 ms.
[2023-03-11 02:28:53] [INFO ] After 11818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 1721/1721 transitions.
Applied a total of 0 rules in 46 ms. Remains 716 /716 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 716/716 places, 1721/1721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 1721/1721 transitions.
Applied a total of 0 rules in 27 ms. Remains 716 /716 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
[2023-03-11 02:28:53] [INFO ] Invariant cache hit.
[2023-03-11 02:28:53] [INFO ] Implicit Places using invariants in 492 ms returned [90, 91, 161, 162, 232, 233, 303, 304, 374, 375, 445, 446, 516, 517, 587, 588]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 493 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 700/716 places, 1721/1721 transitions.
Applied a total of 0 rules in 38 ms. Remains 700 /700 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 558 ms. Remains : 700/716 places, 1721/1721 transitions.
Incomplete random walk after 10000 steps, including 171 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 294110 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294110 steps, saw 144322 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1721 rows 700 cols
[2023-03-11 02:28:56] [INFO ] Computed 72 place invariants in 34 ms
[2023-03-11 02:28:57] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:28:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 02:28:57] [INFO ] [Nat]Absence check using 14 positive and 58 generalized place invariants in 23 ms returned sat
[2023-03-11 02:28:58] [INFO ] After 1357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:29:03] [INFO ] After 6240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1502 ms.
[2023-03-11 02:29:04] [INFO ] After 7888ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1721/1721 transitions.
Applied a total of 0 rules in 69 ms. Remains 700 /700 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 700/700 places, 1721/1721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1721/1721 transitions.
Applied a total of 0 rules in 34 ms. Remains 700 /700 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
[2023-03-11 02:29:05] [INFO ] Invariant cache hit.
[2023-03-11 02:29:05] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-11 02:29:05] [INFO ] Invariant cache hit.
[2023-03-11 02:29:07] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2023-03-11 02:29:07] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-11 02:29:07] [INFO ] Invariant cache hit.
[2023-03-11 02:29:07] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2883 ms. Remains : 700/700 places, 1721/1721 transitions.
Applied a total of 0 rules in 27 ms. Remains 700 /700 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-11 02:29:07] [INFO ] Invariant cache hit.
[2023-03-11 02:29:08] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:29:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-11 02:29:08] [INFO ] [Nat]Absence check using 14 positive and 58 generalized place invariants in 58 ms returned sat
[2023-03-11 02:29:12] [INFO ] After 4176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:29:13] [INFO ] After 4758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1464 ms.
[2023-03-11 02:29:14] [INFO ] After 6468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 778 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 778/778 places, 1792/1792 transitions.
Applied a total of 0 rules in 29 ms. Remains 778 /778 variables (removed 0) and now considering 1792/1792 (removed 0) transitions.
// Phase 1: matrix 1792 rows 778 cols
[2023-03-11 02:29:14] [INFO ] Computed 88 place invariants in 39 ms
[2023-03-11 02:29:15] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-11 02:29:15] [INFO ] Invariant cache hit.
[2023-03-11 02:29:17] [INFO ] Implicit Places using invariants and state equation in 2075 ms returned []
Implicit Place search using SMT with State Equation took 2650 ms to find 0 implicit places.
[2023-03-11 02:29:17] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-11 02:29:17] [INFO ] Invariant cache hit.
[2023-03-11 02:29:18] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3618 ms. Remains : 778/778 places, 1792/1792 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 1248 steps, including 17 resets, run visited all 1 properties in 9 ms. (steps per millisecond=138 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1245 reset in 267 ms.
Product exploration explored 100000 steps with 1241 reset in 332 ms.
Built C files in :
/tmp/ltsmin7418098913795935482
[2023-03-11 02:29:19] [INFO ] Too many transitions (1792) to apply POR reductions. Disabling POR matrices.
[2023-03-11 02:29:19] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7418098913795935482
Running compilation step : cd /tmp/ltsmin7418098913795935482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7418098913795935482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7418098913795935482;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 778 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 778/778 places, 1792/1792 transitions.
Applied a total of 0 rules in 22 ms. Remains 778 /778 variables (removed 0) and now considering 1792/1792 (removed 0) transitions.
[2023-03-11 02:29:22] [INFO ] Invariant cache hit.
[2023-03-11 02:29:23] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-11 02:29:23] [INFO ] Invariant cache hit.
[2023-03-11 02:29:26] [INFO ] Implicit Places using invariants and state equation in 2971 ms returned []
Implicit Place search using SMT with State Equation took 3437 ms to find 0 implicit places.
[2023-03-11 02:29:26] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-11 02:29:26] [INFO ] Invariant cache hit.
[2023-03-11 02:29:26] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4218 ms. Remains : 778/778 places, 1792/1792 transitions.
Built C files in :
/tmp/ltsmin5243905915942122458
[2023-03-11 02:29:26] [INFO ] Too many transitions (1792) to apply POR reductions. Disabling POR matrices.
[2023-03-11 02:29:26] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5243905915942122458
Running compilation step : cd /tmp/ltsmin5243905915942122458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5243905915942122458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5243905915942122458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 02:29:30] [INFO ] Flatten gal took : 99 ms
[2023-03-11 02:29:30] [INFO ] Flatten gal took : 84 ms
[2023-03-11 02:29:30] [INFO ] Time to serialize gal into /tmp/LTL2515961007000131427.gal : 17 ms
[2023-03-11 02:29:30] [INFO ] Time to serialize properties into /tmp/LTL16587733135879597664.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2515961007000131427.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14026977270801587021.hoa' '-atoms' '/tmp/LTL16587733135879597664.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16587733135879597664.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14026977270801587021.hoa
Detected timeout of ITS tools.
[2023-03-11 02:29:45] [INFO ] Flatten gal took : 66 ms
[2023-03-11 02:29:45] [INFO ] Flatten gal took : 65 ms
[2023-03-11 02:29:45] [INFO ] Time to serialize gal into /tmp/LTL13814962582443051123.gal : 10 ms
[2023-03-11 02:29:45] [INFO ] Time to serialize properties into /tmp/LTL10449386021384156389.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13814962582443051123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10449386021384156389.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((p174==0)||(p1246==1))"))))
Formula 0 simplified : GF!"((p174==0)||(p1246==1))"
Detected timeout of ITS tools.
[2023-03-11 02:30:00] [INFO ] Flatten gal took : 97 ms
[2023-03-11 02:30:00] [INFO ] Applying decomposition
[2023-03-11 02:30:01] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2256017025271530916.txt' '-o' '/tmp/graph2256017025271530916.bin' '-w' '/tmp/graph2256017025271530916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2256017025271530916.bin' '-l' '-1' '-v' '-w' '/tmp/graph2256017025271530916.weights' '-q' '0' '-e' '0.001'
[2023-03-11 02:30:01] [INFO ] Decomposing Gal with order
[2023-03-11 02:30:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:30:01] [INFO ] Removed a total of 3526 redundant transitions.
[2023-03-11 02:30:01] [INFO ] Flatten gal took : 428 ms
[2023-03-11 02:30:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 51 ms.
[2023-03-11 02:30:02] [INFO ] Time to serialize gal into /tmp/LTL7512547116700096827.gal : 31 ms
[2023-03-11 02:30:02] [INFO ] Time to serialize properties into /tmp/LTL14394963027424867301.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7512547116700096827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14394963027424867301.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i2.u27.p174==0)||(i12.u125.p1246==1))"))))
Formula 0 simplified : GF!"((i2.u27.p174==0)||(i12.u125.p1246==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18035562630314997414
[2023-03-11 02:30:17] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18035562630314997414
Running compilation step : cd /tmp/ltsmin18035562630314997414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18035562630314997414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18035562630314997414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-09a-LTLCardinality-04 finished in 118582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))||X((G(p0)&&X(p2)))))'
Support contains 5 out of 1786 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1786/1786 places, 2662/2662 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1785 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1785 transition count 2656
Applied a total of 2 rules in 152 ms. Remains 1785 /1786 variables (removed 1) and now considering 2656/2662 (removed 6) transitions.
// Phase 1: matrix 2656 rows 1785 cols
[2023-03-11 02:30:20] [INFO ] Computed 243 place invariants in 48 ms
[2023-03-11 02:30:21] [INFO ] Implicit Places using invariants in 1175 ms returned [210]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1784/1786 places, 2656/2662 transitions.
Applied a total of 0 rules in 65 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1410 ms. Remains : 1784/1786 places, 2656/2662 transitions.
Stuttering acceptance computed with spot in 488 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(EQ s1196 1), p1:(OR (EQ s1446 0) (EQ s606 1)), p2:(OR (EQ s980 0) (EQ s1094 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1318 ms.
Product exploration explored 100000 steps with 50000 reset in 1359 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 9 factoid took 162 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-09a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-09a-LTLCardinality-05 finished in 4797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1786 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1786/1786 places, 2662/2662 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1785 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1785 transition count 2656
Applied a total of 2 rules in 154 ms. Remains 1785 /1786 variables (removed 1) and now considering 2656/2662 (removed 6) transitions.
[2023-03-11 02:30:25] [INFO ] Invariant cache hit.
[2023-03-11 02:30:26] [INFO ] Implicit Places using invariants in 1043 ms returned [210]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1048 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1784/1786 places, 2656/2662 transitions.
Applied a total of 0 rules in 54 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1257 ms. Remains : 1784/1786 places, 2656/2662 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s1347 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 458 reset in 472 ms.
Product exploration explored 100000 steps with 453 reset in 434 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 42 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249608 steps, run timeout after 3013 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 249608 steps, saw 94051 distinct states, run finished after 3013 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2656 rows 1784 cols
[2023-03-11 02:30:30] [INFO ] Computed 242 place invariants in 20 ms
[2023-03-11 02:30:30] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:30:31] [INFO ] [Nat]Absence check using 56 positive place invariants in 73 ms returned sat
[2023-03-11 02:30:31] [INFO ] [Nat]Absence check using 56 positive and 186 generalized place invariants in 104 ms returned sat
[2023-03-11 02:30:32] [INFO ] After 1636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:30:33] [INFO ] Deduced a trap composed of 60 places in 288 ms of which 1 ms to minimize.
[2023-03-11 02:30:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-11 02:30:33] [INFO ] After 2144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-11 02:30:33] [INFO ] After 2643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 1784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1784/1784 places, 2656/2656 transitions.
Drop transitions removed 354 transitions
Trivial Post-agglo rules discarded 354 transitions
Performed 354 trivial Post agglomeration. Transition count delta: 354
Iterating post reduction 0 with 354 rules applied. Total rules applied 354 place count 1784 transition count 2302
Reduce places removed 354 places and 0 transitions.
Iterating post reduction 1 with 354 rules applied. Total rules applied 708 place count 1430 transition count 2302
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 240 Pre rules applied. Total rules applied 708 place count 1430 transition count 2062
Deduced a syphon composed of 240 places in 3 ms
Ensure Unique test removed 77 places
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 557 rules applied. Total rules applied 1265 place count 1113 transition count 2062
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 22 rules applied. Total rules applied 1287 place count 1100 transition count 2053
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1296 place count 1091 transition count 2053
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 1296 place count 1091 transition count 2017
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1368 place count 1055 transition count 2017
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1373 place count 1050 transition count 2012
Iterating global reduction 4 with 5 rules applied. Total rules applied 1378 place count 1050 transition count 2012
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 1382 place count 1050 transition count 2008
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1383 place count 1049 transition count 2008
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1383 place count 1049 transition count 2007
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1385 place count 1048 transition count 2007
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 6 with 190 rules applied. Total rules applied 1575 place count 953 transition count 1912
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 1584 place count 953 transition count 1903
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1593 place count 944 transition count 1903
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1629 place count 944 transition count 1867
Ensure Unique test removed 1 places
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 7 with 37 rules applied. Total rules applied 1666 place count 907 transition count 1867
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1674 place count 907 transition count 1859
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 1702 place count 907 transition count 1859
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1703 place count 906 transition count 1858
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1712 place count 897 transition count 1858
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 1712 place count 897 transition count 1840
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 9 with 45 rules applied. Total rules applied 1757 place count 870 transition count 1840
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1766 place count 861 transition count 1831
Iterating global reduction 9 with 9 rules applied. Total rules applied 1775 place count 861 transition count 1831
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1784 place count 861 transition count 1822
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1785 place count 861 transition count 1821
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1786 place count 860 transition count 1821
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1787 place count 860 transition count 1820
Applied a total of 1787 rules in 510 ms. Remains 860 /1784 variables (removed 924) and now considering 1820/2656 (removed 836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 860/1784 places, 1820/2656 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1354 steps, run visited all 1 properties in 8 ms. (steps per millisecond=169 )
Probabilistic random walk after 1354 steps, saw 1319 distinct states, run finished after 8 ms. (steps per millisecond=169 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1784 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1784/1784 places, 2656/2656 transitions.
Applied a total of 0 rules in 95 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
[2023-03-11 02:30:34] [INFO ] Invariant cache hit.
[2023-03-11 02:30:35] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2023-03-11 02:30:35] [INFO ] Invariant cache hit.
[2023-03-11 02:30:38] [INFO ] Implicit Places using invariants and state equation in 3175 ms returned []
Implicit Place search using SMT with State Equation took 4220 ms to find 0 implicit places.
[2023-03-11 02:30:39] [INFO ] Invariant cache hit.
[2023-03-11 02:30:40] [INFO ] Dead Transitions using invariants and state equation in 1325 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5642 ms. Remains : 1784/1784 places, 2656/2656 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 240050 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 240050 steps, saw 91041 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:30:43] [INFO ] Invariant cache hit.
[2023-03-11 02:30:43] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:30:44] [INFO ] [Nat]Absence check using 56 positive place invariants in 47 ms returned sat
[2023-03-11 02:30:44] [INFO ] [Nat]Absence check using 56 positive and 186 generalized place invariants in 131 ms returned sat
[2023-03-11 02:30:46] [INFO ] After 2064ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:30:46] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 2 ms to minimize.
[2023-03-11 02:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2023-03-11 02:30:47] [INFO ] After 2606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-11 02:30:47] [INFO ] After 3225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1784/1784 places, 2656/2656 transitions.
Drop transitions removed 354 transitions
Trivial Post-agglo rules discarded 354 transitions
Performed 354 trivial Post agglomeration. Transition count delta: 354
Iterating post reduction 0 with 354 rules applied. Total rules applied 354 place count 1784 transition count 2302
Reduce places removed 354 places and 0 transitions.
Iterating post reduction 1 with 354 rules applied. Total rules applied 708 place count 1430 transition count 2302
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 240 Pre rules applied. Total rules applied 708 place count 1430 transition count 2062
Deduced a syphon composed of 240 places in 4 ms
Ensure Unique test removed 77 places
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 557 rules applied. Total rules applied 1265 place count 1113 transition count 2062
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 22 rules applied. Total rules applied 1287 place count 1100 transition count 2053
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1296 place count 1091 transition count 2053
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 1296 place count 1091 transition count 2017
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1368 place count 1055 transition count 2017
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1373 place count 1050 transition count 2012
Iterating global reduction 4 with 5 rules applied. Total rules applied 1378 place count 1050 transition count 2012
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 1382 place count 1050 transition count 2008
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1383 place count 1049 transition count 2008
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1383 place count 1049 transition count 2007
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1385 place count 1048 transition count 2007
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 6 with 190 rules applied. Total rules applied 1575 place count 953 transition count 1912
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 1584 place count 953 transition count 1903
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1593 place count 944 transition count 1903
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1629 place count 944 transition count 1867
Ensure Unique test removed 1 places
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 7 with 37 rules applied. Total rules applied 1666 place count 907 transition count 1867
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1674 place count 907 transition count 1859
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 1702 place count 907 transition count 1859
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1703 place count 906 transition count 1858
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1712 place count 897 transition count 1858
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 1712 place count 897 transition count 1840
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 9 with 45 rules applied. Total rules applied 1757 place count 870 transition count 1840
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1766 place count 861 transition count 1831
Iterating global reduction 9 with 9 rules applied. Total rules applied 1775 place count 861 transition count 1831
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1784 place count 861 transition count 1822
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1785 place count 861 transition count 1821
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1786 place count 860 transition count 1821
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1787 place count 860 transition count 1820
Applied a total of 1787 rules in 484 ms. Remains 860 /1784 variables (removed 924) and now considering 1820/2656 (removed 836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 860/1784 places, 1820/2656 transitions.
Incomplete random walk after 10000 steps, including 160 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1354 steps, run visited all 1 properties in 8 ms. (steps per millisecond=169 )
Probabilistic random walk after 1354 steps, saw 1319 distinct states, run finished after 9 ms. (steps per millisecond=150 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 453 reset in 367 ms.
Product exploration explored 100000 steps with 466 reset in 420 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1784 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1784/1784 places, 2656/2656 transitions.
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 353 rules applied. Total rules applied 353 place count 1784 transition count 2656
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 128 Pre rules applied. Total rules applied 353 place count 1784 transition count 2697
Deduced a syphon composed of 481 places in 6 ms
Iterating global reduction 1 with 128 rules applied. Total rules applied 481 place count 1784 transition count 2697
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 487 place count 1781 transition count 2697
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 534 place count 1734 transition count 2650
Deduced a syphon composed of 439 places in 3 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 581 place count 1734 transition count 2650
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 581 place count 1734 transition count 2650
Deduced a syphon composed of 440 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 582 place count 1734 transition count 2650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 583 place count 1733 transition count 2649
Deduced a syphon composed of 439 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 584 place count 1733 transition count 2649
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 664 places in 4 ms
Iterating global reduction 2 with 225 rules applied. Total rules applied 809 place count 1733 transition count 2679
Discarding 119 places :
Symmetric choice reduction at 2 with 119 rule applications. Total rules 928 place count 1614 transition count 2560
Deduced a syphon composed of 545 places in 3 ms
Iterating global reduction 2 with 119 rules applied. Total rules applied 1047 place count 1614 transition count 2560
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 555 places in 3 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1057 place count 1614 transition count 2612
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 556 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1058 place count 1614 transition count 2616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1060 place count 1612 transition count 2610
Deduced a syphon composed of 554 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1062 place count 1612 transition count 2610
Deduced a syphon composed of 554 places in 3 ms
Applied a total of 1062 rules in 742 ms. Remains 1612 /1784 variables (removed 172) and now considering 2610/2656 (removed 46) transitions.
[2023-03-11 02:30:50] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 2610 rows 1612 cols
[2023-03-11 02:30:50] [INFO ] Computed 239 place invariants in 18 ms
[2023-03-11 02:30:52] [INFO ] Dead Transitions using invariants and state equation in 1443 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1612/1784 places, 2610/2656 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2262 ms. Remains : 1612/1784 places, 2610/2656 transitions.
Built C files in :
/tmp/ltsmin18402374281267715429
[2023-03-11 02:30:52] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18402374281267715429
Running compilation step : cd /tmp/ltsmin18402374281267715429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18402374281267715429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18402374281267715429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 1784 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1784/1784 places, 2656/2656 transitions.
Applied a total of 0 rules in 111 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
// Phase 1: matrix 2656 rows 1784 cols
[2023-03-11 02:30:55] [INFO ] Computed 242 place invariants in 24 ms
[2023-03-11 02:30:56] [INFO ] Implicit Places using invariants in 1180 ms returned []
[2023-03-11 02:30:56] [INFO ] Invariant cache hit.
[2023-03-11 02:30:59] [INFO ] Implicit Places using invariants and state equation in 2984 ms returned []
Implicit Place search using SMT with State Equation took 4193 ms to find 0 implicit places.
[2023-03-11 02:30:59] [INFO ] Invariant cache hit.
[2023-03-11 02:31:00] [INFO ] Dead Transitions using invariants and state equation in 1370 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5690 ms. Remains : 1784/1784 places, 2656/2656 transitions.
Built C files in :
/tmp/ltsmin13699906309441174599
[2023-03-11 02:31:00] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13699906309441174599
Running compilation step : cd /tmp/ltsmin13699906309441174599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13699906309441174599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13699906309441174599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 02:31:04] [INFO ] Flatten gal took : 103 ms
[2023-03-11 02:31:04] [INFO ] Flatten gal took : 87 ms
[2023-03-11 02:31:04] [INFO ] Time to serialize gal into /tmp/LTL16962355683326515358.gal : 15 ms
[2023-03-11 02:31:04] [INFO ] Time to serialize properties into /tmp/LTL11477682466869649569.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16962355683326515358.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9184627521757140999.hoa' '-atoms' '/tmp/LTL11477682466869649569.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11477682466869649569.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9184627521757140999.hoa
Detected timeout of ITS tools.
[2023-03-11 02:31:19] [INFO ] Flatten gal took : 82 ms
[2023-03-11 02:31:19] [INFO ] Flatten gal took : 129 ms
[2023-03-11 02:31:19] [INFO ] Time to serialize gal into /tmp/LTL6731248536220896455.gal : 17 ms
[2023-03-11 02:31:19] [INFO ] Time to serialize properties into /tmp/LTL10105435215912585263.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6731248536220896455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10105435215912585263.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p1455==0)")))))
Formula 0 simplified : XXF!"(p1455==0)"
Detected timeout of ITS tools.
[2023-03-11 02:31:34] [INFO ] Flatten gal took : 80 ms
[2023-03-11 02:31:34] [INFO ] Applying decomposition
[2023-03-11 02:31:34] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4593127284528777426.txt' '-o' '/tmp/graph4593127284528777426.bin' '-w' '/tmp/graph4593127284528777426.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4593127284528777426.bin' '-l' '-1' '-v' '-w' '/tmp/graph4593127284528777426.weights' '-q' '0' '-e' '0.001'
[2023-03-11 02:31:35] [INFO ] Decomposing Gal with order
[2023-03-11 02:31:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:31:35] [INFO ] Removed a total of 3545 redundant transitions.
[2023-03-11 02:31:35] [INFO ] Flatten gal took : 148 ms
[2023-03-11 02:31:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 35 ms.
[2023-03-11 02:31:35] [INFO ] Time to serialize gal into /tmp/LTL9383908110193929116.gal : 14 ms
[2023-03-11 02:31:35] [INFO ] Time to serialize properties into /tmp/LTL4986806765220101459.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9383908110193929116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4986806765220101459.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i13.u406.p1455==0)")))))
Formula 0 simplified : XXF!"(i13.u406.p1455==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5877263288524748767
[2023-03-11 02:31:50] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5877263288524748767
Running compilation step : cd /tmp/ltsmin5877263288524748767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5877263288524748767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5877263288524748767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-09a-LTLCardinality-06 finished in 88667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(!p1 U (p2||G(!p1))))))'
Support contains 6 out of 1786 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1786/1786 places, 2662/2662 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 340 place count 1785 transition count 2321
Reduce places removed 349 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 357 rules applied. Total rules applied 697 place count 1436 transition count 2313
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 709 place count 1428 transition count 2309
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 713 place count 1424 transition count 2309
Performed 257 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 257 Pre rules applied. Total rules applied 713 place count 1424 transition count 2052
Deduced a syphon composed of 257 places in 4 ms
Ensure Unique test removed 77 places
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 4 with 591 rules applied. Total rules applied 1304 place count 1090 transition count 2052
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 4 with 49 rules applied. Total rules applied 1353 place count 1068 transition count 2025
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 1380 place count 1041 transition count 2025
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 37 Pre rules applied. Total rules applied 1380 place count 1041 transition count 1988
Deduced a syphon composed of 37 places in 5 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 1454 place count 1004 transition count 1988
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1469 place count 989 transition count 1968
Iterating global reduction 6 with 15 rules applied. Total rules applied 1484 place count 989 transition count 1968
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 13 rules applied. Total rules applied 1497 place count 989 transition count 1955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1498 place count 988 transition count 1955
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1498 place count 988 transition count 1954
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1500 place count 987 transition count 1954
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 8 with 170 rules applied. Total rules applied 1670 place count 902 transition count 1869
Applied a total of 1670 rules in 295 ms. Remains 902 /1786 variables (removed 884) and now considering 1869/2662 (removed 793) transitions.
// Phase 1: matrix 1869 rows 902 cols
[2023-03-11 02:31:53] [INFO ] Computed 135 place invariants in 51 ms
[2023-03-11 02:31:54] [INFO ] Implicit Places using invariants in 632 ms returned [72, 89, 95, 100, 108, 161, 182, 188, 193, 200, 260, 277, 283, 288, 290, 350, 367, 373, 379, 381, 441, 458, 465, 470, 472, 532, 549, 555, 560, 562, 622, 639, 645, 650, 652, 712, 731, 737, 742, 744, 804, 821, 827, 832, 834]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 634 ms to find 45 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 857/1786 places, 1869/2662 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 857 transition count 1864
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 852 transition count 1864
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 28 place count 834 transition count 1846
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 834 transition count 1846
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 62 place count 818 transition count 1830
Iterating global reduction 2 with 16 rules applied. Total rules applied 78 place count 818 transition count 1830
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 86 place count 810 transition count 1822
Iterating global reduction 2 with 8 rules applied. Total rules applied 94 place count 810 transition count 1822
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 132 place count 791 transition count 1803
Applied a total of 132 rules in 133 ms. Remains 791 /857 variables (removed 66) and now considering 1803/1869 (removed 66) transitions.
// Phase 1: matrix 1803 rows 791 cols
[2023-03-11 02:31:54] [INFO ] Computed 90 place invariants in 43 ms
[2023-03-11 02:31:55] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-11 02:31:55] [INFO ] Invariant cache hit.
[2023-03-11 02:31:56] [INFO ] Implicit Places using invariants and state equation in 1704 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 791/1786 places, 1803/2662 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3295 ms. Remains : 791/1786 places, 1803/2662 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (OR (EQ s788 0) (EQ s325 1))) (NOT (OR (EQ s168 0) (EQ s637 1)))), p0:(AND (EQ s628 0) (EQ s403 1)), p1:(OR (EQ s788 0) (EQ s325 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 129 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-09a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09a-LTLCardinality-07 finished in 3458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 4 out of 1786 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1786/1786 places, 2662/2662 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1785 transition count 2656
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1785 transition count 2656
Applied a total of 2 rules in 180 ms. Remains 1785 /1786 variables (removed 1) and now considering 2656/2662 (removed 6) transitions.
// Phase 1: matrix 2656 rows 1785 cols
[2023-03-11 02:31:57] [INFO ] Computed 243 place invariants in 46 ms
[2023-03-11 02:31:58] [INFO ] Implicit Places using invariants in 1054 ms returned [210]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1057 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1784/1786 places, 2656/2662 transitions.
Applied a total of 0 rules in 63 ms. Remains 1784 /1784 variables (removed 0) and now considering 2656/2656 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1301 ms. Remains : 1784/1786 places, 2656/2662 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s215 0) (EQ s1572 1)), p1:(OR (EQ s1339 0) (EQ s1457 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1162 ms.
Product exploration explored 100000 steps with 33333 reset in 1215 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-09a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-09a-LTLCardinality-12 finished in 4023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1786 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1786/1786 places, 2662/2662 transitions.
Drop transitions removed 344 transitions
Trivial Post-agglo rules discarded 344 transitions
Performed 344 trivial Post agglomeration. Transition count delta: 344
Iterating post reduction 0 with 344 rules applied. Total rules applied 344 place count 1786 transition count 2318
Reduce places removed 344 places and 0 transitions.
Iterating post reduction 1 with 344 rules applied. Total rules applied 688 place count 1442 transition count 2318
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 241 Pre rules applied. Total rules applied 688 place count 1442 transition count 2077
Deduced a syphon composed of 241 places in 4 ms
Ensure Unique test removed 77 places
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 559 rules applied. Total rules applied 1247 place count 1124 transition count 2077
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 21 rules applied. Total rules applied 1268 place count 1112 transition count 2068
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1277 place count 1103 transition count 2068
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 1277 place count 1103 transition count 2032
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1349 place count 1067 transition count 2032
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1354 place count 1062 transition count 2027
Iterating global reduction 4 with 5 rules applied. Total rules applied 1359 place count 1062 transition count 2027
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 1363 place count 1062 transition count 2023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1364 place count 1061 transition count 2023
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1364 place count 1061 transition count 2022
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1366 place count 1060 transition count 2022
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 2 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 6 with 186 rules applied. Total rules applied 1552 place count 967 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1553 place count 966 transition count 1928
Iterating global reduction 6 with 1 rules applied. Total rules applied 1554 place count 966 transition count 1928
Applied a total of 1554 rules in 288 ms. Remains 966 /1786 variables (removed 820) and now considering 1928/2662 (removed 734) transitions.
// Phase 1: matrix 1928 rows 966 cols
[2023-03-11 02:32:01] [INFO ] Computed 154 place invariants in 36 ms
[2023-03-11 02:32:02] [INFO ] Implicit Places using invariants in 643 ms returned [90, 96, 101, 117, 194, 200, 205, 206, 224, 294, 300, 305, 321, 391, 397, 402, 418, 488, 494, 499, 515, 585, 591, 596, 612, 682, 688, 693, 709, 784, 790, 795, 811, 881, 887, 892, 911, 963]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 646 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 928/1786 places, 1928/2662 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 928 transition count 1927
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 927 transition count 1927
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 2 place count 927 transition count 1909
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 38 place count 909 transition count 1909
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 57 place count 890 transition count 1890
Iterating global reduction 2 with 19 rules applied. Total rules applied 76 place count 890 transition count 1890
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 94 place count 872 transition count 1872
Iterating global reduction 2 with 18 rules applied. Total rules applied 112 place count 872 transition count 1872
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 121 place count 863 transition count 1863
Iterating global reduction 2 with 9 rules applied. Total rules applied 130 place count 863 transition count 1863
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 166 place count 845 transition count 1845
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 844 transition count 1843
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 844 transition count 1843
Applied a total of 168 rules in 225 ms. Remains 844 /928 variables (removed 84) and now considering 1843/1928 (removed 85) transitions.
// Phase 1: matrix 1843 rows 844 cols
[2023-03-11 02:32:02] [INFO ] Computed 116 place invariants in 38 ms
[2023-03-11 02:32:02] [INFO ] Implicit Places using invariants in 616 ms returned [93, 96, 184, 187, 268, 271, 352, 355, 436, 439, 520, 523, 604, 607, 693, 696, 777, 780]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 621 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 826/1786 places, 1843/2662 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 826 transition count 1834
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 817 transition count 1834
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 27 place count 808 transition count 1825
Iterating global reduction 2 with 9 rules applied. Total rules applied 36 place count 808 transition count 1825
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 45 place count 808 transition count 1816
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 807 transition count 1815
Applied a total of 47 rules in 83 ms. Remains 807 /826 variables (removed 19) and now considering 1815/1843 (removed 28) transitions.
// Phase 1: matrix 1815 rows 807 cols
[2023-03-11 02:32:02] [INFO ] Computed 98 place invariants in 22 ms
[2023-03-11 02:32:03] [INFO ] Implicit Places using invariants in 759 ms returned [72, 154, 238, 318, 398, 478, 558, 639, 723]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 761 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 798/1786 places, 1815/2662 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 789 transition count 1806
Applied a total of 18 rules in 57 ms. Remains 789 /798 variables (removed 9) and now considering 1806/1815 (removed 9) transitions.
// Phase 1: matrix 1806 rows 789 cols
[2023-03-11 02:32:03] [INFO ] Computed 89 place invariants in 34 ms
[2023-03-11 02:32:04] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-11 02:32:04] [INFO ] Invariant cache hit.
[2023-03-11 02:32:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-11 02:32:06] [INFO ] Implicit Places using invariants and state equation in 2335 ms returned []
Implicit Place search using SMT with State Equation took 2877 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 789/1786 places, 1806/2662 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 5558 ms. Remains : 789/1786 places, 1806/2662 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-15 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:(OR (EQ s98 0) (EQ s589 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]]
Product exploration explored 100000 steps with 1229 reset in 311 ms.
Product exploration explored 100000 steps with 1187 reset in 281 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 139 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6440 steps, run visited all 1 properties in 35 ms. (steps per millisecond=184 )
Probabilistic random walk after 6440 steps, saw 6278 distinct states, run finished after 36 ms. (steps per millisecond=178 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 789/789 places, 1806/1806 transitions.
Applied a total of 0 rules in 65 ms. Remains 789 /789 variables (removed 0) and now considering 1806/1806 (removed 0) transitions.
[2023-03-11 02:32:08] [INFO ] Invariant cache hit.
[2023-03-11 02:32:08] [INFO ] Implicit Places using invariants in 591 ms returned []
[2023-03-11 02:32:08] [INFO ] Invariant cache hit.
[2023-03-11 02:32:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-11 02:32:11] [INFO ] Implicit Places using invariants and state equation in 2360 ms returned []
Implicit Place search using SMT with State Equation took 2956 ms to find 0 implicit places.
[2023-03-11 02:32:11] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-11 02:32:11] [INFO ] Invariant cache hit.
[2023-03-11 02:32:12] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3729 ms. Remains : 789/789 places, 1806/1806 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6440 steps, run visited all 1 properties in 22 ms. (steps per millisecond=292 )
Probabilistic random walk after 6440 steps, saw 6278 distinct states, run finished after 22 ms. (steps per millisecond=292 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1216 reset in 351 ms.
Product exploration explored 100000 steps with 1225 reset in 270 ms.
Built C files in :
/tmp/ltsmin14075047035677643315
[2023-03-11 02:32:13] [INFO ] Too many transitions (1806) to apply POR reductions. Disabling POR matrices.
[2023-03-11 02:32:13] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14075047035677643315
Running compilation step : cd /tmp/ltsmin14075047035677643315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14075047035677643315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14075047035677643315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 789/789 places, 1806/1806 transitions.
Applied a total of 0 rules in 69 ms. Remains 789 /789 variables (removed 0) and now considering 1806/1806 (removed 0) transitions.
[2023-03-11 02:32:16] [INFO ] Invariant cache hit.
[2023-03-11 02:32:17] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-11 02:32:17] [INFO ] Invariant cache hit.
[2023-03-11 02:32:17] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-11 02:32:19] [INFO ] Implicit Places using invariants and state equation in 2521 ms returned []
Implicit Place search using SMT with State Equation took 3109 ms to find 0 implicit places.
[2023-03-11 02:32:19] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-11 02:32:19] [INFO ] Invariant cache hit.
[2023-03-11 02:32:20] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3938 ms. Remains : 789/789 places, 1806/1806 transitions.
Built C files in :
/tmp/ltsmin18034917957162039596
[2023-03-11 02:32:20] [INFO ] Too many transitions (1806) to apply POR reductions. Disabling POR matrices.
[2023-03-11 02:32:20] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18034917957162039596
Running compilation step : cd /tmp/ltsmin18034917957162039596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18034917957162039596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18034917957162039596;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 02:32:23] [INFO ] Flatten gal took : 56 ms
[2023-03-11 02:32:23] [INFO ] Flatten gal took : 53 ms
[2023-03-11 02:32:23] [INFO ] Time to serialize gal into /tmp/LTL4074100523929085488.gal : 8 ms
[2023-03-11 02:32:23] [INFO ] Time to serialize properties into /tmp/LTL1236989680727685527.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4074100523929085488.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2635609807079922715.hoa' '-atoms' '/tmp/LTL1236989680727685527.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1236989680727685527.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2635609807079922715.hoa
Detected timeout of ITS tools.
[2023-03-11 02:32:39] [INFO ] Flatten gal took : 56 ms
[2023-03-11 02:32:39] [INFO ] Flatten gal took : 53 ms
[2023-03-11 02:32:39] [INFO ] Time to serialize gal into /tmp/LTL4949425511485999037.gal : 8 ms
[2023-03-11 02:32:39] [INFO ] Time to serialize properties into /tmp/LTL10177367678320419000.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4949425511485999037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10177367678320419000.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p229==0)||(p1417==1))"))))
Formula 0 simplified : FG!"((p229==0)||(p1417==1))"
Detected timeout of ITS tools.
[2023-03-11 02:32:54] [INFO ] Flatten gal took : 50 ms
[2023-03-11 02:32:54] [INFO ] Applying decomposition
[2023-03-11 02:32:54] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13947848938267555736.txt' '-o' '/tmp/graph13947848938267555736.bin' '-w' '/tmp/graph13947848938267555736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13947848938267555736.bin' '-l' '-1' '-v' '-w' '/tmp/graph13947848938267555736.weights' '-q' '0' '-e' '0.001'
[2023-03-11 02:32:54] [INFO ] Decomposing Gal with order
[2023-03-11 02:32:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:32:54] [INFO ] Removed a total of 3564 redundant transitions.
[2023-03-11 02:32:54] [INFO ] Flatten gal took : 83 ms
[2023-03-11 02:32:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 27 ms.
[2023-03-11 02:32:54] [INFO ] Time to serialize gal into /tmp/LTL10646564595111648565.gal : 10 ms
[2023-03-11 02:32:54] [INFO ] Time to serialize properties into /tmp/LTL6339518794094194095.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10646564595111648565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6339518794094194095.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.u33.p229==0)||(i15.u144.p1417==1))"))))
Formula 0 simplified : FG!"((i4.u33.p229==0)||(i15.u144.p1417==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1017937230196925621
[2023-03-11 02:33:09] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1017937230196925621
Running compilation step : cd /tmp/ltsmin1017937230196925621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1017937230196925621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1017937230196925621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-09a-LTLCardinality-15 finished in 71721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : ASLink-PT-09a-LTLCardinality-06
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1786 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1786/1786 places, 2662/2662 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 1785 transition count 2313
Reduce places removed 357 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 365 rules applied. Total rules applied 713 place count 1428 transition count 2305
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 721 place count 1420 transition count 2305
Performed 260 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 260 Pre rules applied. Total rules applied 721 place count 1420 transition count 2045
Deduced a syphon composed of 260 places in 4 ms
Ensure Unique test removed 77 places
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 597 rules applied. Total rules applied 1318 place count 1083 transition count 2045
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 3 with 48 rules applied. Total rules applied 1366 place count 1061 transition count 2019
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 1392 place count 1035 transition count 2019
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 1392 place count 1035 transition count 1982
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1466 place count 998 transition count 1982
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1481 place count 983 transition count 1962
Iterating global reduction 5 with 15 rules applied. Total rules applied 1496 place count 983 transition count 1962
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 13 rules applied. Total rules applied 1509 place count 982 transition count 1950
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1510 place count 981 transition count 1950
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1510 place count 981 transition count 1949
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1512 place count 980 transition count 1949
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 7 with 170 rules applied. Total rules applied 1682 place count 895 transition count 1864
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1683 place count 894 transition count 1863
Iterating global reduction 7 with 1 rules applied. Total rules applied 1684 place count 894 transition count 1863
Applied a total of 1684 rules in 244 ms. Remains 894 /1786 variables (removed 892) and now considering 1863/2662 (removed 799) transitions.
// Phase 1: matrix 1863 rows 894 cols
[2023-03-11 02:33:13] [INFO ] Computed 134 place invariants in 36 ms
[2023-03-11 02:33:14] [INFO ] Implicit Places using invariants in 657 ms returned [72, 89, 95, 100, 108, 161, 182, 188, 193, 195, 255, 272, 278, 283, 285, 345, 362, 368, 373, 375, 435, 452, 458, 463, 465, 525, 542, 548, 553, 555, 615, 632, 638, 643, 645, 723, 729, 734, 738, 798, 815, 821, 826, 828, 891]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 659 ms to find 45 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 849/1786 places, 1863/2662 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 849 transition count 1858
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 844 transition count 1858
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 28 place count 826 transition count 1840
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 826 transition count 1840
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 64 place count 808 transition count 1822
Iterating global reduction 2 with 18 rules applied. Total rules applied 82 place count 808 transition count 1822
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 91 place count 799 transition count 1813
Iterating global reduction 2 with 9 rules applied. Total rules applied 100 place count 799 transition count 1813
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 136 place count 781 transition count 1795
Applied a total of 136 rules in 127 ms. Remains 781 /849 variables (removed 68) and now considering 1795/1863 (removed 68) transitions.
// Phase 1: matrix 1795 rows 781 cols
[2023-03-11 02:33:14] [INFO ] Computed 89 place invariants in 34 ms
[2023-03-11 02:33:14] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-11 02:33:14] [INFO ] Invariant cache hit.
[2023-03-11 02:33:16] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 2561 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 781/1786 places, 1795/2662 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3604 ms. Remains : 781/1786 places, 1795/2662 transitions.
Running random walk in product with property : ASLink-PT-09a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s616 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1212 reset in 288 ms.
Product exploration explored 100000 steps with 1249 reset in 327 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 129 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2846 steps, run visited all 1 properties in 12 ms. (steps per millisecond=237 )
Probabilistic random walk after 2846 steps, saw 2779 distinct states, run finished after 12 ms. (steps per millisecond=237 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1795/1795 transitions.
Applied a total of 0 rules in 45 ms. Remains 781 /781 variables (removed 0) and now considering 1795/1795 (removed 0) transitions.
[2023-03-11 02:33:18] [INFO ] Invariant cache hit.
[2023-03-11 02:33:18] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-11 02:33:18] [INFO ] Invariant cache hit.
[2023-03-11 02:33:20] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 2324 ms to find 0 implicit places.
[2023-03-11 02:33:20] [INFO ] Invariant cache hit.
[2023-03-11 02:33:21] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3065 ms. Remains : 781/781 places, 1795/1795 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 123 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2846 steps, run visited all 1 properties in 11 ms. (steps per millisecond=258 )
Probabilistic random walk after 2846 steps, saw 2779 distinct states, run finished after 11 ms. (steps per millisecond=258 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1266 reset in 264 ms.
Product exploration explored 100000 steps with 1283 reset in 303 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1795/1795 transitions.
Applied a total of 0 rules in 66 ms. Remains 781 /781 variables (removed 0) and now considering 1795/1795 (removed 0) transitions.
[2023-03-11 02:33:23] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-11 02:33:23] [INFO ] Invariant cache hit.
[2023-03-11 02:33:24] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 825 ms. Remains : 781/781 places, 1795/1795 transitions.
Built C files in :
/tmp/ltsmin17739152064763232050
[2023-03-11 02:33:24] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17739152064763232050
Running compilation step : cd /tmp/ltsmin17739152064763232050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17739152064763232050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17739152064763232050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1795/1795 transitions.
Applied a total of 0 rules in 23 ms. Remains 781 /781 variables (removed 0) and now considering 1795/1795 (removed 0) transitions.
[2023-03-11 02:33:27] [INFO ] Invariant cache hit.
[2023-03-11 02:33:27] [INFO ] Implicit Places using invariants in 548 ms returned []
[2023-03-11 02:33:27] [INFO ] Invariant cache hit.
[2023-03-11 02:33:29] [INFO ] Implicit Places using invariants and state equation in 1916 ms returned []
Implicit Place search using SMT with State Equation took 2466 ms to find 0 implicit places.
[2023-03-11 02:33:29] [INFO ] Invariant cache hit.
[2023-03-11 02:33:30] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3473 ms. Remains : 781/781 places, 1795/1795 transitions.
Built C files in :
/tmp/ltsmin16772669122355761478
[2023-03-11 02:33:30] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16772669122355761478
Running compilation step : cd /tmp/ltsmin16772669122355761478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16772669122355761478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16772669122355761478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 02:33:33] [INFO ] Flatten gal took : 62 ms
[2023-03-11 02:33:33] [INFO ] Flatten gal took : 55 ms
[2023-03-11 02:33:33] [INFO ] Time to serialize gal into /tmp/LTL18007737098032435442.gal : 6 ms
[2023-03-11 02:33:33] [INFO ] Time to serialize properties into /tmp/LTL11067369447840911806.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18007737098032435442.gal' '-t' 'CGAL' '-hoa' '/tmp/aut422994159686784729.hoa' '-atoms' '/tmp/LTL11067369447840911806.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11067369447840911806.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut422994159686784729.hoa
Detected timeout of ITS tools.
[2023-03-11 02:33:49] [INFO ] Flatten gal took : 50 ms
[2023-03-11 02:33:49] [INFO ] Flatten gal took : 63 ms
[2023-03-11 02:33:49] [INFO ] Time to serialize gal into /tmp/LTL9769992928650786405.gal : 7 ms
[2023-03-11 02:33:49] [INFO ] Time to serialize properties into /tmp/LTL18266237763100269746.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9769992928650786405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18266237763100269746.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(p1455==0)")))))
Formula 0 simplified : XXF!"(p1455==0)"
Detected timeout of ITS tools.
[2023-03-11 02:34:04] [INFO ] Flatten gal took : 88 ms
[2023-03-11 02:34:04] [INFO ] Applying decomposition
[2023-03-11 02:34:04] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14556814393486659700.txt' '-o' '/tmp/graph14556814393486659700.bin' '-w' '/tmp/graph14556814393486659700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14556814393486659700.bin' '-l' '-1' '-v' '-w' '/tmp/graph14556814393486659700.weights' '-q' '0' '-e' '0.001'
[2023-03-11 02:34:04] [INFO ] Decomposing Gal with order
[2023-03-11 02:34:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:34:04] [INFO ] Removed a total of 3553 redundant transitions.
[2023-03-11 02:34:04] [INFO ] Flatten gal took : 82 ms
[2023-03-11 02:34:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 14 ms.
[2023-03-11 02:34:04] [INFO ] Time to serialize gal into /tmp/LTL2499906662774801774.gal : 9 ms
[2023-03-11 02:34:04] [INFO ] Time to serialize properties into /tmp/LTL4165907604011036294.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2499906662774801774.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4165907604011036294.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i15.u150.p1455==0)")))))
Formula 0 simplified : XXF!"(i15.u150.p1455==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7293763432028679688
[2023-03-11 02:34:19] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7293763432028679688
Running compilation step : cd /tmp/ltsmin7293763432028679688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7293763432028679688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7293763432028679688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-09a-LTLCardinality-06 finished in 69871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-11 02:34:23] [INFO ] Flatten gal took : 102 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8385018056575630254
[2023-03-11 02:34:23] [INFO ] Too many transitions (2662) to apply POR reductions. Disabling POR matrices.
[2023-03-11 02:34:23] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8385018056575630254
Running compilation step : cd /tmp/ltsmin8385018056575630254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 02:34:23] [INFO ] Applying decomposition
[2023-03-11 02:34:23] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5631095966740575780.txt' '-o' '/tmp/graph5631095966740575780.bin' '-w' '/tmp/graph5631095966740575780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5631095966740575780.bin' '-l' '-1' '-v' '-w' '/tmp/graph5631095966740575780.weights' '-q' '0' '-e' '0.001'
[2023-03-11 02:34:23] [INFO ] Decomposing Gal with order
[2023-03-11 02:34:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:34:23] [INFO ] Removed a total of 3539 redundant transitions.
[2023-03-11 02:34:23] [INFO ] Flatten gal took : 121 ms
[2023-03-11 02:34:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 18 ms.
[2023-03-11 02:34:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality17522315792100035530.gal : 15 ms
[2023-03-11 02:34:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality15268494220317027751.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17522315792100035530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15268494220317027751.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((F(G("((i1.u53.p174==0)||(i13.u340.p1246==1))"))))
Formula 0 simplified : GF!"((i1.u53.p174==0)||(i13.u340.p1246==1))"
Compilation finished in 5505 ms.
Running link step : cd /tmp/ltsmin8385018056575630254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin8385018056575630254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8385018056575630254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8385018056575630254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 02:56:54] [INFO ] Applying decomposition
[2023-03-11 02:56:54] [INFO ] Flatten gal took : 192 ms
[2023-03-11 02:56:54] [INFO ] Decomposing Gal with order
[2023-03-11 02:56:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:56:54] [INFO ] Removed a total of 2966 redundant transitions.
[2023-03-11 02:56:54] [INFO ] Flatten gal took : 317 ms
[2023-03-11 02:56:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1147 labels/synchronizations in 116 ms.
[2023-03-11 02:56:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality17460274531597279251.gal : 25 ms
[2023-03-11 02:56:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality18336605612400980939.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17460274531597279251.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18336605612400980939.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((F(G("((i5.u23.p174==0)||(u216.p1246==1))"))))
Formula 0 simplified : GF!"((i5.u23.p174==0)||(u216.p1246==1))"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8385018056575630254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8385018056575630254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 03:19:25] [INFO ] Flatten gal took : 162 ms
[2023-03-11 03:19:26] [INFO ] Input system was already deterministic with 2662 transitions.
[2023-03-11 03:19:26] [INFO ] Transformed 1786 places.
[2023-03-11 03:19:26] [INFO ] Transformed 2662 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 03:19:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality5696373206333166606.gal : 17 ms
[2023-03-11 03:19:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality817700613933500582.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5696373206333166606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality817700613933500582.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((p174==0)||(p1246==1))"))))
Formula 0 simplified : GF!"((p174==0)||(p1246==1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10435192 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16033304 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-09a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-09a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813592700139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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