Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 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 1.1M 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 DLCround-PT-08b-LTLFireability-00
FORMULA_NAME DLCround-PT-08b-LTLFireability-01
FORMULA_NAME DLCround-PT-08b-LTLFireability-02
FORMULA_NAME DLCround-PT-08b-LTLFireability-03
FORMULA_NAME DLCround-PT-08b-LTLFireability-04
FORMULA_NAME DLCround-PT-08b-LTLFireability-05
FORMULA_NAME DLCround-PT-08b-LTLFireability-06
FORMULA_NAME DLCround-PT-08b-LTLFireability-07
FORMULA_NAME DLCround-PT-08b-LTLFireability-08
FORMULA_NAME DLCround-PT-08b-LTLFireability-09
FORMULA_NAME DLCround-PT-08b-LTLFireability-10
FORMULA_NAME DLCround-PT-08b-LTLFireability-11
FORMULA_NAME DLCround-PT-08b-LTLFireability-12
FORMULA_NAME DLCround-PT-08b-LTLFireability-13
FORMULA_NAME DLCround-PT-08b-LTLFireability-14
FORMULA_NAME DLCround-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678309033133

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-08b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 20:57:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 20:57:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:57:15] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2023-03-08 20:57:15] [INFO ] Transformed 3088 places.
[2023-03-08 20:57:15] [INFO ] Transformed 4732 transitions.
[2023-03-08 20:57:15] [INFO ] Found NUPN structural information;
[2023-03-08 20:57:15] [INFO ] Parsed PT model containing 3088 places and 4732 transitions and 13004 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DLCround-PT-08b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 3088 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3088/3088 places, 4732/4732 transitions.
Discarding 542 places :
Symmetric choice reduction at 0 with 542 rule applications. Total rules 542 place count 2546 transition count 4190
Iterating global reduction 0 with 542 rules applied. Total rules applied 1084 place count 2546 transition count 4190
Discarding 433 places :
Symmetric choice reduction at 0 with 433 rule applications. Total rules 1517 place count 2113 transition count 3757
Iterating global reduction 0 with 433 rules applied. Total rules applied 1950 place count 2113 transition count 3757
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 1959 place count 2113 transition count 3748
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 2016 place count 2056 transition count 3643
Iterating global reduction 1 with 57 rules applied. Total rules applied 2073 place count 2056 transition count 3643
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 2109 place count 2020 transition count 3607
Iterating global reduction 1 with 36 rules applied. Total rules applied 2145 place count 2020 transition count 3607
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 2149 place count 2020 transition count 3603
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 2168 place count 2001 transition count 3584
Iterating global reduction 2 with 19 rules applied. Total rules applied 2187 place count 2001 transition count 3584
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 2205 place count 1983 transition count 3566
Iterating global reduction 2 with 18 rules applied. Total rules applied 2223 place count 1983 transition count 3566
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 2241 place count 1965 transition count 3548
Iterating global reduction 2 with 18 rules applied. Total rules applied 2259 place count 1965 transition count 3548
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2269 place count 1955 transition count 3538
Iterating global reduction 2 with 10 rules applied. Total rules applied 2279 place count 1955 transition count 3538
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2285 place count 1949 transition count 3532
Iterating global reduction 2 with 6 rules applied. Total rules applied 2291 place count 1949 transition count 3532
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2297 place count 1943 transition count 3526
Iterating global reduction 2 with 6 rules applied. Total rules applied 2303 place count 1943 transition count 3526
Applied a total of 2303 rules in 1296 ms. Remains 1943 /3088 variables (removed 1145) and now considering 3526/4732 (removed 1206) transitions.
// Phase 1: matrix 3526 rows 1943 cols
[2023-03-08 20:57:17] [INFO ] Computed 157 place invariants in 38 ms
[2023-03-08 20:57:17] [INFO ] Implicit Places using invariants in 735 ms returned []
[2023-03-08 20:57:17] [INFO ] Invariant cache hit.
[2023-03-08 20:57:19] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 2372 ms to find 0 implicit places.
[2023-03-08 20:57:19] [INFO ] Invariant cache hit.
[2023-03-08 20:57:20] [INFO ] Dead Transitions using invariants and state equation in 1446 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1943/3088 places, 3526/4732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5119 ms. Remains : 1943/3088 places, 3526/4732 transitions.
Support contains 38 out of 1943 places after structural reductions.
[2023-03-08 20:57:21] [INFO ] Flatten gal took : 243 ms
[2023-03-08 20:57:21] [INFO ] Flatten gal took : 149 ms
[2023-03-08 20:57:21] [INFO ] Input system was already deterministic with 3526 transitions.
Support contains 31 out of 1943 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 23) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 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 2 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 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 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 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-08 20:57:22] [INFO ] Invariant cache hit.
[2023-03-08 20:57:23] [INFO ] [Real]Absence check using 157 positive place invariants in 109 ms returned sat
[2023-03-08 20:57:23] [INFO ] After 788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 20:57:23] [INFO ] [Nat]Absence check using 157 positive place invariants in 102 ms returned sat
[2023-03-08 20:57:26] [INFO ] After 1794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-08 20:57:27] [INFO ] After 3427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 867 ms.
[2023-03-08 20:57:28] [INFO ] After 5216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 9 properties in 88 ms.
Support contains 2 out of 1943 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Graph (trivial) has 1724 edges and 1943 vertex of which 485 / 1943 are part of one of the 40 SCC in 7 ms
Free SCC test removed 445 places
Drop transitions removed 507 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 520 transitions.
Drop transitions removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 312 rules applied. Total rules applied 313 place count 1498 transition count 2694
Reduce places removed 312 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 351 rules applied. Total rules applied 664 place count 1186 transition count 2655
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 690 place count 1160 transition count 2655
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 690 place count 1160 transition count 2501
Deduced a syphon composed of 154 places in 7 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 998 place count 1006 transition count 2501
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 1068 place count 936 transition count 1981
Iterating global reduction 3 with 70 rules applied. Total rules applied 1138 place count 936 transition count 1981
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1142 place count 936 transition count 1977
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1142 place count 936 transition count 1974
Deduced a syphon composed of 3 places in 26 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1148 place count 933 transition count 1974
Performed 358 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 358 places in 1 ms
Reduce places removed 358 places and 0 transitions.
Iterating global reduction 4 with 716 rules applied. Total rules applied 1864 place count 575 transition count 1607
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1873 place count 575 transition count 1598
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1898 place count 550 transition count 1310
Iterating global reduction 5 with 25 rules applied. Total rules applied 1923 place count 550 transition count 1310
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1945 place count 550 transition count 1288
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -378
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 2023 place count 511 transition count 1666
Drop transitions removed 12 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 2038 place count 511 transition count 1651
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2059 place count 490 transition count 1161
Iterating global reduction 7 with 21 rules applied. Total rules applied 2080 place count 490 transition count 1161
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 2101 place count 490 transition count 1140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2107 place count 487 transition count 1162
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 8 with 137 rules applied. Total rules applied 2244 place count 487 transition count 1025
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 2253 place count 478 transition count 916
Iterating global reduction 8 with 9 rules applied. Total rules applied 2262 place count 478 transition count 916
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 2271 place count 478 transition count 907
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2279 place count 474 transition count 934
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2284 place count 474 transition count 929
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 2305 place count 474 transition count 908
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2313 place count 470 transition count 935
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2319 place count 470 transition count 929
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 2340 place count 470 transition count 908
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2348 place count 466 transition count 935
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2354 place count 466 transition count 929
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 12 with 20 rules applied. Total rules applied 2374 place count 466 transition count 909
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2382 place count 462 transition count 937
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 2388 place count 462 transition count 931
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 2409 place count 462 transition count 910
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2417 place count 458 transition count 937
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2423 place count 458 transition count 931
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 14 with 20 rules applied. Total rules applied 2443 place count 458 transition count 911
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2451 place count 454 transition count 939
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2457 place count 454 transition count 933
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 2478 place count 454 transition count 912
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2486 place count 450 transition count 939
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2492 place count 450 transition count 933
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 16 with 20 rules applied. Total rules applied 2512 place count 450 transition count 913
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2520 place count 446 transition count 941
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2526 place count 446 transition count 935
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 2547 place count 446 transition count 914
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2555 place count 442 transition count 941
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2561 place count 442 transition count 935
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 18 with 20 rules applied. Total rules applied 2581 place count 442 transition count 915
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2589 place count 438 transition count 943
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2595 place count 438 transition count 937
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2616 place count 438 transition count 916
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2624 place count 434 transition count 943
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2630 place count 434 transition count 937
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 20 with 20 rules applied. Total rules applied 2650 place count 434 transition count 917
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2658 place count 430 transition count 945
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2664 place count 430 transition count 939
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2685 place count 430 transition count 918
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2693 place count 426 transition count 945
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2699 place count 426 transition count 939
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 22 with 20 rules applied. Total rules applied 2719 place count 426 transition count 919
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2727 place count 422 transition count 947
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2733 place count 422 transition count 941
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 2754 place count 422 transition count 920
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 2762 place count 418 transition count 947
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 2768 place count 418 transition count 941
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 24 with 20 rules applied. Total rules applied 2788 place count 418 transition count 921
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 2796 place count 414 transition count 949
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 2802 place count 414 transition count 943
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 25 with 21 rules applied. Total rules applied 2823 place count 414 transition count 922
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 2831 place count 410 transition count 947
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 25 with 5 rules applied. Total rules applied 2836 place count 410 transition count 942
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 26 with 20 rules applied. Total rules applied 2856 place count 410 transition count 922
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 2864 place count 406 transition count 941
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 2868 place count 406 transition count 937
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 27 with 19 rules applied. Total rules applied 2887 place count 406 transition count 918
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 2895 place count 402 transition count 937
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 2899 place count 402 transition count 933
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 28 with 19 rules applied. Total rules applied 2918 place count 402 transition count 914
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 2926 place count 398 transition count 933
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2930 place count 398 transition count 929
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 2949 place count 398 transition count 910
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 2957 place count 394 transition count 929
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 2961 place count 394 transition count 925
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 2980 place count 394 transition count 906
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 2988 place count 390 transition count 925
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 2992 place count 390 transition count 921
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 3011 place count 390 transition count 902
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 3019 place count 386 transition count 921
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 3023 place count 386 transition count 917
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 3042 place count 386 transition count 898
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 3050 place count 382 transition count 917
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 3054 place count 382 transition count 913
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 3073 place count 382 transition count 894
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 3081 place count 378 transition count 913
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 3085 place count 378 transition count 909
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 3104 place count 378 transition count 890
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 3112 place count 374 transition count 909
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 3116 place count 374 transition count 905
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 3135 place count 374 transition count 886
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 3143 place count 370 transition count 905
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 3147 place count 370 transition count 901
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 36 with 19 rules applied. Total rules applied 3166 place count 370 transition count 882
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 3174 place count 366 transition count 901
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 3178 place count 366 transition count 897
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 3197 place count 366 transition count 878
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 37 with 8 rules applied. Total rules applied 3205 place count 362 transition count 897
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 3209 place count 362 transition count 893
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 38 with 19 rules applied. Total rules applied 3228 place count 362 transition count 874
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 38 with 8 rules applied. Total rules applied 3236 place count 358 transition count 893
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 3240 place count 358 transition count 889
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 39 with 19 rules applied. Total rules applied 3259 place count 358 transition count 870
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 39 with 8 rules applied. Total rules applied 3267 place count 354 transition count 889
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3271 place count 354 transition count 885
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 40 with 19 rules applied. Total rules applied 3290 place count 354 transition count 866
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 40 with 8 rules applied. Total rules applied 3298 place count 350 transition count 885
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 3302 place count 350 transition count 881
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 41 with 19 rules applied. Total rules applied 3321 place count 350 transition count 862
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 41 with 8 rules applied. Total rules applied 3329 place count 346 transition count 881
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 41 with 4 rules applied. Total rules applied 3333 place count 346 transition count 877
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 42 with 19 rules applied. Total rules applied 3352 place count 346 transition count 858
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 42 with 8 rules applied. Total rules applied 3360 place count 342 transition count 877
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 42 with 4 rules applied. Total rules applied 3364 place count 342 transition count 873
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 43 with 19 rules applied. Total rules applied 3383 place count 342 transition count 854
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 43 with 6 rules applied. Total rules applied 3389 place count 339 transition count 864
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 43 with 3 rules applied. Total rules applied 3392 place count 339 transition count 861
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 44 with 10 rules applied. Total rules applied 3402 place count 339 transition count 851
Free-agglomeration rule applied 31 times with reduction of 1 identical transitions.
Iterating global reduction 44 with 31 rules applied. Total rules applied 3433 place count 339 transition count 819
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 314 transitions
Reduce isomorphic transitions removed 314 transitions.
Graph (complete) has 879 edges and 308 vertex of which 50 are kept as prefixes of interest. Removing 258 places using SCC suffix rule.1 ms
Discarding 258 places :
Also discarding 189 output transitions
Drop transitions removed 189 transitions
Iterating post reduction 44 with 346 rules applied. Total rules applied 3779 place count 50 transition count 316
Drop transitions removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 45 with 198 rules applied. Total rules applied 3977 place count 50 transition count 118
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 46 with 17 rules applied. Total rules applied 3994 place count 50 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 46 with 1 rules applied. Total rules applied 3995 place count 49 transition count 100
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 46 with 9 rules applied. Total rules applied 4004 place count 40 transition count 100
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 47 with 27 rules applied. Total rules applied 4031 place count 22 transition count 91
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Graph (trivial) has 11 edges and 22 vertex of which 2 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 47 with 35 rules applied. Total rules applied 4066 place count 21 transition count 57
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 48 with 2 rules applied. Total rules applied 4068 place count 21 transition count 55
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 49 with 24 rules applied. Total rules applied 4092 place count 5 transition count 47
Drop transitions removed 16 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (trivial) has 2 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 49 with 39 rules applied. Total rules applied 4131 place count 4 transition count 9
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 50 with 4 rules applied. Total rules applied 4135 place count 4 transition count 5
Applied a total of 4135 rules in 2046 ms. Remains 4 /1943 variables (removed 1939) and now considering 5/3526 (removed 3521) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2046 ms. Remains : 4/1943 places, 5/3526 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA DLCround-PT-08b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 325 stabilizing places and 325 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((F(G(p1))&&F(p2)&&p0))))'
Support contains 3 out of 1943 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1930 transition count 3469
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1930 transition count 3469
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 1925 transition count 3464
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 1925 transition count 3464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1923 transition count 3462
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1923 transition count 3462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1921 transition count 3460
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1921 transition count 3460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1919 transition count 3458
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1919 transition count 3458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1917 transition count 3456
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1917 transition count 3456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1916 transition count 3455
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1916 transition count 3455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1915 transition count 3454
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1915 transition count 3454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1914 transition count 3453
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1914 transition count 3453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1913 transition count 3452
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1913 transition count 3452
Applied a total of 60 rules in 703 ms. Remains 1913 /1943 variables (removed 30) and now considering 3452/3526 (removed 74) transitions.
// Phase 1: matrix 3452 rows 1913 cols
[2023-03-08 20:57:32] [INFO ] Computed 157 place invariants in 22 ms
[2023-03-08 20:57:32] [INFO ] Implicit Places using invariants in 596 ms returned []
[2023-03-08 20:57:32] [INFO ] Invariant cache hit.
[2023-03-08 20:57:34] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
[2023-03-08 20:57:34] [INFO ] Invariant cache hit.
[2023-03-08 20:57:35] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1913/1943 places, 3452/3526 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4329 ms. Remains : 1913/1943 places, 3452/3526 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s724 1) (EQ s1383 1)), p2:(EQ s687 0), p1:(AND (EQ s724 1) (EQ s1383 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 597 ms.
Product exploration explored 100000 steps with 2 reset in 728 ms.
Computed a total of 309 stabilizing places and 309 stable transitions
Computed a total of 309 stabilizing places and 309 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p0))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 294 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:57:38] [INFO ] Invariant cache hit.
[2023-03-08 20:57:38] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:57:38] [INFO ] [Nat]Absence check using 157 positive place invariants in 97 ms returned sat
[2023-03-08 20:57:38] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p0))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 8 factoid took 377 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-08 20:57:39] [INFO ] Invariant cache hit.
[2023-03-08 20:57:40] [INFO ] [Real]Absence check using 157 positive place invariants in 53 ms returned unsat
Proved EG (NOT p1)
[2023-03-08 20:57:40] [INFO ] Invariant cache hit.
[2023-03-08 20:57:41] [INFO ] [Real]Absence check using 157 positive place invariants in 33 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p0))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F p0), (G (NOT p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 183 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-08b-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-08b-LTLFireability-01 finished in 10949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)||p0))))'
Support contains 3 out of 1943 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1929 transition count 3468
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1929 transition count 3468
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 1923 transition count 3462
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 1923 transition count 3462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1921 transition count 3460
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1921 transition count 3460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1919 transition count 3458
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1919 transition count 3458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1917 transition count 3456
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1917 transition count 3456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1915 transition count 3454
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1915 transition count 3454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1914 transition count 3453
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1914 transition count 3453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1913 transition count 3452
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1913 transition count 3452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1912 transition count 3451
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1912 transition count 3451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1911 transition count 3450
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1911 transition count 3450
Applied a total of 64 rules in 736 ms. Remains 1911 /1943 variables (removed 32) and now considering 3450/3526 (removed 76) transitions.
// Phase 1: matrix 3450 rows 1911 cols
[2023-03-08 20:57:42] [INFO ] Computed 157 place invariants in 21 ms
[2023-03-08 20:57:43] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-08 20:57:43] [INFO ] Invariant cache hit.
[2023-03-08 20:57:44] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 2072 ms to find 0 implicit places.
[2023-03-08 20:57:44] [INFO ] Invariant cache hit.
[2023-03-08 20:57:46] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1911/1943 places, 3450/3526 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4214 ms. Remains : 1911/1943 places, 3450/3526 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s410 0) (EQ s1609 0)), p1:(EQ s949 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 492 ms.
Product exploration explored 100000 steps with 0 reset in 666 ms.
Computed a total of 309 stabilizing places and 309 stable transitions
Computed a total of 309 stabilizing places and 309 stable transitions
Detected a total of 309/1911 stabilizing places and 309/3450 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 631 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 20:57:48] [INFO ] Invariant cache hit.
[2023-03-08 20:57:48] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 20:57:49] [INFO ] [Nat]Absence check using 157 positive place invariants in 100 ms returned sat
[2023-03-08 20:57:50] [INFO ] After 1061ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-08 20:57:50] [INFO ] After 1356ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-08 20:57:50] [INFO ] After 1910ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 263 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=87 )
Parikh walk visited 2 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(F (OR (G p1) (G (NOT p1))))
Knowledge based reduction with 13 factoid took 475 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-08b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-08b-LTLFireability-02 finished in 9113 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((p0||F(p1)))||(F(p2)&&G(p3)))))'
Support contains 5 out of 1943 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1930 transition count 3469
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1930 transition count 3469
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 1924 transition count 3463
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 1924 transition count 3463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1922 transition count 3461
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1922 transition count 3461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1920 transition count 3459
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1920 transition count 3459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1918 transition count 3457
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1918 transition count 3457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1916 transition count 3455
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1916 transition count 3455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1915 transition count 3454
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1915 transition count 3454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1914 transition count 3453
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1914 transition count 3453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1913 transition count 3452
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1913 transition count 3452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1912 transition count 3451
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1912 transition count 3451
Applied a total of 62 rules in 714 ms. Remains 1912 /1943 variables (removed 31) and now considering 3451/3526 (removed 75) transitions.
// Phase 1: matrix 3451 rows 1912 cols
[2023-03-08 20:57:51] [INFO ] Computed 157 place invariants in 19 ms
[2023-03-08 20:57:52] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-08 20:57:52] [INFO ] Invariant cache hit.
[2023-03-08 20:57:53] [INFO ] Implicit Places using invariants and state equation in 1621 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
[2023-03-08 20:57:53] [INFO ] Invariant cache hit.
[2023-03-08 20:57:55] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1912/1943 places, 3451/3526 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4187 ms. Remains : 1912/1943 places, 3451/3526 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}, { cond=(AND p2 p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p3 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) p3 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p3 (NOT p1)), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 7}], [{ cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(AND (EQ s407 1) (EQ s1592 1)), p2:(OR (EQ s617 0) (EQ s1322 0)), p0:(AND (EQ s617 1) (EQ s1322 1)), p1:(EQ s1285 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 16 reset in 470 ms.
Product exploration explored 100000 steps with 19 reset in 568 ms.
Computed a total of 309 stabilizing places and 309 stable transitions
Computed a total of 309 stabilizing places and 309 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p3))), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 678 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 566684 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 566684 steps, saw 560193 distinct states, run finished after 3002 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:58:00] [INFO ] Invariant cache hit.
[2023-03-08 20:58:01] [INFO ] [Real]Absence check using 157 positive place invariants in 96 ms returned sat
[2023-03-08 20:58:02] [INFO ] After 989ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 20:58:02] [INFO ] After 1178ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:58:02] [INFO ] After 1523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:58:02] [INFO ] [Nat]Absence check using 157 positive place invariants in 98 ms returned sat
[2023-03-08 20:58:03] [INFO ] After 989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:58:03] [INFO ] After 1153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-08 20:58:03] [INFO ] After 1566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 362 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=120 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p3))), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 2674 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-08 20:58:06] [INFO ] Invariant cache hit.
[2023-03-08 20:58:08] [INFO ] [Real]Absence check using 157 positive place invariants in 237 ms returned sat
[2023-03-08 20:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:58:14] [INFO ] [Real]Absence check using state equation in 6458 ms returned sat
[2023-03-08 20:58:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:58:17] [INFO ] [Nat]Absence check using 157 positive place invariants in 257 ms returned sat
[2023-03-08 20:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:58:23] [INFO ] [Nat]Absence check using state equation in 6241 ms returned sat
[2023-03-08 20:58:24] [INFO ] Computed and/alt/rep : 3202/5315/3202 causal constraints (skipped 248 transitions) in 174 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 20:58:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 1 out of 1912 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1912/1912 places, 3451/3451 transitions.
Applied a total of 0 rules in 79 ms. Remains 1912 /1912 variables (removed 0) and now considering 3451/3451 (removed 0) transitions.
[2023-03-08 20:58:29] [INFO ] Invariant cache hit.
[2023-03-08 20:58:30] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-08 20:58:30] [INFO ] Invariant cache hit.
[2023-03-08 20:58:32] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2023-03-08 20:58:32] [INFO ] Invariant cache hit.
[2023-03-08 20:58:33] [INFO ] Dead Transitions using invariants and state equation in 1361 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3519 ms. Remains : 1912/1912 places, 3451/3451 transitions.
Computed a total of 309 stabilizing places and 309 stable transitions
Computed a total of 309 stabilizing places and 309 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 431 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 9399 steps, including 2 resets, run visited all 1 properties in 41 ms. (steps per millisecond=229 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-08 20:58:34] [INFO ] Invariant cache hit.
[2023-03-08 20:58:35] [INFO ] [Real]Absence check using 157 positive place invariants in 229 ms returned sat
[2023-03-08 20:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:58:41] [INFO ] [Real]Absence check using state equation in 6080 ms returned sat
[2023-03-08 20:58:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:58:43] [INFO ] [Nat]Absence check using 157 positive place invariants in 259 ms returned sat
[2023-03-08 20:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:58:49] [INFO ] [Nat]Absence check using state equation in 6203 ms returned sat
[2023-03-08 20:58:49] [INFO ] Computed and/alt/rep : 3202/5315/3202 causal constraints (skipped 248 transitions) in 148 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 20:58:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 2184 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 18 reset in 459 ms.
Product exploration explored 100000 steps with 22 reset in 518 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 1912 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1912/1912 places, 3451/3451 transitions.
Graph (trivial) has 1698 edges and 1912 vertex of which 483 / 1912 are part of one of the 40 SCC in 1 ms
Free SCC test removed 443 places
Ensure Unique test removed 478 transitions
Reduce isomorphic transitions removed 478 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 294 rules applied. Total rules applied 295 place count 1469 transition count 2973
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 26 rules applied. Total rules applied 321 place count 1469 transition count 2960
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 321 place count 1469 transition count 2965
Deduced a syphon composed of 316 places in 10 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 330 place count 1469 transition count 2965
Discarding 144 places :
Symmetric choice reduction at 2 with 144 rule applications. Total rules 474 place count 1325 transition count 2382
Deduced a syphon composed of 235 places in 8 ms
Iterating global reduction 2 with 144 rules applied. Total rules applied 618 place count 1325 transition count 2382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 622 place count 1325 transition count 2378
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 734 places in 0 ms
Iterating global reduction 3 with 499 rules applied. Total rules applied 1121 place count 1325 transition count 2387
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1130 place count 1325 transition count 2378
Renaming transitions due to excessive name length > 1024 char.
Discarding 364 places :
Symmetric choice reduction at 4 with 364 rule applications. Total rules 1494 place count 961 transition count 1784
Deduced a syphon composed of 392 places in 0 ms
Iterating global reduction 4 with 364 rules applied. Total rules applied 1858 place count 961 transition count 1784
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1880 place count 961 transition count 1762
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1889 place count 952 transition count 1753
Deduced a syphon composed of 383 places in 1 ms
Iterating global reduction 5 with 9 rules applied. Total rules applied 1898 place count 952 transition count 1753
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -195
Deduced a syphon composed of 412 places in 0 ms
Iterating global reduction 5 with 29 rules applied. Total rules applied 1927 place count 952 transition count 1948
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1944 place count 952 transition count 1931
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 1986 place count 910 transition count 1774
Deduced a syphon composed of 374 places in 0 ms
Iterating global reduction 6 with 42 rules applied. Total rules applied 2028 place count 910 transition count 1774
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2036 place count 910 transition count 1766
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2044 place count 902 transition count 1750
Deduced a syphon composed of 366 places in 1 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2052 place count 902 transition count 1750
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 370 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2056 place count 902 transition count 1786
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2060 place count 898 transition count 1778
Deduced a syphon composed of 366 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2064 place count 898 transition count 1778
Deduced a syphon composed of 366 places in 1 ms
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 7 with 40 rules applied. Total rules applied 2104 place count 898 transition count 1738
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2122 place count 880 transition count 1702
Deduced a syphon composed of 366 places in 0 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2140 place count 880 transition count 1702
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2158 place count 862 transition count 1480
Deduced a syphon composed of 366 places in 0 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2176 place count 862 transition count 1480
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 2203 place count 862 transition count 1453
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2221 place count 844 transition count 1426
Deduced a syphon composed of 348 places in 0 ms
Iterating global reduction 8 with 18 rules applied. Total rules applied 2239 place count 844 transition count 1426
Deduced a syphon composed of 348 places in 0 ms
Applied a total of 2239 rules in 1129 ms. Remains 844 /1912 variables (removed 1068) and now considering 1426/3451 (removed 2025) transitions.
[2023-03-08 20:59:01] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-08 20:59:01] [INFO ] Flow matrix only has 1401 transitions (discarded 25 similar events)
// Phase 1: matrix 1401 rows 844 cols
[2023-03-08 20:59:01] [INFO ] Computed 157 place invariants in 42 ms
[2023-03-08 20:59:02] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 844/1912 places, 1426/3451 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1871 ms. Remains : 844/1912 places, 1426/3451 transitions.
Built C files in :
/tmp/ltsmin2234172859495020213
[2023-03-08 20:59:02] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2234172859495020213
Running compilation step : cd /tmp/ltsmin2234172859495020213;'/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/ltsmin2234172859495020213;'/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/ltsmin2234172859495020213;'/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 1912 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1912/1912 places, 3451/3451 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1911 transition count 3439
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1911 transition count 3439
Applied a total of 2 rules in 115 ms. Remains 1911 /1912 variables (removed 1) and now considering 3439/3451 (removed 12) transitions.
// Phase 1: matrix 3439 rows 1911 cols
[2023-03-08 20:59:05] [INFO ] Computed 157 place invariants in 13 ms
[2023-03-08 20:59:06] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-03-08 20:59:06] [INFO ] Invariant cache hit.
[2023-03-08 20:59:07] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 2187 ms to find 0 implicit places.
[2023-03-08 20:59:07] [INFO ] Invariant cache hit.
[2023-03-08 20:59:09] [INFO ] Dead Transitions using invariants and state equation in 1377 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1911/1912 places, 3439/3451 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3681 ms. Remains : 1911/1912 places, 3439/3451 transitions.
Built C files in :
/tmp/ltsmin4642074067112858155
[2023-03-08 20:59:09] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4642074067112858155
Running compilation step : cd /tmp/ltsmin4642074067112858155;'/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/ltsmin4642074067112858155;'/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/ltsmin4642074067112858155;'/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-08 20:59:12] [INFO ] Flatten gal took : 81 ms
[2023-03-08 20:59:12] [INFO ] Flatten gal took : 81 ms
[2023-03-08 20:59:13] [INFO ] Time to serialize gal into /tmp/LTL8220565156295373115.gal : 924 ms
[2023-03-08 20:59:13] [INFO ] Time to serialize properties into /tmp/LTL7236131801133167903.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/LTL8220565156295373115.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11980854090204032763.hoa' '-atoms' '/tmp/LTL7236131801133167903.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/LTL7236131801133167903.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11980854090204032763.hoa
Detected timeout of ITS tools.
[2023-03-08 20:59:28] [INFO ] Flatten gal took : 76 ms
[2023-03-08 20:59:28] [INFO ] Flatten gal took : 77 ms
[2023-03-08 20:59:28] [INFO ] Time to serialize gal into /tmp/LTL9977473037802712689.gal : 14 ms
[2023-03-08 20:59:28] [INFO ] Time to serialize properties into /tmp/LTL11030156990854886562.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/LTL9977473037802712689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11030156990854886562.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(("((p1065==1)&&(p2104==1))")||(F("(p2043==1)"))))||((F("((p1065==0)||(p2104==0))"))&&(G("((p738==1)&&(p2554==1))"))))))
Formula 0 simplified : X(X(!"((p1065==1)&&(p2104==1))" & G!"(p2043==1)") & (G!"((p1065==0)||(p2104==0))" | F!"((p738==1)&&(p2554==1))"))
Detected timeout of ITS tools.
[2023-03-08 20:59:43] [INFO ] Flatten gal took : 81 ms
[2023-03-08 20:59:43] [INFO ] Applying decomposition
[2023-03-08 20:59:44] [INFO ] Flatten gal took : 69 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/graph11162580936182303505.txt' '-o' '/tmp/graph11162580936182303505.bin' '-w' '/tmp/graph11162580936182303505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11162580936182303505.bin' '-l' '-1' '-v' '-w' '/tmp/graph11162580936182303505.weights' '-q' '0' '-e' '0.001'
[2023-03-08 20:59:44] [INFO ] Decomposing Gal with order
[2023-03-08 20:59:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 20:59:44] [INFO ] Removed a total of 3245 redundant transitions.
[2023-03-08 20:59:44] [INFO ] Flatten gal took : 337 ms
[2023-03-08 20:59:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 50 ms.
[2023-03-08 20:59:45] [INFO ] Time to serialize gal into /tmp/LTL14283795604534331090.gal : 27 ms
[2023-03-08 20:59:45] [INFO ] Time to serialize properties into /tmp/LTL14471685351349080767.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/LTL14283795604534331090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14471685351349080767.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((X(("((i18.u257.p1065==1)&&(i18.u533.p2104==1))")||(F("(i10.u524.p2043==1)"))))||((F("((i18.u257.p1065==0)||(i18.u533.p2104==0))"...211
Formula 0 simplified : X(X(!"((i18.u257.p1065==1)&&(i18.u533.p2104==1))" & G!"(i10.u524.p2043==1)") & (G!"((i18.u257.p1065==0)||(i18.u533.p2104==0))" | F!"...199
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15214434183462739622
[2023-03-08 21:00:00] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15214434183462739622
Running compilation step : cd /tmp/ltsmin15214434183462739622;'/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/ltsmin15214434183462739622;'/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/ltsmin15214434183462739622;'/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 DLCround-PT-08b-LTLFireability-03 finished in 132033 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(F(p0))))'
Support contains 4 out of 1943 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1928 transition count 3456
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1928 transition count 3456
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 1922 transition count 3450
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 1922 transition count 3450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1920 transition count 3448
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1920 transition count 3448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1918 transition count 3446
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1918 transition count 3446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1916 transition count 3444
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1916 transition count 3444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1914 transition count 3442
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1914 transition count 3442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1913 transition count 3441
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1913 transition count 3441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1912 transition count 3440
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1912 transition count 3440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1911 transition count 3439
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1911 transition count 3439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1910 transition count 3438
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1910 transition count 3438
Applied a total of 66 rules in 574 ms. Remains 1910 /1943 variables (removed 33) and now considering 3438/3526 (removed 88) transitions.
// Phase 1: matrix 3438 rows 1910 cols
[2023-03-08 21:00:03] [INFO ] Computed 157 place invariants in 15 ms
[2023-03-08 21:00:04] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-08 21:00:04] [INFO ] Invariant cache hit.
[2023-03-08 21:00:05] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
[2023-03-08 21:00:05] [INFO ] Invariant cache hit.
[2023-03-08 21:00:07] [INFO ] Dead Transitions using invariants and state equation in 1462 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1910/1943 places, 3438/3526 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4123 ms. Remains : 1910/1943 places, 3438/3526 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s630 1) (NEQ s1320 1) (AND (EQ s83 1) (EQ s1211 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 968 ms.
Product exploration explored 100000 steps with 33333 reset in 965 ms.
Computed a total of 309 stabilizing places and 309 stable transitions
Computed a total of 309 stabilizing places and 309 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 445 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-08b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-08b-LTLFireability-05 finished in 6716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1||X(((X(p1) U (!p2&&X(p2))) U (p1&&(X(p1) U (!p2&&X(p2))))))))))'
Support contains 4 out of 1943 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1930 transition count 3469
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1930 transition count 3469
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 1924 transition count 3463
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 1924 transition count 3463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1922 transition count 3461
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1922 transition count 3461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1920 transition count 3459
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1920 transition count 3459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1918 transition count 3457
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1918 transition count 3457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1916 transition count 3455
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1916 transition count 3455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1915 transition count 3454
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1915 transition count 3454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1914 transition count 3453
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1914 transition count 3453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1913 transition count 3452
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1913 transition count 3452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1912 transition count 3451
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1912 transition count 3451
Applied a total of 62 rules in 592 ms. Remains 1912 /1943 variables (removed 31) and now considering 3451/3526 (removed 75) transitions.
// Phase 1: matrix 3451 rows 1912 cols
[2023-03-08 21:00:10] [INFO ] Computed 157 place invariants in 8 ms
[2023-03-08 21:00:11] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-08 21:00:11] [INFO ] Invariant cache hit.
[2023-03-08 21:00:12] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 2073 ms to find 0 implicit places.
[2023-03-08 21:00:12] [INFO ] Invariant cache hit.
[2023-03-08 21:00:13] [INFO ] Dead Transitions using invariants and state equation in 1350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1912/1943 places, 3451/3526 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4019 ms. Remains : 1912/1943 places, 3451/3526 transitions.
Stuttering acceptance computed with spot in 1810 ms :[(NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=(OR (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 10}, { cond=(AND p0 p2), acceptance={} source=3 dest: 11}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 12}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 13}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 14}], [{ cond=(NOT p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 2}], [{ cond=(NOT p1), acceptance={} source=9 dest: 1}, { cond=(NOT p1), acceptance={} source=9 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=10 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 2}], [{ cond=(NOT p2), acceptance={} source=12 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 12}], [{ cond=(NOT p2), acceptance={} source=13 dest: 8}, { cond=p2, acceptance={} source=13 dest: 9}, { cond=(AND p1 (NOT p2)), acceptance={} source=13 dest: 12}, { cond=(AND p1 p2), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=14 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=14 dest: 10}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=14 dest: 12}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(EQ s267 1), p1:(EQ s575 1), p2:(AND (EQ s801 1) (EQ s1862 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-06 finished in 5881 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 1 out of 1943 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Graph (trivial) has 1724 edges and 1943 vertex of which 485 / 1943 are part of one of the 40 SCC in 2 ms
Free SCC test removed 445 places
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 311 place count 1497 transition count 2735
Reduce places removed 310 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 349 rules applied. Total rules applied 660 place count 1187 transition count 2696
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 686 place count 1161 transition count 2696
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 686 place count 1161 transition count 2541
Deduced a syphon composed of 155 places in 8 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 996 place count 1006 transition count 2541
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 1065 place count 937 transition count 2022
Iterating global reduction 3 with 69 rules applied. Total rules applied 1134 place count 937 transition count 2022
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1138 place count 937 transition count 2018
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1138 place count 937 transition count 2015
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1144 place count 934 transition count 2015
Performed 356 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 356 places in 0 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 4 with 712 rules applied. Total rules applied 1856 place count 578 transition count 1650
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1865 place count 578 transition count 1641
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1890 place count 553 transition count 1353
Iterating global reduction 5 with 25 rules applied. Total rules applied 1915 place count 553 transition count 1353
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1937 place count 553 transition count 1331
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1961 place count 541 transition count 1430
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1965 place count 541 transition count 1426
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1969 place count 537 transition count 1350
Iterating global reduction 7 with 4 rules applied. Total rules applied 1973 place count 537 transition count 1350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1977 place count 537 transition count 1346
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1985 place count 533 transition count 1376
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 2022 place count 533 transition count 1339
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2040 place count 515 transition count 1303
Iterating global reduction 8 with 18 rules applied. Total rules applied 2058 place count 515 transition count 1303
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2076 place count 497 transition count 1083
Iterating global reduction 8 with 18 rules applied. Total rules applied 2094 place count 497 transition count 1083
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2112 place count 497 transition count 1065
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2113 place count 496 transition count 1064
Applied a total of 2113 rules in 265 ms. Remains 496 /1943 variables (removed 1447) and now considering 1064/3526 (removed 2462) transitions.
[2023-03-08 21:00:16] [INFO ] Flow matrix only has 1038 transitions (discarded 26 similar events)
// Phase 1: matrix 1038 rows 496 cols
[2023-03-08 21:00:16] [INFO ] Computed 157 place invariants in 13 ms
[2023-03-08 21:00:16] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-08 21:00:16] [INFO ] Flow matrix only has 1038 transitions (discarded 26 similar events)
[2023-03-08 21:00:16] [INFO ] Invariant cache hit.
[2023-03-08 21:00:16] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 21:00:16] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2023-03-08 21:00:16] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 21:00:16] [INFO ] Flow matrix only has 1038 transitions (discarded 26 similar events)
[2023-03-08 21:00:16] [INFO ] Invariant cache hit.
[2023-03-08 21:00:17] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1943 places, 1064/3526 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1460 ms. Remains : 496/1943 places, 1064/3526 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-07 finished in 1506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1943 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Graph (trivial) has 1724 edges and 1943 vertex of which 485 / 1943 are part of one of the 40 SCC in 1 ms
Free SCC test removed 445 places
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 312 place count 1497 transition count 2734
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 350 rules applied. Total rules applied 662 place count 1186 transition count 2695
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 688 place count 1160 transition count 2695
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 688 place count 1160 transition count 2541
Deduced a syphon composed of 154 places in 9 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 996 place count 1006 transition count 2541
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 1065 place count 937 transition count 2022
Iterating global reduction 3 with 69 rules applied. Total rules applied 1134 place count 937 transition count 2022
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1138 place count 937 transition count 2018
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1138 place count 937 transition count 2016
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1142 place count 935 transition count 2016
Performed 357 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 4 with 714 rules applied. Total rules applied 1856 place count 578 transition count 1650
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1865 place count 578 transition count 1641
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1890 place count 553 transition count 1353
Iterating global reduction 5 with 25 rules applied. Total rules applied 1915 place count 553 transition count 1353
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1937 place count 553 transition count 1331
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1961 place count 541 transition count 1430
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1965 place count 541 transition count 1426
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1969 place count 537 transition count 1350
Iterating global reduction 7 with 4 rules applied. Total rules applied 1973 place count 537 transition count 1350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1977 place count 537 transition count 1346
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1985 place count 533 transition count 1376
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 2022 place count 533 transition count 1339
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2040 place count 515 transition count 1303
Iterating global reduction 8 with 18 rules applied. Total rules applied 2058 place count 515 transition count 1303
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2076 place count 497 transition count 1083
Iterating global reduction 8 with 18 rules applied. Total rules applied 2094 place count 497 transition count 1083
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2112 place count 497 transition count 1065
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2113 place count 496 transition count 1064
Applied a total of 2113 rules in 259 ms. Remains 496 /1943 variables (removed 1447) and now considering 1064/3526 (removed 2462) transitions.
[2023-03-08 21:00:17] [INFO ] Flow matrix only has 1038 transitions (discarded 26 similar events)
// Phase 1: matrix 1038 rows 496 cols
[2023-03-08 21:00:17] [INFO ] Computed 157 place invariants in 2 ms
[2023-03-08 21:00:17] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-08 21:00:17] [INFO ] Flow matrix only has 1038 transitions (discarded 26 similar events)
[2023-03-08 21:00:17] [INFO ] Invariant cache hit.
[2023-03-08 21:00:18] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 21:00:18] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2023-03-08 21:00:18] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-08 21:00:18] [INFO ] Flow matrix only has 1038 transitions (discarded 26 similar events)
[2023-03-08 21:00:18] [INFO ] Invariant cache hit.
[2023-03-08 21:00:18] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1943 places, 1064/3526 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1308 ms. Remains : 496/1943 places, 1064/3526 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s342 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 694 steps with 0 reset in 18 ms.
FORMULA DLCround-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-08 finished in 1404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(!p1)))'
Support contains 4 out of 1943 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Graph (trivial) has 1722 edges and 1943 vertex of which 485 / 1943 are part of one of the 40 SCC in 1 ms
Free SCC test removed 445 places
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 312 place count 1497 transition count 2734
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 350 rules applied. Total rules applied 662 place count 1186 transition count 2695
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 688 place count 1160 transition count 2695
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 688 place count 1160 transition count 2541
Deduced a syphon composed of 154 places in 8 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 996 place count 1006 transition count 2541
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 1065 place count 937 transition count 2033
Iterating global reduction 3 with 69 rules applied. Total rules applied 1134 place count 937 transition count 2033
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1138 place count 937 transition count 2029
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1138 place count 937 transition count 2026
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1144 place count 934 transition count 2026
Performed 355 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 4 with 710 rules applied. Total rules applied 1854 place count 579 transition count 1663
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1863 place count 579 transition count 1654
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1887 place count 555 transition count 1378
Iterating global reduction 5 with 24 rules applied. Total rules applied 1911 place count 555 transition count 1378
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1932 place count 555 transition count 1357
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1956 place count 543 transition count 1456
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1960 place count 543 transition count 1452
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1964 place count 539 transition count 1376
Iterating global reduction 7 with 4 rules applied. Total rules applied 1968 place count 539 transition count 1376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1972 place count 539 transition count 1372
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1980 place count 535 transition count 1402
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 2016 place count 535 transition count 1366
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2033 place count 518 transition count 1332
Iterating global reduction 8 with 17 rules applied. Total rules applied 2050 place count 518 transition count 1332
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2067 place count 501 transition count 1124
Iterating global reduction 8 with 17 rules applied. Total rules applied 2084 place count 501 transition count 1124
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 2101 place count 501 transition count 1107
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2102 place count 501 transition count 1107
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2103 place count 501 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2104 place count 500 transition count 1104
Iterating global reduction 9 with 1 rules applied. Total rules applied 2105 place count 500 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2106 place count 499 transition count 1092
Iterating global reduction 9 with 1 rules applied. Total rules applied 2107 place count 499 transition count 1092
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2108 place count 499 transition count 1091
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2109 place count 498 transition count 1090
Applied a total of 2109 rules in 299 ms. Remains 498 /1943 variables (removed 1445) and now considering 1090/3526 (removed 2436) transitions.
[2023-03-08 21:00:18] [INFO ] Flow matrix only has 1064 transitions (discarded 26 similar events)
// Phase 1: matrix 1064 rows 498 cols
[2023-03-08 21:00:19] [INFO ] Computed 157 place invariants in 6 ms
[2023-03-08 21:00:19] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-08 21:00:19] [INFO ] Flow matrix only has 1064 transitions (discarded 26 similar events)
[2023-03-08 21:00:19] [INFO ] Invariant cache hit.
[2023-03-08 21:00:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 21:00:19] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2023-03-08 21:00:19] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-08 21:00:19] [INFO ] Flow matrix only has 1064 transitions (discarded 26 similar events)
[2023-03-08 21:00:19] [INFO ] Invariant cache hit.
[2023-03-08 21:00:20] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/1943 places, 1090/3526 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1333 ms. Remains : 498/1943 places, 1090/3526 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s34 1) (EQ s347 1)), p1:(AND (EQ s61 1) (EQ s473 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 5 ms.
FORMULA DLCround-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-09 finished in 1544 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 U p1) U (p2&&X(G(!p0)))))))'
Support contains 5 out of 1943 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Graph (trivial) has 1720 edges and 1943 vertex of which 485 / 1943 are part of one of the 40 SCC in 1 ms
Free SCC test removed 445 places
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 311 place count 1497 transition count 2735
Reduce places removed 310 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 349 rules applied. Total rules applied 660 place count 1187 transition count 2696
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 686 place count 1161 transition count 2696
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 686 place count 1161 transition count 2542
Deduced a syphon composed of 154 places in 9 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 994 place count 1007 transition count 2542
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 1062 place count 939 transition count 2035
Iterating global reduction 3 with 68 rules applied. Total rules applied 1130 place count 939 transition count 2035
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1134 place count 939 transition count 2031
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1134 place count 939 transition count 2029
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1138 place count 937 transition count 2029
Performed 357 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 357 places in 1 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 4 with 714 rules applied. Total rules applied 1852 place count 580 transition count 1663
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1861 place count 580 transition count 1654
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1886 place count 555 transition count 1366
Iterating global reduction 5 with 25 rules applied. Total rules applied 1911 place count 555 transition count 1366
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1933 place count 555 transition count 1344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1957 place count 543 transition count 1450
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1960 place count 543 transition count 1447
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1963 place count 540 transition count 1389
Iterating global reduction 7 with 3 rules applied. Total rules applied 1966 place count 540 transition count 1389
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1969 place count 540 transition count 1386
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1975 place count 537 transition count 1408
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 8 with 44 rules applied. Total rules applied 2019 place count 537 transition count 1364
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2036 place count 520 transition count 1330
Iterating global reduction 8 with 17 rules applied. Total rules applied 2053 place count 520 transition count 1330
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2070 place count 503 transition count 1125
Iterating global reduction 8 with 17 rules applied. Total rules applied 2087 place count 503 transition count 1125
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 2104 place count 503 transition count 1108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2105 place count 502 transition count 1107
Applied a total of 2105 rules in 249 ms. Remains 502 /1943 variables (removed 1441) and now considering 1107/3526 (removed 2419) transitions.
[2023-03-08 21:00:20] [INFO ] Flow matrix only has 1080 transitions (discarded 27 similar events)
// Phase 1: matrix 1080 rows 502 cols
[2023-03-08 21:00:20] [INFO ] Computed 157 place invariants in 4 ms
[2023-03-08 21:00:20] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 21:00:20] [INFO ] Flow matrix only has 1080 transitions (discarded 27 similar events)
[2023-03-08 21:00:20] [INFO ] Invariant cache hit.
[2023-03-08 21:00:20] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 21:00:21] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-08 21:00:21] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-08 21:00:21] [INFO ] Flow matrix only has 1080 transitions (discarded 27 similar events)
[2023-03-08 21:00:21] [INFO ] Invariant cache hit.
[2023-03-08 21:00:21] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 502/1943 places, 1107/3526 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1278 ms. Remains : 502/1943 places, 1107/3526 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p2) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p2) p0), p0, (AND p0 (NOT p1)), p0]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=0 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0, 1} source=0 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=2 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0, 1} source=2 dest: 5}], [{ cond=p0, acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 5}, { cond=(AND p2 p0), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND p2 (NOT p1) p0), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s263 1), p1:(AND (EQ s11 1) (EQ s106 1)), p0:(AND (EQ s28 1) (EQ s303 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-10 finished in 1544 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 1943 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Graph (trivial) has 1720 edges and 1943 vertex of which 471 / 1943 are part of one of the 41 SCC in 1 ms
Free SCC test removed 430 places
Ensure Unique test removed 462 transitions
Reduce isomorphic transitions removed 462 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 315 transitions
Trivial Post-agglo rules discarded 315 transitions
Performed 315 trivial Post agglomeration. Transition count delta: 315
Iterating post reduction 0 with 315 rules applied. Total rules applied 316 place count 1512 transition count 2748
Reduce places removed 315 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 354 rules applied. Total rules applied 670 place count 1197 transition count 2709
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 28 rules applied. Total rules applied 698 place count 1171 transition count 2707
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 700 place count 1169 transition count 2707
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 155 Pre rules applied. Total rules applied 700 place count 1169 transition count 2552
Deduced a syphon composed of 155 places in 9 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 4 with 310 rules applied. Total rules applied 1010 place count 1014 transition count 2552
Discarding 67 places :
Symmetric choice reduction at 4 with 67 rule applications. Total rules 1077 place count 947 transition count 2046
Iterating global reduction 4 with 67 rules applied. Total rules applied 1144 place count 947 transition count 2046
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1148 place count 947 transition count 2042
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1148 place count 947 transition count 2039
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1154 place count 944 transition count 2039
Performed 362 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 362 places in 0 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 5 with 724 rules applied. Total rules applied 1878 place count 582 transition count 1668
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1887 place count 582 transition count 1659
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1911 place count 558 transition count 1383
Iterating global reduction 6 with 24 rules applied. Total rules applied 1935 place count 558 transition count 1383
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 1955 place count 558 transition count 1363
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1957 place count 557 transition count 1362
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -112
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1983 place count 544 transition count 1474
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1988 place count 544 transition count 1469
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1992 place count 540 transition count 1393
Iterating global reduction 8 with 4 rules applied. Total rules applied 1996 place count 540 transition count 1393
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2000 place count 540 transition count 1389
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2008 place count 536 transition count 1419
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 9 with 35 rules applied. Total rules applied 2043 place count 536 transition count 1384
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 2059 place count 520 transition count 1352
Iterating global reduction 9 with 16 rules applied. Total rules applied 2075 place count 520 transition count 1352
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 2091 place count 504 transition count 1156
Iterating global reduction 9 with 16 rules applied. Total rules applied 2107 place count 504 transition count 1156
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 2123 place count 504 transition count 1140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2124 place count 503 transition count 1139
Applied a total of 2124 rules in 262 ms. Remains 503 /1943 variables (removed 1440) and now considering 1139/3526 (removed 2387) transitions.
[2023-03-08 21:00:22] [INFO ] Flow matrix only has 1110 transitions (discarded 29 similar events)
// Phase 1: matrix 1110 rows 503 cols
[2023-03-08 21:00:22] [INFO ] Computed 157 place invariants in 5 ms
[2023-03-08 21:00:22] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-08 21:00:22] [INFO ] Flow matrix only has 1110 transitions (discarded 29 similar events)
[2023-03-08 21:00:22] [INFO ] Invariant cache hit.
[2023-03-08 21:00:22] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 21:00:22] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2023-03-08 21:00:22] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-08 21:00:22] [INFO ] Flow matrix only has 1110 transitions (discarded 29 similar events)
[2023-03-08 21:00:22] [INFO ] Invariant cache hit.
[2023-03-08 21:00:23] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1943 places, 1139/3526 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1307 ms. Remains : 503/1943 places, 1139/3526 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-11 finished in 1388 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)))'
Support contains 1 out of 1943 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1928 transition count 3456
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1928 transition count 3456
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 1922 transition count 3450
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 1922 transition count 3450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1920 transition count 3448
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1920 transition count 3448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1918 transition count 3446
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1918 transition count 3446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1916 transition count 3444
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1916 transition count 3444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1914 transition count 3442
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1914 transition count 3442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1913 transition count 3441
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1913 transition count 3441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1912 transition count 3440
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1912 transition count 3440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1911 transition count 3439
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1911 transition count 3439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1910 transition count 3438
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1910 transition count 3438
Applied a total of 66 rules in 574 ms. Remains 1910 /1943 variables (removed 33) and now considering 3438/3526 (removed 88) transitions.
// Phase 1: matrix 3438 rows 1910 cols
[2023-03-08 21:00:23] [INFO ] Computed 157 place invariants in 12 ms
[2023-03-08 21:00:24] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-08 21:00:24] [INFO ] Invariant cache hit.
[2023-03-08 21:00:25] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
[2023-03-08 21:00:25] [INFO ] Invariant cache hit.
[2023-03-08 21:00:27] [INFO ] Dead Transitions using invariants and state equation in 1335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1910/1943 places, 3438/3526 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3990 ms. Remains : 1910/1943 places, 3438/3526 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s696 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 12 reset in 514 ms.
Product exploration explored 100000 steps with 14 reset in 600 ms.
Computed a total of 309 stabilizing places and 309 stable transitions
Computed a total of 309 stabilizing places and 309 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 598651 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598651 steps, saw 591719 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 21:00:31] [INFO ] Invariant cache hit.
[2023-03-08 21:00:31] [INFO ] [Real]Absence check using 157 positive place invariants in 101 ms returned sat
[2023-03-08 21:00:32] [INFO ] After 982ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 21:00:33] [INFO ] After 1256ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-08 21:00:33] [INFO ] After 1665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=97 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-08 21:00:33] [INFO ] Invariant cache hit.
[2023-03-08 21:00:34] [INFO ] [Real]Absence check using 157 positive place invariants in 55 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-08b-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-08b-LTLFireability-12 finished in 11788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1943 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1943/1943 places, 3526/3526 transitions.
Graph (trivial) has 1724 edges and 1943 vertex of which 485 / 1943 are part of one of the 40 SCC in 0 ms
Free SCC test removed 445 places
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 311 place count 1497 transition count 2735
Reduce places removed 310 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 349 rules applied. Total rules applied 660 place count 1187 transition count 2696
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 686 place count 1161 transition count 2696
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 686 place count 1161 transition count 2541
Deduced a syphon composed of 155 places in 10 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 996 place count 1006 transition count 2541
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 1065 place count 937 transition count 2022
Iterating global reduction 3 with 69 rules applied. Total rules applied 1134 place count 937 transition count 2022
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1138 place count 937 transition count 2018
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1138 place count 937 transition count 2015
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1144 place count 934 transition count 2015
Performed 356 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 356 places in 0 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 4 with 712 rules applied. Total rules applied 1856 place count 578 transition count 1650
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1865 place count 578 transition count 1641
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1890 place count 553 transition count 1353
Iterating global reduction 5 with 25 rules applied. Total rules applied 1915 place count 553 transition count 1353
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1937 place count 553 transition count 1331
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1961 place count 541 transition count 1430
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1965 place count 541 transition count 1426
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1969 place count 537 transition count 1350
Iterating global reduction 7 with 4 rules applied. Total rules applied 1973 place count 537 transition count 1350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1977 place count 537 transition count 1346
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1985 place count 533 transition count 1376
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 2022 place count 533 transition count 1339
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2040 place count 515 transition count 1303
Iterating global reduction 8 with 18 rules applied. Total rules applied 2058 place count 515 transition count 1303
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2076 place count 497 transition count 1083
Iterating global reduction 8 with 18 rules applied. Total rules applied 2094 place count 497 transition count 1083
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2112 place count 497 transition count 1065
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2113 place count 496 transition count 1064
Applied a total of 2113 rules in 270 ms. Remains 496 /1943 variables (removed 1447) and now considering 1064/3526 (removed 2462) transitions.
[2023-03-08 21:00:35] [INFO ] Flow matrix only has 1038 transitions (discarded 26 similar events)
// Phase 1: matrix 1038 rows 496 cols
[2023-03-08 21:00:35] [INFO ] Computed 157 place invariants in 5 ms
[2023-03-08 21:00:35] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-08 21:00:35] [INFO ] Flow matrix only has 1038 transitions (discarded 26 similar events)
[2023-03-08 21:00:35] [INFO ] Invariant cache hit.
[2023-03-08 21:00:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 21:00:35] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2023-03-08 21:00:35] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-08 21:00:35] [INFO ] Flow matrix only has 1038 transitions (discarded 26 similar events)
[2023-03-08 21:00:35] [INFO ] Invariant cache hit.
[2023-03-08 21:00:36] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1943 places, 1064/3526 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1332 ms. Remains : 496/1943 places, 1064/3526 transitions.
Stuttering acceptance computed with spot in 676 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-14 finished in 2024 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((p0||F(p1)))||(F(p2)&&G(p3)))))'
[2023-03-08 21:00:37] [INFO ] Flatten gal took : 78 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin606533129741877020
[2023-03-08 21:00:37] [INFO ] Too many transitions (3526) to apply POR reductions. Disabling POR matrices.
[2023-03-08 21:00:37] [INFO ] Applying decomposition
[2023-03-08 21:00:37] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin606533129741877020
Running compilation step : cd /tmp/ltsmin606533129741877020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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-08 21:00:37] [INFO ] Flatten gal took : 100 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/graph15348412230574519911.txt' '-o' '/tmp/graph15348412230574519911.bin' '-w' '/tmp/graph15348412230574519911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15348412230574519911.bin' '-l' '-1' '-v' '-w' '/tmp/graph15348412230574519911.weights' '-q' '0' '-e' '0.001'
[2023-03-08 21:00:37] [INFO ] Decomposing Gal with order
[2023-03-08 21:00:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 21:00:37] [INFO ] Removed a total of 3347 redundant transitions.
[2023-03-08 21:00:37] [INFO ] Flatten gal took : 131 ms
[2023-03-08 21:00:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 31 ms.
[2023-03-08 21:00:38] [INFO ] Time to serialize gal into /tmp/LTLFireability18341987035775880124.gal : 19 ms
[2023-03-08 21:00:38] [INFO ] Time to serialize properties into /tmp/LTLFireability3645928412527459714.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/LTLFireability18341987035775880124.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3645928412527459714.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...277
Read 1 LTL properties
Checking formula 0 : !((X((X(("((i12.u255.p1065==1)&&(i12.u533.p2104==1))")||(F("(i11.u523.p2043==1)"))))||((F("((i12.u255.p1065==0)||(i12.u533.p2104==0))"...209
Formula 0 simplified : X(X(!"((i12.u255.p1065==1)&&(i12.u533.p2104==1))" & G!"(i11.u523.p2043==1)") & (G!"((i12.u255.p1065==0)||(i12.u533.p2104==0))" | F!"...197
Compilation finished in 8660 ms.
Running link step : cd /tmp/ltsmin606533129741877020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin606533129741877020;'/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(((LTLAPp0==true)||<>((LTLAPp1==true))))||(<>((LTLAPp2==true))&&[]((LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 2970 ms.
FORMULA DLCround-PT-08b-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 213734 ms.

BK_STOP 1678309250521

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DLCround-PT-08b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475700708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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