Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r131-smll-171624288400108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DLCround-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288400108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 13 13:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 13:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 813K May 18 16:42 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-06b-LTLFireability-00
FORMULA_NAME DLCround-PT-06b-LTLFireability-01
FORMULA_NAME DLCround-PT-06b-LTLFireability-02
FORMULA_NAME DLCround-PT-06b-LTLFireability-03
FORMULA_NAME DLCround-PT-06b-LTLFireability-04
FORMULA_NAME DLCround-PT-06b-LTLFireability-05
FORMULA_NAME DLCround-PT-06b-LTLFireability-06
FORMULA_NAME DLCround-PT-06b-LTLFireability-07
FORMULA_NAME DLCround-PT-06b-LTLFireability-08
FORMULA_NAME DLCround-PT-06b-LTLFireability-09
FORMULA_NAME DLCround-PT-06b-LTLFireability-10
FORMULA_NAME DLCround-PT-06b-LTLFireability-11
FORMULA_NAME DLCround-PT-06b-LTLFireability-12
FORMULA_NAME DLCround-PT-06b-LTLFireability-13
FORMULA_NAME DLCround-PT-06b-LTLFireability-14
FORMULA_NAME DLCround-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716393824820

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-06b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 16:03:47] [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]
[2024-05-22 16:03:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:03:48] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2024-05-22 16:03:48] [INFO ] Transformed 2340 places.
[2024-05-22 16:03:48] [INFO ] Transformed 3456 transitions.
[2024-05-22 16:03:48] [INFO ] Found NUPN structural information;
[2024-05-22 16:03:48] [INFO ] Parsed PT model containing 2340 places and 3456 transitions and 9288 arcs in 482 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DLCround-PT-06b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 2340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Discarding 405 places :
Symmetric choice reduction at 0 with 405 rule applications. Total rules 405 place count 1935 transition count 3051
Iterating global reduction 0 with 405 rules applied. Total rules applied 810 place count 1935 transition count 3051
Discarding 320 places :
Symmetric choice reduction at 0 with 320 rule applications. Total rules 1130 place count 1615 transition count 2731
Iterating global reduction 0 with 320 rules applied. Total rules applied 1450 place count 1615 transition count 2731
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 1457 place count 1615 transition count 2724
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 1507 place count 1565 transition count 2625
Iterating global reduction 1 with 50 rules applied. Total rules applied 1557 place count 1565 transition count 2625
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 1589 place count 1533 transition count 2593
Iterating global reduction 1 with 32 rules applied. Total rules applied 1621 place count 1533 transition count 2593
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1625 place count 1533 transition count 2589
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1642 place count 1516 transition count 2572
Iterating global reduction 2 with 17 rules applied. Total rules applied 1659 place count 1516 transition count 2572
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1675 place count 1500 transition count 2556
Iterating global reduction 2 with 16 rules applied. Total rules applied 1691 place count 1500 transition count 2556
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1707 place count 1484 transition count 2540
Iterating global reduction 2 with 16 rules applied. Total rules applied 1723 place count 1484 transition count 2540
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1733 place count 1474 transition count 2530
Iterating global reduction 2 with 10 rules applied. Total rules applied 1743 place count 1474 transition count 2530
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1749 place count 1468 transition count 2524
Iterating global reduction 2 with 6 rules applied. Total rules applied 1755 place count 1468 transition count 2524
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1761 place count 1462 transition count 2518
Iterating global reduction 2 with 6 rules applied. Total rules applied 1767 place count 1462 transition count 2518
Applied a total of 1767 rules in 1586 ms. Remains 1462 /2340 variables (removed 878) and now considering 2518/3456 (removed 938) transitions.
// Phase 1: matrix 2518 rows 1462 cols
[2024-05-22 16:03:50] [INFO ] Computed 109 invariants in 50 ms
[2024-05-22 16:03:51] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-22 16:03:51] [INFO ] Invariant cache hit.
[2024-05-22 16:03:53] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 2991 ms to find 0 implicit places.
[2024-05-22 16:03:53] [INFO ] Invariant cache hit.
[2024-05-22 16:03:55] [INFO ] Dead Transitions using invariants and state equation in 2210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1462/2340 places, 2518/3456 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6796 ms. Remains : 1462/2340 places, 2518/3456 transitions.
Support contains 48 out of 1462 places after structural reductions.
[2024-05-22 16:03:55] [INFO ] Flatten gal took : 367 ms
[2024-05-22 16:03:56] [INFO ] Flatten gal took : 207 ms
[2024-05-22 16:03:56] [INFO ] Input system was already deterministic with 2518 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1016 ms. (steps per millisecond=9 ) properties (out of 35) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-22 16:03:57] [INFO ] Invariant cache hit.
[2024-05-22 16:03:58] [INFO ] [Real]Absence check using 109 positive place invariants in 122 ms returned sat
[2024-05-22 16:04:00] [INFO ] After 2972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 16:04:01] [INFO ] [Nat]Absence check using 109 positive place invariants in 100 ms returned sat
[2024-05-22 16:04:03] [INFO ] After 1954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 16:04:05] [INFO ] After 3374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 719 ms.
[2024-05-22 16:04:05] [INFO ] After 4994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 6 properties in 80 ms.
Support contains 2 out of 1462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Graph (trivial) has 1324 edges and 1462 vertex of which 391 / 1462 are part of one of the 32 SCC in 10 ms
Free SCC test removed 359 places
Drop transitions removed 409 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 420 transitions.
Drop transitions removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 0 with 249 rules applied. Total rules applied 250 place count 1103 transition count 1849
Reduce places removed 249 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 282 rules applied. Total rules applied 532 place count 854 transition count 1816
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 554 place count 832 transition count 1816
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 554 place count 832 transition count 1708
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 770 place count 724 transition count 1708
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 825 place count 669 transition count 1383
Iterating global reduction 3 with 55 rules applied. Total rules applied 880 place count 669 transition count 1383
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 883 place count 669 transition count 1380
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 883 place count 669 transition count 1377
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 889 place count 666 transition count 1377
Performed 251 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 251 places in 0 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 4 with 502 rules applied. Total rules applied 1391 place count 415 transition count 1119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1398 place count 415 transition count 1112
Renaming transitions due to excessive name length > 1024 char.
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1418 place count 395 transition count 927
Iterating global reduction 5 with 20 rules applied. Total rules applied 1438 place count 395 transition count 927
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1457 place count 395 transition count 908
Performed 36 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 1529 place count 359 transition count 1196
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1542 place count 359 transition count 1183
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 1559 place count 342 transition count 862
Iterating global reduction 7 with 17 rules applied. Total rules applied 1576 place count 342 transition count 862
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 1618 place count 342 transition count 820
Drop transitions removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 8 with 90 rules applied. Total rules applied 1708 place count 342 transition count 730
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1715 place count 335 transition count 659
Iterating global reduction 8 with 7 rules applied. Total rules applied 1722 place count 335 transition count 659
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1729 place count 335 transition count 652
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 9 with 8 rules applied. Total rules applied 1737 place count 331 transition count 679
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1742 place count 331 transition count 674
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 1764 place count 331 transition count 652
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 10 with 8 rules applied. Total rules applied 1772 place count 327 transition count 679
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1778 place count 327 transition count 673
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 1799 place count 327 transition count 652
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 11 with 8 rules applied. Total rules applied 1807 place count 323 transition count 679
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1813 place count 323 transition count 673
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1834 place count 323 transition count 652
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1842 place count 319 transition count 679
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1848 place count 319 transition count 673
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1869 place count 319 transition count 652
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 1877 place count 315 transition count 679
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1883 place count 315 transition count 673
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1904 place count 315 transition count 652
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 14 with 8 rules applied. Total rules applied 1912 place count 311 transition count 679
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1918 place count 311 transition count 673
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1939 place count 311 transition count 652
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 15 with 8 rules applied. Total rules applied 1947 place count 307 transition count 679
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1953 place count 307 transition count 673
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1974 place count 307 transition count 652
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 16 with 8 rules applied. Total rules applied 1982 place count 303 transition count 679
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1988 place count 303 transition count 673
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 2009 place count 303 transition count 652
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 17 with 8 rules applied. Total rules applied 2017 place count 299 transition count 679
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2023 place count 299 transition count 673
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 2044 place count 299 transition count 652
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 18 with 8 rules applied. Total rules applied 2052 place count 295 transition count 679
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2058 place count 295 transition count 673
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2079 place count 295 transition count 652
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 2087 place count 291 transition count 679
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2093 place count 291 transition count 673
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2114 place count 291 transition count 652
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2122 place count 287 transition count 683
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2128 place count 287 transition count 677
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2149 place count 287 transition count 656
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2157 place count 283 transition count 687
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2163 place count 283 transition count 681
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2184 place count 283 transition count 660
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 22 with 8 rules applied. Total rules applied 2192 place count 279 transition count 679
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 2196 place count 279 transition count 675
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 23 with 19 rules applied. Total rules applied 2215 place count 279 transition count 656
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 23 with 8 rules applied. Total rules applied 2223 place count 275 transition count 675
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 2227 place count 275 transition count 671
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 24 with 19 rules applied. Total rules applied 2246 place count 275 transition count 652
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 24 with 8 rules applied. Total rules applied 2254 place count 271 transition count 671
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 2258 place count 271 transition count 667
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 25 with 19 rules applied. Total rules applied 2277 place count 271 transition count 648
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 25 with 8 rules applied. Total rules applied 2285 place count 267 transition count 667
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 2289 place count 267 transition count 663
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 26 with 19 rules applied. Total rules applied 2308 place count 267 transition count 644
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 2316 place count 263 transition count 663
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 2320 place count 263 transition count 659
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 27 with 19 rules applied. Total rules applied 2339 place count 263 transition count 640
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 2347 place count 259 transition count 659
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 2351 place count 259 transition count 655
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 28 with 19 rules applied. Total rules applied 2370 place count 259 transition count 636
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 2378 place count 255 transition count 655
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2382 place count 255 transition count 651
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 2401 place count 255 transition count 632
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 2409 place count 251 transition count 651
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 2413 place count 251 transition count 647
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 2432 place count 251 transition count 628
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 2440 place count 247 transition count 647
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 2444 place count 247 transition count 643
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 2463 place count 247 transition count 624
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 31 with 8 rules applied. Total rules applied 2471 place count 243 transition count 651
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 2475 place count 243 transition count 647
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 2494 place count 243 transition count 628
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 2496 place count 242 transition count 632
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 2497 place count 242 transition count 631
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 33 with 2 rules applied. Total rules applied 2499 place count 242 transition count 629
Free-agglomeration rule applied 28 times with reduction of 1 identical transitions.
Iterating global reduction 33 with 28 rules applied. Total rules applied 2527 place count 242 transition count 600
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 223 transitions
Reduce isomorphic transitions removed 223 transitions.
Graph (complete) has 616 edges and 214 vertex of which 142 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.1 ms
Discarding 72 places :
Also discarding 0 output transitions
Iterating post reduction 33 with 252 rules applied. Total rules applied 2779 place count 142 transition count 377
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 34 with 72 rules applied. Total rules applied 2851 place count 142 transition count 305
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 35 with 38 rules applied. Total rules applied 2889 place count 142 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 35 with 1 rules applied. Total rules applied 2890 place count 141 transition count 266
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 35 with 6 rules applied. Total rules applied 2896 place count 135 transition count 266
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 36 with 72 rules applied. Total rules applied 2968 place count 87 transition count 242
Drop transitions removed 24 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 36 with 68 rules applied. Total rules applied 3036 place count 87 transition count 174
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 37 with 87 rules applied. Total rules applied 3123 place count 29 transition count 145
Drop transitions removed 48 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 86 transitions.
Graph (trivial) has 10 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 37 with 87 rules applied. Total rules applied 3210 place count 24 transition count 59
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 39 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 38 with 35 rules applied. Total rules applied 3245 place count 12 transition count 25
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3249 place count 12 transition count 21
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 40 with 12 rules applied. Total rules applied 3261 place count 4 transition count 17
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 40 with 12 rules applied. Total rules applied 3273 place count 4 transition count 5
Applied a total of 3273 rules in 1575 ms. Remains 4 /1462 variables (removed 1458) and now considering 5/2518 (removed 2513) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1575 ms. Remains : 4/1462 places, 5/2518 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 225 stabilizing places and 225 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1451 transition count 2489
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1451 transition count 2489
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 1445 transition count 2483
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 1445 transition count 2483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1443 transition count 2481
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1443 transition count 2481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1441 transition count 2479
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1441 transition count 2479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1439 transition count 2477
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1439 transition count 2477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1437 transition count 2475
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1437 transition count 2475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1435 transition count 2473
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1435 transition count 2473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1432 transition count 2470
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Applied a total of 62 rules in 638 ms. Remains 1431 /1462 variables (removed 31) and now considering 2469/2518 (removed 49) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2024-05-22 16:04:08] [INFO ] Computed 109 invariants in 14 ms
[2024-05-22 16:04:09] [INFO ] Implicit Places using invariants in 805 ms returned []
[2024-05-22 16:04:09] [INFO ] Invariant cache hit.
[2024-05-22 16:04:10] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2024-05-22 16:04:10] [INFO ] Invariant cache hit.
[2024-05-22 16:04:13] [INFO ] Dead Transitions using invariants and state equation in 2639 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1431/1462 places, 2469/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5280 ms. Remains : 1431/1462 places, 2469/2518 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 312 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s419 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-00 finished in 5675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 1462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Graph (trivial) has 1321 edges and 1462 vertex of which 391 / 1462 are part of one of the 32 SCC in 4 ms
Free SCC test removed 359 places
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 247 rules applied. Total rules applied 248 place count 1102 transition count 1882
Reduce places removed 247 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 280 rules applied. Total rules applied 528 place count 855 transition count 1849
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 550 place count 833 transition count 1849
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 550 place count 833 transition count 1741
Deduced a syphon composed of 108 places in 12 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 766 place count 725 transition count 1741
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 822 place count 669 transition count 1406
Iterating global reduction 3 with 56 rules applied. Total rules applied 878 place count 669 transition count 1406
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 881 place count 669 transition count 1403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 881 place count 669 transition count 1400
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 887 place count 666 transition count 1400
Performed 249 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 249 places in 1 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 4 with 498 rules applied. Total rules applied 1385 place count 417 transition count 1144
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1392 place count 417 transition count 1137
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1411 place count 398 transition count 962
Iterating global reduction 5 with 19 rules applied. Total rules applied 1430 place count 398 transition count 962
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1448 place count 398 transition count 944
Performed 16 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1480 place count 382 transition count 1069
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1484 place count 378 transition count 1007
Iterating global reduction 6 with 4 rules applied. Total rules applied 1488 place count 378 transition count 1007
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1517 place count 378 transition count 978
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 1547 place count 378 transition count 948
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1561 place count 364 transition count 920
Iterating global reduction 7 with 14 rules applied. Total rules applied 1575 place count 364 transition count 920
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1589 place count 350 transition count 778
Iterating global reduction 7 with 14 rules applied. Total rules applied 1603 place count 350 transition count 778
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1617 place count 350 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1618 place count 349 transition count 763
Applied a total of 1618 rules in 448 ms. Remains 349 /1462 variables (removed 1113) and now considering 763/2518 (removed 1755) transitions.
[2024-05-22 16:04:14] [INFO ] Flow matrix only has 741 transitions (discarded 22 similar events)
// Phase 1: matrix 741 rows 349 cols
[2024-05-22 16:04:14] [INFO ] Computed 109 invariants in 5 ms
[2024-05-22 16:04:14] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-22 16:04:14] [INFO ] Flow matrix only has 741 transitions (discarded 22 similar events)
[2024-05-22 16:04:14] [INFO ] Invariant cache hit.
[2024-05-22 16:04:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:04:15] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2024-05-22 16:04:15] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-22 16:04:15] [INFO ] Flow matrix only has 741 transitions (discarded 22 similar events)
[2024-05-22 16:04:15] [INFO ] Invariant cache hit.
[2024-05-22 16:04:16] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 349/1462 places, 763/2518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2394 ms. Remains : 349/1462 places, 763/2518 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s49 1) (EQ s324 1) (EQ s70 1)), p0:(AND (EQ s49 1) (EQ s324 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 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-01 finished in 2495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1)))))'
Support contains 2 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1450 transition count 2488
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1450 transition count 2488
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1444 transition count 2482
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1444 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1442 transition count 2480
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1442 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1440 transition count 2478
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1440 transition count 2478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1438 transition count 2476
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1438 transition count 2476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1436 transition count 2474
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1436 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1434 transition count 2472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1430 transition count 2468
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1430 transition count 2468
Applied a total of 64 rules in 635 ms. Remains 1430 /1462 variables (removed 32) and now considering 2468/2518 (removed 50) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2024-05-22 16:04:16] [INFO ] Computed 109 invariants in 12 ms
[2024-05-22 16:04:17] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-22 16:04:17] [INFO ] Invariant cache hit.
[2024-05-22 16:04:19] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
[2024-05-22 16:04:19] [INFO ] Invariant cache hit.
[2024-05-22 16:04:21] [INFO ] Dead Transitions using invariants and state equation in 1989 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1430/1462 places, 2468/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4901 ms. Remains : 1430/1462 places, 2468/2518 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s284 1), p1:(EQ s196 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-02 finished in 5050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (p1||G(!p0)))))'
Support contains 4 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1450 transition count 2488
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1450 transition count 2488
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1444 transition count 2482
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1444 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1442 transition count 2480
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1442 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1440 transition count 2478
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1440 transition count 2478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1438 transition count 2476
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1438 transition count 2476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1436 transition count 2474
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1436 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1434 transition count 2472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1430 transition count 2468
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1430 transition count 2468
Applied a total of 64 rules in 822 ms. Remains 1430 /1462 variables (removed 32) and now considering 2468/2518 (removed 50) transitions.
[2024-05-22 16:04:22] [INFO ] Invariant cache hit.
[2024-05-22 16:04:22] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-22 16:04:22] [INFO ] Invariant cache hit.
[2024-05-22 16:04:24] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 2008 ms to find 0 implicit places.
[2024-05-22 16:04:24] [INFO ] Invariant cache hit.
[2024-05-22 16:04:25] [INFO ] Dead Transitions using invariants and state equation in 1790 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1430/1462 places, 2468/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4626 ms. Remains : 1430/1462 places, 2468/2518 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (OR (AND (EQ s181 1) (EQ s978 1)) (AND (EQ s457 1) (EQ s1320 1)))) (NOT (AND (EQ s181 1) (EQ s978 1)))), p0:(AND (EQ s181 1) (EQ s978 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2080 ms.
Product exploration explored 100000 steps with 50000 reset in 1682 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-06b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-03 finished in 8656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U ((p1 U p2)||X(F(p3)))))'
Support contains 7 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1452 transition count 2499
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1452 transition count 2499
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 1447 transition count 2494
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 1447 transition count 2494
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1445 transition count 2492
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1445 transition count 2492
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1443 transition count 2490
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1443 transition count 2490
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1441 transition count 2488
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1441 transition count 2488
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1439 transition count 2486
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1439 transition count 2486
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1437 transition count 2484
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1437 transition count 2484
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1435 transition count 2482
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1435 transition count 2482
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1434 transition count 2481
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1434 transition count 2481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1433 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1433 transition count 2480
Applied a total of 58 rules in 880 ms. Remains 1433 /1462 variables (removed 29) and now considering 2480/2518 (removed 38) transitions.
// Phase 1: matrix 2480 rows 1433 cols
[2024-05-22 16:04:30] [INFO ] Computed 109 invariants in 25 ms
[2024-05-22 16:04:31] [INFO ] Implicit Places using invariants in 929 ms returned []
[2024-05-22 16:04:31] [INFO ] Invariant cache hit.
[2024-05-22 16:04:33] [INFO ] Implicit Places using invariants and state equation in 2034 ms returned []
Implicit Place search using SMT with State Equation took 2975 ms to find 0 implicit places.
[2024-05-22 16:04:33] [INFO ] Invariant cache hit.
[2024-05-22 16:04:35] [INFO ] Dead Transitions using invariants and state equation in 2221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1433/1462 places, 2480/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6083 ms. Remains : 1433/1462 places, 2480/2518 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s1119 1) (AND (EQ s683 1) (EQ s1250 1))), p1:(EQ s408 1), p0:(AND (EQ s252 1) (EQ s1191 1)), p3:(EQ s1034 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 131 reset in 454 ms.
Product exploration explored 100000 steps with 129 reset in 659 ms.
Computed a total of 215 stabilizing places and 215 stable transitions
Computed a total of 215 stabilizing places and 215 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) p1 p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 203 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 16 states, 69 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 961 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 18) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2024-05-22 16:04:39] [INFO ] Invariant cache hit.
[2024-05-22 16:04:40] [INFO ] [Real]Absence check using 109 positive place invariants in 86 ms returned sat
[2024-05-22 16:04:40] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-22 16:04:41] [INFO ] [Nat]Absence check using 109 positive place invariants in 98 ms returned sat
[2024-05-22 16:04:43] [INFO ] After 1952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-22 16:04:44] [INFO ] After 3521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 877 ms.
[2024-05-22 16:04:45] [INFO ] After 5362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Finished Parikh walk after 368 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=92 )
Parikh walk visited 11 properties in 201 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) p1 p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2 p3)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND p0 p1 (NOT p2) p3)), (F p3), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (AND p0 p1 (NOT p2) (NOT p3))), (F (AND (NOT p0) p1 (NOT p2) p3)), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (AND (NOT p0) p1 p2 p3)), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (AND p1 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) p2 p3)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (AND p0 p1 p2 p3)), (F (AND p0 p1 p2 (NOT p3)))]
Knowledge based reduction with 13 factoid took 645 ms. Reduced automaton from 16 states, 69 edges and 4 AP (stutter insensitive) to 16 states, 69 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 821 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 908 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
[2024-05-22 16:04:48] [INFO ] Invariant cache hit.
[2024-05-22 16:04:50] [INFO ] [Real]Absence check using 109 positive place invariants in 172 ms returned sat
[2024-05-22 16:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 16:04:55] [INFO ] [Real]Absence check using state equation in 4581 ms returned sat
[2024-05-22 16:04:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:04:57] [INFO ] [Nat]Absence check using 109 positive place invariants in 166 ms returned sat
[2024-05-22 16:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 16:05:01] [INFO ] [Nat]Absence check using state equation in 4371 ms returned sat
[2024-05-22 16:05:02] [INFO ] Computed and/alt/rep : 2318/3950/2318 causal constraints (skipped 161 transitions) in 178 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 16:05:10] [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: Broken pipe ... while checking expression EG (AND (NOT p2) (NOT p3))
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 7 out of 1433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1433/1433 places, 2480/2480 transitions.
Graph (trivial) has 1287 edges and 1433 vertex of which 389 / 1433 are part of one of the 32 SCC in 1 ms
Free SCC test removed 357 places
Ensure Unique test removed 386 transitions
Reduce isomorphic transitions removed 386 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 224 rules applied. Total rules applied 225 place count 1075 transition count 1869
Reduce places removed 224 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 257 rules applied. Total rules applied 482 place count 851 transition count 1836
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 505 place count 829 transition count 1835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 506 place count 828 transition count 1835
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 110 Pre rules applied. Total rules applied 506 place count 828 transition count 1725
Deduced a syphon composed of 110 places in 10 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 726 place count 718 transition count 1725
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 776 place count 668 transition count 1399
Iterating global reduction 4 with 50 rules applied. Total rules applied 826 place count 668 transition count 1399
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 830 place count 668 transition count 1395
Performed 248 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 248 places in 0 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 5 with 496 rules applied. Total rules applied 1326 place count 420 transition count 1142
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1333 place count 420 transition count 1135
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1350 place count 403 transition count 977
Iterating global reduction 6 with 17 rules applied. Total rules applied 1367 place count 403 transition count 977
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1384 place count 403 transition count 960
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1418 place count 386 transition count 1094
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1422 place count 382 transition count 1032
Iterating global reduction 7 with 4 rules applied. Total rules applied 1426 place count 382 transition count 1032
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 1456 place count 382 transition count 1002
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 1488 place count 382 transition count 970
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1500 place count 370 transition count 946
Iterating global reduction 8 with 12 rules applied. Total rules applied 1512 place count 370 transition count 946
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1524 place count 358 transition count 823
Iterating global reduction 8 with 12 rules applied. Total rules applied 1536 place count 358 transition count 823
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1548 place count 358 transition count 811
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1550 place count 358 transition count 811
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1551 place count 358 transition count 810
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1552 place count 357 transition count 808
Iterating global reduction 9 with 1 rules applied. Total rules applied 1553 place count 357 transition count 808
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1554 place count 356 transition count 797
Iterating global reduction 9 with 1 rules applied. Total rules applied 1555 place count 356 transition count 797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1556 place count 356 transition count 796
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1557 place count 355 transition count 795
Applied a total of 1557 rules in 328 ms. Remains 355 /1433 variables (removed 1078) and now considering 795/2480 (removed 1685) transitions.
[2024-05-22 16:05:10] [INFO ] Flow matrix only has 772 transitions (discarded 23 similar events)
// Phase 1: matrix 772 rows 355 cols
[2024-05-22 16:05:10] [INFO ] Computed 109 invariants in 5 ms
[2024-05-22 16:05:10] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-22 16:05:10] [INFO ] Flow matrix only has 772 transitions (discarded 23 similar events)
[2024-05-22 16:05:10] [INFO ] Invariant cache hit.
[2024-05-22 16:05:11] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 16:05:11] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2024-05-22 16:05:11] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-22 16:05:11] [INFO ] Flow matrix only has 772 transitions (discarded 23 similar events)
[2024-05-22 16:05:11] [INFO ] Invariant cache hit.
[2024-05-22 16:05:12] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 355/1433 places, 795/2480 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1837 ms. Remains : 355/1433 places, 795/2480 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT p3)), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 31 factoid took 947 ms. Reduced automaton from 16 states, 69 edges and 4 AP (stutter insensitive) to 16 states, 69 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 774 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
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 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 16:05:14] [INFO ] Flow matrix only has 772 transitions (discarded 23 similar events)
[2024-05-22 16:05:14] [INFO ] Invariant cache hit.
[2024-05-22 16:05:14] [INFO ] [Real]Absence check using 109 positive place invariants in 32 ms returned sat
[2024-05-22 16:05:14] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 16:05:14] [INFO ] [Nat]Absence check using 109 positive place invariants in 28 ms returned sat
[2024-05-22 16:05:15] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 16:05:15] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 16:05:15] [INFO ] After 90ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 16:05:15] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-22 16:05:15] [INFO ] After 777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 23 ms.
Support contains 7 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 795/795 transitions.
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 355 transition count 773
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 36 place count 348 transition count 766
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 341 transition count 694
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 341 transition count 694
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 57 place count 341 transition count 687
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 340 transition count 695
Free-agglomeration rule applied 210 times with reduction of 116 identical transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 269 place count 340 transition count 369
Reduce places removed 214 places and 0 transitions.
Drop transitions removed 229 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 232 transitions.
Graph (complete) has 243 edges and 126 vertex of which 71 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 31 output transitions
Drop transitions removed 31 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 448 rules applied. Total rules applied 717 place count 71 transition count 105
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 739 place count 70 transition count 84
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 770 place count 39 transition count 53
Iterating global reduction 4 with 31 rules applied. Total rules applied 801 place count 39 transition count 53
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 803 place count 39 transition count 51
Applied a total of 803 rules in 68 ms. Remains 39 /355 variables (removed 316) and now considering 51/795 (removed 744) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 39/355 places, 51/795 transitions.
Finished random walk after 612 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=76 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT p3)), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (F (AND p0 (NOT p1) p2 p3)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND p0 p1 (NOT p2) p3)), (F p3), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (AND p0 p1 (NOT p2) (NOT p3))), (F (AND (NOT p0) p1 (NOT p2) p3)), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (AND (NOT p0) p1 p2 p3)), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (AND p1 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) p2 p3)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (AND p0 p1 p2 p3)), (F (AND p0 p1 p2 (NOT p3)))]
Knowledge based reduction with 31 factoid took 1702 ms. Reduced automaton from 16 states, 69 edges and 4 AP (stutter insensitive) to 16 states, 69 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 809 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 813 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
[2024-05-22 16:05:18] [INFO ] Flow matrix only has 772 transitions (discarded 23 similar events)
[2024-05-22 16:05:18] [INFO ] Invariant cache hit.
[2024-05-22 16:05:19] [INFO ] [Real]Absence check using 109 positive place invariants in 49 ms returned sat
[2024-05-22 16:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 16:05:19] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2024-05-22 16:05:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:05:20] [INFO ] [Nat]Absence check using 109 positive place invariants in 51 ms returned sat
[2024-05-22 16:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 16:05:20] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2024-05-22 16:05:20] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 16:05:20] [INFO ] [Nat]Added 46 Read/Feed constraints in 11 ms returned sat
[2024-05-22 16:05:21] [INFO ] Computed and/alt/rep : 494/1239/494 causal constraints (skipped 225 transitions) in 90 ms.
[2024-05-22 16:05:21] [INFO ] Added : 2 causal constraints over 1 iterations in 212 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 875 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-04 finished in 52217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((p1||X(F(p2)))))))'
Support contains 4 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1450 transition count 2488
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1450 transition count 2488
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1444 transition count 2482
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1444 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1442 transition count 2480
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1442 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1440 transition count 2478
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1440 transition count 2478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1438 transition count 2476
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1438 transition count 2476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1436 transition count 2474
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1436 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1434 transition count 2472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1430 transition count 2468
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1430 transition count 2468
Applied a total of 64 rules in 697 ms. Remains 1430 /1462 variables (removed 32) and now considering 2468/2518 (removed 50) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2024-05-22 16:05:22] [INFO ] Computed 109 invariants in 15 ms
[2024-05-22 16:05:23] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-05-22 16:05:23] [INFO ] Invariant cache hit.
[2024-05-22 16:05:25] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2498 ms to find 0 implicit places.
[2024-05-22 16:05:25] [INFO ] Invariant cache hit.
[2024-05-22 16:05:27] [INFO ] Dead Transitions using invariants and state equation in 2256 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1430/1462 places, 2468/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5459 ms. Remains : 1430/1462 places, 2468/2518 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s343 1), p1:(EQ s749 0), p2:(AND (EQ s249 1) (EQ s864 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1413 ms.
Product exploration explored 100000 steps with 33333 reset in 1135 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Detected a total of 213/1430 stabilizing places and 213/2468 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-06b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-05 finished in 8380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0)&&F(p1))||(X(F(p3))&&p2))))'
Support contains 4 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1451 transition count 2489
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1451 transition count 2489
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 1446 transition count 2484
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 1446 transition count 2484
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1444 transition count 2482
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1444 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1442 transition count 2480
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1442 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1440 transition count 2478
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1440 transition count 2478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1438 transition count 2476
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1438 transition count 2476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1436 transition count 2474
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1436 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1433 transition count 2471
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1432 transition count 2470
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1432 transition count 2470
Applied a total of 60 rules in 870 ms. Remains 1432 /1462 variables (removed 30) and now considering 2470/2518 (removed 48) transitions.
// Phase 1: matrix 2470 rows 1432 cols
[2024-05-22 16:05:31] [INFO ] Computed 109 invariants in 8 ms
[2024-05-22 16:05:32] [INFO ] Implicit Places using invariants in 754 ms returned []
[2024-05-22 16:05:32] [INFO ] Invariant cache hit.
[2024-05-22 16:05:33] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2024-05-22 16:05:33] [INFO ] Invariant cache hit.
[2024-05-22 16:05:35] [INFO ] Dead Transitions using invariants and state equation in 2555 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1432/1462 places, 2470/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5353 ms. Remains : 1432/1462 places, 2470/2518 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s394 1) (EQ s1254 1)), p1:(AND (EQ s394 1) (EQ s1254 1)), p0:(EQ s1022 0), p3:(EQ s1392 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 78 reset in 726 ms.
Product exploration explored 100000 steps with 63 reset in 631 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Detected a total of 213/1432 stabilizing places and 213/2470 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 8 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Finished random walk after 7450 steps, including 2 resets, run visited all 1 properties in 41 ms. (steps per millisecond=181 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 131 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 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
[2024-05-22 16:05:38] [INFO ] Invariant cache hit.
[2024-05-22 16:05:39] [INFO ] [Real]Absence check using 109 positive place invariants in 158 ms returned sat
[2024-05-22 16:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 16:05:43] [INFO ] [Real]Absence check using state equation in 4161 ms returned sat
[2024-05-22 16:05:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:05:46] [INFO ] [Nat]Absence check using 109 positive place invariants in 167 ms returned sat
[2024-05-22 16:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 16:05:50] [INFO ] [Nat]Absence check using state equation in 4651 ms returned sat
[2024-05-22 16:05:51] [INFO ] Computed and/alt/rep : 2309/3952/2309 causal constraints (skipped 160 transitions) in 203 ms.
[2024-05-22 16:06:00] [INFO ] Deduced a trap composed of 10 places in 1242 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 16:06:00] [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 2 out of 1432 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1432/1432 places, 2470/2470 transitions.
Graph (trivial) has 1293 edges and 1432 vertex of which 389 / 1432 are part of one of the 32 SCC in 1 ms
Free SCC test removed 357 places
Ensure Unique test removed 386 transitions
Reduce isomorphic transitions removed 386 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 227 place count 1074 transition count 1857
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 259 rules applied. Total rules applied 486 place count 848 transition count 1824
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 508 place count 826 transition count 1824
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 508 place count 826 transition count 1715
Deduced a syphon composed of 109 places in 6 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 726 place count 717 transition count 1715
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 775 place count 668 transition count 1399
Iterating global reduction 3 with 49 rules applied. Total rules applied 824 place count 668 transition count 1399
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 828 place count 668 transition count 1395
Performed 249 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 249 places in 0 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 4 with 498 rules applied. Total rules applied 1326 place count 419 transition count 1139
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1333 place count 419 transition count 1132
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1351 place count 401 transition count 964
Iterating global reduction 5 with 18 rules applied. Total rules applied 1369 place count 401 transition count 964
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1387 place count 401 transition count 946
Performed 21 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1429 place count 380 transition count 1116
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1433 place count 376 transition count 1048
Iterating global reduction 6 with 4 rules applied. Total rules applied 1437 place count 376 transition count 1048
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 1468 place count 376 transition count 1017
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 1509 place count 376 transition count 976
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1522 place count 363 transition count 950
Iterating global reduction 7 with 13 rules applied. Total rules applied 1535 place count 363 transition count 950
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1548 place count 350 transition count 814
Iterating global reduction 7 with 13 rules applied. Total rules applied 1561 place count 350 transition count 814
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1574 place count 350 transition count 801
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1575 place count 349 transition count 800
Applied a total of 1575 rules in 181 ms. Remains 349 /1432 variables (removed 1083) and now considering 800/2470 (removed 1670) transitions.
[2024-05-22 16:06:00] [INFO ] Flow matrix only has 766 transitions (discarded 34 similar events)
// Phase 1: matrix 766 rows 349 cols
[2024-05-22 16:06:00] [INFO ] Computed 109 invariants in 3 ms
[2024-05-22 16:06:00] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-22 16:06:00] [INFO ] Flow matrix only has 766 transitions (discarded 34 similar events)
[2024-05-22 16:06:00] [INFO ] Invariant cache hit.
[2024-05-22 16:06:01] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 16:06:01] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2024-05-22 16:06:01] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-22 16:06:01] [INFO ] Flow matrix only has 766 transitions (discarded 34 similar events)
[2024-05-22 16:06:01] [INFO ] Invariant cache hit.
[2024-05-22 16:06:02] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 349/1432 places, 800/2470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2141 ms. Remains : 349/1432 places, 800/2470 transitions.
Computed a total of 3 stabilizing places and 34 stable transitions
Computed a total of 3 stabilizing places and 34 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 37 ms :[(NOT p1)]
Finished random walk after 79 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 107 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 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
[2024-05-22 16:06:02] [INFO ] Flow matrix only has 766 transitions (discarded 34 similar events)
[2024-05-22 16:06:02] [INFO ] Invariant cache hit.
[2024-05-22 16:06:03] [INFO ] [Real]Absence check using 109 positive place invariants in 66 ms returned sat
[2024-05-22 16:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 16:06:03] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2024-05-22 16:06:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:06:04] [INFO ] [Nat]Absence check using 109 positive place invariants in 50 ms returned sat
[2024-05-22 16:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 16:06:05] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2024-05-22 16:06:05] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 16:06:05] [INFO ] [Nat]Added 51 Read/Feed constraints in 11 ms returned sat
[2024-05-22 16:06:05] [INFO ] Computed and/alt/rep : 455/1112/455 causal constraints (skipped 260 transitions) in 55 ms.
[2024-05-22 16:06:05] [INFO ] Added : 0 causal constraints over 0 iterations in 117 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-06 finished in 34773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 1462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Graph (trivial) has 1322 edges and 1462 vertex of which 385 / 1462 are part of one of the 31 SCC in 1 ms
Free SCC test removed 354 places
Ensure Unique test removed 383 transitions
Reduce isomorphic transitions removed 383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 252 place count 1107 transition count 1883
Reduce places removed 251 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 284 rules applied. Total rules applied 536 place count 856 transition count 1850
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 558 place count 834 transition count 1850
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 558 place count 834 transition count 1741
Deduced a syphon composed of 109 places in 6 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 776 place count 725 transition count 1741
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 831 place count 670 transition count 1416
Iterating global reduction 3 with 55 rules applied. Total rules applied 886 place count 670 transition count 1416
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 889 place count 670 transition count 1413
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 889 place count 670 transition count 1410
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 895 place count 667 transition count 1410
Performed 248 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 248 places in 0 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 4 with 496 rules applied. Total rules applied 1391 place count 419 transition count 1156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1398 place count 419 transition count 1149
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1418 place count 399 transition count 964
Iterating global reduction 5 with 20 rules applied. Total rules applied 1438 place count 399 transition count 964
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1457 place count 399 transition count 945
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1491 place count 382 transition count 1079
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1495 place count 378 transition count 1017
Iterating global reduction 6 with 4 rules applied. Total rules applied 1499 place count 378 transition count 1017
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1528 place count 378 transition count 988
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 1556 place count 378 transition count 960
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1568 place count 366 transition count 936
Iterating global reduction 7 with 12 rules applied. Total rules applied 1580 place count 366 transition count 936
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1592 place count 354 transition count 814
Iterating global reduction 7 with 12 rules applied. Total rules applied 1604 place count 354 transition count 814
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1616 place count 354 transition count 802
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1617 place count 354 transition count 802
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1618 place count 354 transition count 801
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1619 place count 353 transition count 799
Iterating global reduction 8 with 1 rules applied. Total rules applied 1620 place count 353 transition count 799
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1621 place count 352 transition count 789
Iterating global reduction 8 with 1 rules applied. Total rules applied 1622 place count 352 transition count 789
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1623 place count 352 transition count 788
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1624 place count 351 transition count 787
Applied a total of 1624 rules in 247 ms. Remains 351 /1462 variables (removed 1111) and now considering 787/2518 (removed 1731) transitions.
[2024-05-22 16:06:05] [INFO ] Flow matrix only has 765 transitions (discarded 22 similar events)
// Phase 1: matrix 765 rows 351 cols
[2024-05-22 16:06:05] [INFO ] Computed 109 invariants in 3 ms
[2024-05-22 16:06:05] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 16:06:05] [INFO ] Flow matrix only has 765 transitions (discarded 22 similar events)
[2024-05-22 16:06:05] [INFO ] Invariant cache hit.
[2024-05-22 16:06:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:06:06] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2024-05-22 16:06:06] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-22 16:06:06] [INFO ] Flow matrix only has 765 transitions (discarded 22 similar events)
[2024-05-22 16:06:06] [INFO ] Invariant cache hit.
[2024-05-22 16:06:07] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/1462 places, 787/2518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1878 ms. Remains : 351/1462 places, 787/2518 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s49 1) (NOT (AND (EQ s39 1) (EQ s281 1)))), p0:(AND (EQ s39 1) (EQ s281 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-07 finished in 1969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 3 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1451 transition count 2489
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1451 transition count 2489
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 1445 transition count 2483
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 1445 transition count 2483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1443 transition count 2481
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1443 transition count 2481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1441 transition count 2479
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1441 transition count 2479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1439 transition count 2477
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1439 transition count 2477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1437 transition count 2475
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1437 transition count 2475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1435 transition count 2473
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1435 transition count 2473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1432 transition count 2470
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Applied a total of 62 rules in 657 ms. Remains 1431 /1462 variables (removed 31) and now considering 2469/2518 (removed 49) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2024-05-22 16:06:07] [INFO ] Computed 109 invariants in 6 ms
[2024-05-22 16:06:08] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-05-22 16:06:08] [INFO ] Invariant cache hit.
[2024-05-22 16:06:10] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2551 ms to find 0 implicit places.
[2024-05-22 16:06:10] [INFO ] Invariant cache hit.
[2024-05-22 16:06:13] [INFO ] Dead Transitions using invariants and state equation in 2686 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1431/1462 places, 2469/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5896 ms. Remains : 1431/1462 places, 2469/2518 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s670 0) (EQ s1140 0)), p0:(EQ s1146 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6420 steps with 0 reset in 38 ms.
FORMULA DLCround-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-08 finished in 6176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 1462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Graph (trivial) has 1322 edges and 1462 vertex of which 375 / 1462 are part of one of the 33 SCC in 1 ms
Free SCC test removed 342 places
Ensure Unique test removed 368 transitions
Reduce isomorphic transitions removed 368 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 254 place count 1119 transition count 1896
Reduce places removed 253 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 286 rules applied. Total rules applied 540 place count 866 transition count 1863
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 562 place count 844 transition count 1863
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 562 place count 844 transition count 1752
Deduced a syphon composed of 111 places in 6 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 784 place count 733 transition count 1752
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 837 place count 680 transition count 1429
Iterating global reduction 3 with 53 rules applied. Total rules applied 890 place count 680 transition count 1429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 893 place count 680 transition count 1426
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 893 place count 680 transition count 1423
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 899 place count 677 transition count 1423
Performed 254 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 4 with 508 rules applied. Total rules applied 1407 place count 423 transition count 1162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1414 place count 423 transition count 1155
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1432 place count 405 transition count 990
Iterating global reduction 5 with 18 rules applied. Total rules applied 1450 place count 405 transition count 990
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1466 place count 405 transition count 974
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1468 place count 404 transition count 973
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1502 place count 387 transition count 1109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1503 place count 387 transition count 1108
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1507 place count 383 transition count 1046
Iterating global reduction 7 with 4 rules applied. Total rules applied 1511 place count 383 transition count 1046
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1540 place count 383 transition count 1017
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 1568 place count 383 transition count 989
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1580 place count 371 transition count 965
Iterating global reduction 8 with 12 rules applied. Total rules applied 1592 place count 371 transition count 965
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1604 place count 359 transition count 843
Iterating global reduction 8 with 12 rules applied. Total rules applied 1616 place count 359 transition count 843
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1628 place count 359 transition count 831
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1629 place count 358 transition count 830
Applied a total of 1629 rules in 220 ms. Remains 358 /1462 variables (removed 1104) and now considering 830/2518 (removed 1688) transitions.
[2024-05-22 16:06:13] [INFO ] Flow matrix only has 805 transitions (discarded 25 similar events)
// Phase 1: matrix 805 rows 358 cols
[2024-05-22 16:06:13] [INFO ] Computed 109 invariants in 4 ms
[2024-05-22 16:06:14] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-22 16:06:14] [INFO ] Flow matrix only has 805 transitions (discarded 25 similar events)
[2024-05-22 16:06:14] [INFO ] Invariant cache hit.
[2024-05-22 16:06:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 16:06:14] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2024-05-22 16:06:14] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-22 16:06:14] [INFO ] Flow matrix only has 805 transitions (discarded 25 similar events)
[2024-05-22 16:06:14] [INFO ] Invariant cache hit.
[2024-05-22 16:06:15] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/1462 places, 830/2518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2279 ms. Remains : 358/1462 places, 830/2518 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s59 1) (NEQ s201 1)), p1:(NEQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-09 finished in 2412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Graph (trivial) has 1325 edges and 1462 vertex of which 391 / 1462 are part of one of the 32 SCC in 0 ms
Free SCC test removed 359 places
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 0 with 249 rules applied. Total rules applied 250 place count 1102 transition count 1880
Reduce places removed 249 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 282 rules applied. Total rules applied 532 place count 853 transition count 1847
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 554 place count 831 transition count 1847
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 554 place count 831 transition count 1739
Deduced a syphon composed of 108 places in 5 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 770 place count 723 transition count 1739
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 826 place count 667 transition count 1404
Iterating global reduction 3 with 56 rules applied. Total rules applied 882 place count 667 transition count 1404
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 885 place count 667 transition count 1401
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 885 place count 667 transition count 1398
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 891 place count 664 transition count 1398
Performed 247 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 247 places in 0 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 4 with 494 rules applied. Total rules applied 1385 place count 417 transition count 1144
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1392 place count 417 transition count 1137
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1412 place count 397 transition count 952
Iterating global reduction 5 with 20 rules applied. Total rules applied 1432 place count 397 transition count 952
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1451 place count 397 transition count 933
Performed 21 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1493 place count 376 transition count 1094
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1497 place count 372 transition count 1032
Iterating global reduction 6 with 4 rules applied. Total rules applied 1501 place count 372 transition count 1032
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1530 place count 372 transition count 1003
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 7 with 40 rules applied. Total rules applied 1570 place count 372 transition count 963
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1584 place count 358 transition count 935
Iterating global reduction 7 with 14 rules applied. Total rules applied 1598 place count 358 transition count 935
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1612 place count 344 transition count 783
Iterating global reduction 7 with 14 rules applied. Total rules applied 1626 place count 344 transition count 783
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1640 place count 344 transition count 769
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1641 place count 343 transition count 768
Applied a total of 1641 rules in 193 ms. Remains 343 /1462 variables (removed 1119) and now considering 768/2518 (removed 1750) transitions.
[2024-05-22 16:06:16] [INFO ] Flow matrix only has 736 transitions (discarded 32 similar events)
// Phase 1: matrix 736 rows 343 cols
[2024-05-22 16:06:16] [INFO ] Computed 109 invariants in 2 ms
[2024-05-22 16:06:16] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-22 16:06:16] [INFO ] Flow matrix only has 736 transitions (discarded 32 similar events)
[2024-05-22 16:06:16] [INFO ] Invariant cache hit.
[2024-05-22 16:06:16] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 16:06:16] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2024-05-22 16:06:16] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-22 16:06:16] [INFO ] Flow matrix only has 736 transitions (discarded 32 similar events)
[2024-05-22 16:06:16] [INFO ] Invariant cache hit.
[2024-05-22 16:06:17] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 343/1462 places, 768/2518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1575 ms. Remains : 343/1462 places, 768/2518 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-10 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 s221 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-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-10 finished in 1657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U (p1 U X(p2)))))'
Support contains 4 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1451 transition count 2489
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1451 transition count 2489
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 1445 transition count 2483
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 1445 transition count 2483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1443 transition count 2481
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1443 transition count 2481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1441 transition count 2479
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1441 transition count 2479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1439 transition count 2477
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1439 transition count 2477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1437 transition count 2475
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1437 transition count 2475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1435 transition count 2473
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1435 transition count 2473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1432 transition count 2470
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Applied a total of 62 rules in 838 ms. Remains 1431 /1462 variables (removed 31) and now considering 2469/2518 (removed 49) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2024-05-22 16:06:18] [INFO ] Computed 109 invariants in 7 ms
[2024-05-22 16:06:18] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-22 16:06:18] [INFO ] Invariant cache hit.
[2024-05-22 16:06:20] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned []
Implicit Place search using SMT with State Equation took 2559 ms to find 0 implicit places.
[2024-05-22 16:06:20] [INFO ] Invariant cache hit.
[2024-05-22 16:06:23] [INFO ] Dead Transitions using invariants and state equation in 2372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1431/1462 places, 2469/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5774 ms. Remains : 1431/1462 places, 2469/2518 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s645 1), p0:(EQ s1220 1), p2:(AND (EQ s688 1) (EQ s1429 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 12 reset in 509 ms.
Product exploration explored 100000 steps with 18 reset in 830 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 119 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Finished random walk after 7740 steps, including 2 resets, run visited all 5 properties in 151 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 273 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
[2024-05-22 16:06:26] [INFO ] Invariant cache hit.
[2024-05-22 16:06:28] [INFO ] [Real]Absence check using 109 positive place invariants in 8 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 9 factoid took 448 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-06b-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-12 finished in 11063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(G(!p1)) U p2)))'
Support contains 4 out of 1462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Graph (trivial) has 1320 edges and 1462 vertex of which 385 / 1462 are part of one of the 32 SCC in 1 ms
Free SCC test removed 353 places
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 247 rules applied. Total rules applied 248 place count 1108 transition count 1890
Reduce places removed 247 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 280 rules applied. Total rules applied 528 place count 861 transition count 1857
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 550 place count 839 transition count 1857
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 550 place count 839 transition count 1746
Deduced a syphon composed of 111 places in 6 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 772 place count 728 transition count 1746
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 825 place count 675 transition count 1423
Iterating global reduction 3 with 53 rules applied. Total rules applied 878 place count 675 transition count 1423
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 881 place count 675 transition count 1420
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 881 place count 675 transition count 1417
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 887 place count 672 transition count 1417
Performed 250 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 250 places in 0 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 4 with 500 rules applied. Total rules applied 1387 place count 422 transition count 1160
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1395 place count 422 transition count 1152
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1414 place count 403 transition count 974
Iterating global reduction 5 with 19 rules applied. Total rules applied 1433 place count 403 transition count 974
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1451 place count 403 transition count 956
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1453 place count 402 transition count 955
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1487 place count 385 transition count 1086
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1491 place count 381 transition count 1024
Iterating global reduction 6 with 4 rules applied. Total rules applied 1495 place count 381 transition count 1024
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1524 place count 381 transition count 995
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 1552 place count 381 transition count 967
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1565 place count 368 transition count 941
Iterating global reduction 7 with 13 rules applied. Total rules applied 1578 place count 368 transition count 941
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1591 place count 355 transition count 809
Iterating global reduction 7 with 13 rules applied. Total rules applied 1604 place count 355 transition count 809
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1617 place count 355 transition count 796
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1618 place count 354 transition count 795
Applied a total of 1618 rules in 194 ms. Remains 354 /1462 variables (removed 1108) and now considering 795/2518 (removed 1723) transitions.
[2024-05-22 16:06:28] [INFO ] Flow matrix only has 765 transitions (discarded 30 similar events)
// Phase 1: matrix 765 rows 354 cols
[2024-05-22 16:06:28] [INFO ] Computed 109 invariants in 3 ms
[2024-05-22 16:06:29] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-22 16:06:29] [INFO ] Flow matrix only has 765 transitions (discarded 30 similar events)
[2024-05-22 16:06:29] [INFO ] Invariant cache hit.
[2024-05-22 16:06:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:06:29] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2024-05-22 16:06:29] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-22 16:06:29] [INFO ] Flow matrix only has 765 transitions (discarded 30 similar events)
[2024-05-22 16:06:29] [INFO ] Invariant cache hit.
[2024-05-22 16:06:30] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 354/1462 places, 795/2518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1834 ms. Remains : 354/1462 places, 795/2518 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), p1, (NOT p2)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2 0), p2:(EQ s21 1), p1:(AND (EQ s32 1) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-13 finished in 2016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&F(X(p2))&&(!(p0 U p3)||p3))))'
Support contains 6 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1451 transition count 2489
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1451 transition count 2489
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 1446 transition count 2484
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 1446 transition count 2484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1445 transition count 2483
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1445 transition count 2483
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1444 transition count 2482
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1444 transition count 2482
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1443 transition count 2481
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1443 transition count 2481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1442 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1442 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1441 transition count 2479
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1441 transition count 2479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1440 transition count 2478
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1440 transition count 2478
Applied a total of 44 rules in 567 ms. Remains 1440 /1462 variables (removed 22) and now considering 2478/2518 (removed 40) transitions.
// Phase 1: matrix 2478 rows 1440 cols
[2024-05-22 16:06:31] [INFO ] Computed 109 invariants in 10 ms
[2024-05-22 16:06:31] [INFO ] Implicit Places using invariants in 758 ms returned []
[2024-05-22 16:06:31] [INFO ] Invariant cache hit.
[2024-05-22 16:06:34] [INFO ] Implicit Places using invariants and state equation in 2152 ms returned []
Implicit Place search using SMT with State Equation took 2912 ms to find 0 implicit places.
[2024-05-22 16:06:34] [INFO ] Invariant cache hit.
[2024-05-22 16:06:36] [INFO ] Dead Transitions using invariants and state equation in 2662 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1440/1462 places, 2478/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6147 ms. Remains : 1440/1462 places, 2478/2518 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, p3, (NOT p1), (NOT p2)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s224 1) (EQ s1299 1)), p0:(AND (EQ s541 1) (EQ s1354 1)), p3:(EQ s153 1), p2:(EQ s193 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-15 finished in 6447 ms.
All properties solved by simple procedures.
Total runtime 169425 ms.

BK_STOP 1716393998169

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-06b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DLCround-PT-06b, 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 r131-smll-171624288400108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-06b.tgz
mv DLCround-PT-06b 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 ;