Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K Apr 30 07:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 07:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 07:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 07:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 813K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-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 1652570965733

Running Version 202205111006
[2022-05-14 23:29:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 23:29:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 23:29:27] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2022-05-14 23:29:27] [INFO ] Transformed 2340 places.
[2022-05-14 23:29:27] [INFO ] Transformed 3456 transitions.
[2022-05-14 23:29:27] [INFO ] Found NUPN structural information;
[2022-05-14 23:29:27] [INFO ] Parsed PT model containing 2340 places and 3456 transitions in 298 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DLCround-PT-06b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 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 315 places :
Symmetric choice reduction at 0 with 315 rule applications. Total rules 1125 place count 1620 transition count 2736
Iterating global reduction 0 with 315 rules applied. Total rules applied 1440 place count 1620 transition count 2736
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1446 place count 1620 transition count 2730
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 1500 place count 1566 transition count 2618
Iterating global reduction 1 with 54 rules applied. Total rules applied 1554 place count 1566 transition count 2618
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 1586 place count 1534 transition count 2586
Iterating global reduction 1 with 32 rules applied. Total rules applied 1618 place count 1534 transition count 2586
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1622 place count 1534 transition count 2582
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1638 place count 1518 transition count 2566
Iterating global reduction 2 with 16 rules applied. Total rules applied 1654 place count 1518 transition count 2566
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1670 place count 1502 transition count 2550
Iterating global reduction 2 with 16 rules applied. Total rules applied 1686 place count 1502 transition count 2550
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1702 place count 1486 transition count 2534
Iterating global reduction 2 with 16 rules applied. Total rules applied 1718 place count 1486 transition count 2534
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1729 place count 1475 transition count 2523
Iterating global reduction 2 with 11 rules applied. Total rules applied 1740 place count 1475 transition count 2523
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1747 place count 1468 transition count 2516
Iterating global reduction 2 with 7 rules applied. Total rules applied 1754 place count 1468 transition count 2516
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1761 place count 1461 transition count 2509
Iterating global reduction 2 with 7 rules applied. Total rules applied 1768 place count 1461 transition count 2509
Applied a total of 1768 rules in 1743 ms. Remains 1461 /2340 variables (removed 879) and now considering 2509/3456 (removed 947) transitions.
// Phase 1: matrix 2509 rows 1461 cols
[2022-05-14 23:29:29] [INFO ] Computed 109 place invariants in 43 ms
[2022-05-14 23:29:29] [INFO ] Implicit Places using invariants in 596 ms returned []
// Phase 1: matrix 2509 rows 1461 cols
[2022-05-14 23:29:29] [INFO ] Computed 109 place invariants in 11 ms
[2022-05-14 23:29:30] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
// Phase 1: matrix 2509 rows 1461 cols
[2022-05-14 23:29:30] [INFO ] Computed 109 place invariants in 11 ms
[2022-05-14 23:29:31] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1461/2340 places, 2509/3456 transitions.
Finished structural reductions, in 1 iterations. Remains : 1461/2340 places, 2509/3456 transitions.
Support contains 40 out of 1461 places after structural reductions.
[2022-05-14 23:29:32] [INFO ] Flatten gal took : 164 ms
[2022-05-14 23:29:32] [INFO ] Flatten gal took : 108 ms
[2022-05-14 23:29:32] [INFO ] Input system was already deterministic with 2509 transitions.
Support contains 37 out of 1461 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 30) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2509 rows 1461 cols
[2022-05-14 23:29:33] [INFO ] Computed 109 place invariants in 12 ms
[2022-05-14 23:29:33] [INFO ] [Real]Absence check using 109 positive place invariants in 68 ms returned sat
[2022-05-14 23:29:35] [INFO ] After 1161ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:5
[2022-05-14 23:29:35] [INFO ] After 1451ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:7
[2022-05-14 23:29:35] [INFO ] After 2056ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2022-05-14 23:29:35] [INFO ] [Nat]Absence check using 109 positive place invariants in 64 ms returned sat
[2022-05-14 23:29:37] [INFO ] After 1140ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-05-14 23:29:38] [INFO ] After 2002ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 469 ms.
[2022-05-14 23:29:38] [INFO ] After 3026ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 5 properties in 104 ms.
Support contains 3 out of 1461 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Graph (trivial) has 1322 edges and 1461 vertex of which 400 / 1461 are part of one of the 32 SCC in 12 ms
Free SCC test removed 368 places
Drop transitions removed 418 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 429 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 233 place count 1093 transition count 1848
Reduce places removed 232 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 265 rules applied. Total rules applied 498 place count 861 transition count 1815
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 520 place count 839 transition count 1815
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 520 place count 839 transition count 1707
Deduced a syphon composed of 108 places in 4 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 736 place count 731 transition count 1707
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 790 place count 677 transition count 1386
Iterating global reduction 3 with 54 rules applied. Total rules applied 844 place count 677 transition count 1386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 848 place count 677 transition count 1382
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 848 place count 677 transition count 1377
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 858 place count 672 transition count 1377
Performed 253 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 253 places in 1 ms
Reduce places removed 253 places and 0 transitions.
Iterating global reduction 4 with 506 rules applied. Total rules applied 1364 place count 419 transition count 1117
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1371 place count 419 transition count 1110
Renaming transitions due to excessive name length > 1024 char.
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1390 place count 400 transition count 932
Iterating global reduction 5 with 19 rules applied. Total rules applied 1409 place count 400 transition count 932
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1426 place count 400 transition count 915
Performed 37 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 1500 place count 363 transition count 1211
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1513 place count 363 transition count 1198
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 1531 place count 345 transition count 857
Iterating global reduction 7 with 18 rules applied. Total rules applied 1549 place count 345 transition count 857
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 1592 place count 345 transition count 814
Drop transitions removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 8 with 91 rules applied. Total rules applied 1683 place count 345 transition count 723
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1690 place count 338 transition count 652
Iterating global reduction 8 with 7 rules applied. Total rules applied 1697 place count 338 transition count 652
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1704 place count 338 transition count 645
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 1712 place count 334 transition count 672
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1717 place count 334 transition count 667
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 1739 place count 334 transition count 645
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1747 place count 330 transition count 672
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1753 place count 330 transition count 666
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 1774 place count 330 transition count 645
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1782 place count 326 transition count 672
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1788 place count 326 transition count 666
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1809 place count 326 transition count 645
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 1817 place count 322 transition count 672
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1823 place count 322 transition count 666
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1844 place count 322 transition count 645
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 1852 place count 318 transition count 672
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1858 place count 318 transition count 666
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1879 place count 318 transition count 645
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 1887 place count 314 transition count 672
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1893 place count 314 transition count 666
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1914 place count 314 transition count 645
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 1922 place count 310 transition count 672
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1928 place count 310 transition count 666
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1949 place count 310 transition count 645
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 1957 place count 306 transition count 672
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1963 place count 306 transition count 666
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 1984 place count 306 transition count 645
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 1992 place count 302 transition count 672
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 1998 place count 302 transition count 666
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 2019 place count 302 transition count 645
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2027 place count 298 transition count 674
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2033 place count 298 transition count 668
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2054 place count 298 transition count 647
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2062 place count 294 transition count 676
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2068 place count 294 transition count 670
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2089 place count 294 transition count 649
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 20 with 8 rules applied. Total rules applied 2097 place count 290 transition count 676
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2103 place count 290 transition count 670
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2124 place count 290 transition count 649
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2132 place count 286 transition count 676
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2138 place count 286 transition count 670
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2159 place count 286 transition count 649
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 22 with 8 rules applied. Total rules applied 2167 place count 282 transition count 668
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 2171 place count 282 transition count 664
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 23 with 19 rules applied. Total rules applied 2190 place count 282 transition count 645
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 2198 place count 278 transition count 665
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 2202 place count 278 transition count 661
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 24 with 19 rules applied. Total rules applied 2221 place count 278 transition count 642
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 2229 place count 274 transition count 662
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 2233 place count 274 transition count 658
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 25 with 19 rules applied. Total rules applied 2252 place count 274 transition count 639
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 2260 place count 270 transition count 658
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 2264 place count 270 transition count 654
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 26 with 19 rules applied. Total rules applied 2283 place count 270 transition count 635
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
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 2291 place count 266 transition count 655
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 2295 place count 266 transition count 651
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 27 with 19 rules applied. Total rules applied 2314 place count 266 transition count 632
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
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 2322 place count 262 transition count 652
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 2326 place count 262 transition count 648
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 28 with 19 rules applied. Total rules applied 2345 place count 262 transition count 629
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 2353 place count 258 transition count 648
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2357 place count 258 transition count 644
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 2376 place count 258 transition count 625
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 2384 place count 254 transition count 645
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 2388 place count 254 transition count 641
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 2407 place count 254 transition count 622
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 2415 place count 250 transition count 641
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 2419 place count 250 transition count 637
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 2438 place count 250 transition count 618
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 2446 place count 246 transition count 637
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 2450 place count 246 transition count 633
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 2469 place count 246 transition count 614
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 4 rules applied. Total rules applied 2473 place count 244 transition count 620
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 2475 place count 244 transition count 618
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 33 with 5 rules applied. Total rules applied 2480 place count 244 transition count 613
Free-agglomeration rule applied 27 times.
Iterating global reduction 33 with 27 rules applied. Total rules applied 2507 place count 244 transition count 586
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 222 transitions
Reduce isomorphic transitions removed 222 transitions.
Graph (complete) has 611 edges and 217 vertex of which 147 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.2 ms
Discarding 70 places :
Also discarding 0 output transitions
Iterating post reduction 33 with 250 rules applied. Total rules applied 2757 place count 147 transition count 364
Drop transitions removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 34 with 70 rules applied. Total rules applied 2827 place count 147 transition count 294
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 35 with 28 rules applied. Total rules applied 2855 place count 147 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 35 with 1 rules applied. Total rules applied 2856 place count 146 transition count 265
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 35 with 6 rules applied. Total rules applied 2862 place count 140 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 2862 place count 140 transition count 264
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 36 with 2 rules applied. Total rules applied 2864 place count 139 transition count 264
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 36 with 87 rules applied. Total rules applied 2951 place count 81 transition count 235
Drop transitions removed 29 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 36 with 82 rules applied. Total rules applied 3033 place count 81 transition count 153
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 37 with 74 rules applied. Total rules applied 3107 place count 32 transition count 128
Drop transitions removed 48 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (trivial) has 9 edges and 32 vertex of which 8 / 32 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 70 rules applied. Total rules applied 3177 place count 28 transition count 59
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 17 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 26 transitions.
Graph (complete) has 37 edges and 24 vertex of which 16 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 38 with 31 rules applied. Total rules applied 3208 place count 16 transition count 29
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3212 place count 16 transition count 25
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 3224 place count 8 transition count 21
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 3236 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 41 with 1 Pre rules applied. Total rules applied 3236 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 41 with 2 rules applied. Total rules applied 3238 place count 7 transition count 8
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 41 with 2 rules applied. Total rules applied 3240 place count 6 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 41 with 1 rules applied. Total rules applied 3241 place count 6 transition count 6
Applied a total of 3241 rules in 721 ms. Remains 6 /1461 variables (removed 1455) and now considering 6/2509 (removed 2503) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/1461 places, 6/2509 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 216 stabilizing places and 216 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(G(p1)))&&p0) U (!X(p2)||F(p3))))'
Support contains 5 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1447 transition count 2486
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1447 transition count 2486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1447 transition count 2485
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 1442 transition count 2480
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 1442 transition count 2480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 1439 transition count 2477
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 1439 transition count 2477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 1436 transition count 2474
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 1436 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 1434 transition count 2472
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2470
Applied a total of 59 rules in 265 ms. Remains 1432 /1461 variables (removed 29) and now considering 2470/2509 (removed 39) transitions.
// Phase 1: matrix 2470 rows 1432 cols
[2022-05-14 23:29:40] [INFO ] Computed 109 place invariants in 12 ms
[2022-05-14 23:29:40] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 2470 rows 1432 cols
[2022-05-14 23:29:40] [INFO ] Computed 109 place invariants in 9 ms
[2022-05-14 23:29:41] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
// Phase 1: matrix 2470 rows 1432 cols
[2022-05-14 23:29:41] [INFO ] Computed 109 place invariants in 12 ms
[2022-05-14 23:29:42] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1432/1461 places, 2470/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 1432/1461 places, 2470/2509 transitions.
Stuttering acceptance computed with spot in 356 ms :[(AND p2 (NOT p3)), (AND (NOT p3) p2), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s996 1), p0:(AND (EQ s129 1) (EQ s1160 1)), p2:(AND (EQ s104 1) (EQ s863 1)), p1:(AND (EQ s129 1) (EQ s1160 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 50000 reset in 1036 ms.
Product exploration explored 100000 steps with 50000 reset in 952 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 (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) p0 p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p0 p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) p2)))
Knowledge based reduction with 10 factoid took 171 ms. Reduced automaton from 5 states, 9 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DLCround-PT-06b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-00 finished in 5353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 2 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1447 transition count 2486
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1447 transition count 2486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1447 transition count 2485
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 1442 transition count 2480
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 1442 transition count 2480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 1439 transition count 2477
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 1439 transition count 2477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 1436 transition count 2474
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 1436 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 1434 transition count 2472
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2470
Applied a total of 59 rules in 260 ms. Remains 1432 /1461 variables (removed 29) and now considering 2470/2509 (removed 39) transitions.
// Phase 1: matrix 2470 rows 1432 cols
[2022-05-14 23:29:45] [INFO ] Computed 109 place invariants in 12 ms
[2022-05-14 23:29:45] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 2470 rows 1432 cols
[2022-05-14 23:29:45] [INFO ] Computed 109 place invariants in 6 ms
[2022-05-14 23:29:46] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1431 ms to find 0 implicit places.
// Phase 1: matrix 2470 rows 1432 cols
[2022-05-14 23:29:46] [INFO ] Computed 109 place invariants in 12 ms
[2022-05-14 23:29:47] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1432/1461 places, 2470/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 1432/1461 places, 2470/2509 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s111 1), p1:(EQ s420 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33 reset in 365 ms.
Product exploration explored 100000 steps with 28 reset in 477 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 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4434 steps, including 1 resets, run visited all 1 properties in 36 ms. (steps per millisecond=123 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 2470 rows 1432 cols
[2022-05-14 23:29:49] [INFO ] Computed 109 place invariants in 13 ms
[2022-05-14 23:29:50] [INFO ] [Real]Absence check using 109 positive place invariants in 126 ms returned sat
[2022-05-14 23:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:29:53] [INFO ] [Real]Absence check using state equation in 2849 ms returned sat
[2022-05-14 23:29:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:29:54] [INFO ] [Nat]Absence check using 109 positive place invariants in 122 ms returned sat
[2022-05-14 23:29:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:29:57] [INFO ] [Nat]Absence check using state equation in 2856 ms returned sat
[2022-05-14 23:29:57] [INFO ] Computed and/alt/rep : 2308/3938/2308 causal constraints (skipped 161 transitions) in 122 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-14 23:30:08] [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 p0)
Could not prove EG (NOT p0)
Support contains 1 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 1291 edges and 1432 vertex of which 375 / 1432 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 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 231 place count 1089 transition count 1871
Reduce places removed 230 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 263 rules applied. Total rules applied 494 place count 859 transition count 1838
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 24 rules applied. Total rules applied 518 place count 837 transition count 1836
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 520 place count 835 transition count 1836
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 111 Pre rules applied. Total rules applied 520 place count 835 transition count 1725
Deduced a syphon composed of 111 places in 4 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 4 with 222 rules applied. Total rules applied 742 place count 724 transition count 1725
Discarding 47 places :
Symmetric choice reduction at 4 with 47 rule applications. Total rules 789 place count 677 transition count 1411
Iterating global reduction 4 with 47 rules applied. Total rules applied 836 place count 677 transition count 1411
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 840 place count 677 transition count 1407
Performed 256 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 256 places in 0 ms
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 5 with 512 rules applied. Total rules applied 1352 place count 421 transition count 1144
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1359 place count 421 transition count 1137
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1376 place count 404 transition count 979
Iterating global reduction 6 with 17 rules applied. Total rules applied 1393 place count 404 transition count 979
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1409 place count 404 transition count 963
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 7 with 2 rules applied. Total rules applied 1411 place count 403 transition count 962
Performed 17 Post agglomeration using F-continuation condition with reduction of 21 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 1445 place count 386 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1446 place count 386 transition count 1104
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1449 place count 383 transition count 1058
Iterating global reduction 8 with 3 rules applied. Total rules applied 1452 place count 383 transition count 1058
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 1474 place count 383 transition count 1036
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 1502 place count 383 transition count 1008
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1514 place count 371 transition count 984
Iterating global reduction 9 with 12 rules applied. Total rules applied 1526 place count 371 transition count 984
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 1538 place count 359 transition count 862
Iterating global reduction 9 with 12 rules applied. Total rules applied 1550 place count 359 transition count 862
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 1562 place count 359 transition count 850
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1563 place count 358 transition count 849
Applied a total of 1563 rules in 204 ms. Remains 358 /1432 variables (removed 1074) and now considering 849/2470 (removed 1621) transitions.
[2022-05-14 23:30:08] [INFO ] Flow matrix only has 816 transitions (discarded 33 similar events)
// Phase 1: matrix 816 rows 358 cols
[2022-05-14 23:30:08] [INFO ] Computed 109 place invariants in 4 ms
[2022-05-14 23:30:08] [INFO ] Implicit Places using invariants in 160 ms returned []
[2022-05-14 23:30:08] [INFO ] Flow matrix only has 816 transitions (discarded 33 similar events)
// Phase 1: matrix 816 rows 358 cols
[2022-05-14 23:30:08] [INFO ] Computed 109 place invariants in 1 ms
[2022-05-14 23:30:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-14 23:30:09] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2022-05-14 23:30:09] [INFO ] Redundant transitions in 56 ms returned []
[2022-05-14 23:30:09] [INFO ] Flow matrix only has 816 transitions (discarded 33 similar events)
// Phase 1: matrix 816 rows 358 cols
[2022-05-14 23:30:09] [INFO ] Computed 109 place invariants in 4 ms
[2022-05-14 23:30:09] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/1432 places, 849/2470 transitions.
Finished structural reductions, in 1 iterations. Remains : 358/1432 places, 849/2470 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 210 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=30 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2022-05-14 23:30:09] [INFO ] Flow matrix only has 816 transitions (discarded 33 similar events)
// Phase 1: matrix 816 rows 358 cols
[2022-05-14 23:30:09] [INFO ] Computed 109 place invariants in 2 ms
[2022-05-14 23:30:10] [INFO ] [Real]Absence check using 109 positive place invariants in 24 ms returned sat
[2022-05-14 23:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:30:10] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2022-05-14 23:30:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:30:10] [INFO ] [Nat]Absence check using 109 positive place invariants in 24 ms returned sat
[2022-05-14 23:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:30:10] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2022-05-14 23:30:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-14 23:30:10] [INFO ] [Nat]Added 41 Read/Feed constraints in 5 ms returned sat
[2022-05-14 23:30:10] [INFO ] Computed and/alt/rep : 516/1273/516 causal constraints (skipped 251 transitions) in 40 ms.
[2022-05-14 23:30:11] [INFO ] Added : 2 causal constraints over 1 iterations in 137 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-01 finished in 26071 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Graph (trivial) has 1324 edges and 1461 vertex of which 400 / 1461 are part of one of the 32 SCC in 2 ms
Free SCC test removed 368 places
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 234 place count 1092 transition count 1878
Reduce places removed 233 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 266 rules applied. Total rules applied 500 place count 859 transition count 1845
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 522 place count 837 transition count 1845
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 522 place count 837 transition count 1737
Deduced a syphon composed of 108 places in 3 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 738 place count 729 transition count 1737
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 793 place count 674 transition count 1415
Iterating global reduction 3 with 55 rules applied. Total rules applied 848 place count 674 transition count 1415
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 852 place count 674 transition count 1411
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 852 place count 674 transition count 1405
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 864 place count 668 transition count 1405
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 1364 place count 418 transition count 1148
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1371 place count 418 transition count 1141
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1390 place count 399 transition count 963
Iterating global reduction 5 with 19 rules applied. Total rules applied 1409 place count 399 transition count 963
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1426 place count 399 transition count 946
Performed 16 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1458 place count 383 transition count 1071
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1462 place count 379 transition count 1009
Iterating global reduction 6 with 4 rules applied. Total rules applied 1466 place count 379 transition count 1009
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1495 place count 379 transition count 980
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 1525 place count 379 transition count 950
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1539 place count 365 transition count 922
Iterating global reduction 7 with 14 rules applied. Total rules applied 1553 place count 365 transition count 922
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1567 place count 351 transition count 780
Iterating global reduction 7 with 14 rules applied. Total rules applied 1581 place count 351 transition count 780
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1595 place count 351 transition count 766
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1596 place count 350 transition count 765
Applied a total of 1596 rules in 163 ms. Remains 350 /1461 variables (removed 1111) and now considering 765/2509 (removed 1744) transitions.
[2022-05-14 23:30:11] [INFO ] Flow matrix only has 743 transitions (discarded 22 similar events)
// Phase 1: matrix 743 rows 350 cols
[2022-05-14 23:30:11] [INFO ] Computed 109 place invariants in 4 ms
[2022-05-14 23:30:11] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-14 23:30:11] [INFO ] Flow matrix only has 743 transitions (discarded 22 similar events)
// Phase 1: matrix 743 rows 350 cols
[2022-05-14 23:30:11] [INFO ] Computed 109 place invariants in 1 ms
[2022-05-14 23:30:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-14 23:30:11] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2022-05-14 23:30:11] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-14 23:30:11] [INFO ] Flow matrix only has 743 transitions (discarded 22 similar events)
// Phase 1: matrix 743 rows 350 cols
[2022-05-14 23:30:11] [INFO ] Computed 109 place invariants in 2 ms
[2022-05-14 23:30:12] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 350/1461 places, 765/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 350/1461 places, 765/2509 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s258 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-03 finished in 1336 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Graph (trivial) has 1322 edges and 1461 vertex of which 394 / 1461 are part of one of the 31 SCC in 1 ms
Free SCC test removed 363 places
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 234 place count 1097 transition count 1883
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 267 rules applied. Total rules applied 501 place count 864 transition count 1849
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 524 place count 842 transition count 1848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 841 transition count 1848
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 109 Pre rules applied. Total rules applied 525 place count 841 transition count 1739
Deduced a syphon composed of 109 places in 4 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 743 place count 732 transition count 1739
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 798 place count 677 transition count 1435
Iterating global reduction 4 with 55 rules applied. Total rules applied 853 place count 677 transition count 1435
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 857 place count 677 transition count 1431
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 857 place count 677 transition count 1424
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 871 place count 670 transition count 1424
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 5 with 502 rules applied. Total rules applied 1373 place count 419 transition count 1166
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1380 place count 419 transition count 1159
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 1401 place count 398 transition count 961
Iterating global reduction 6 with 21 rules applied. Total rules applied 1422 place count 398 transition count 961
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1440 place count 398 transition count 943
Performed 16 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1472 place count 382 transition count 1068
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1476 place count 378 transition count 1006
Iterating global reduction 7 with 4 rules applied. Total rules applied 1480 place count 378 transition count 1006
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1509 place count 378 transition count 977
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 8 with 29 rules applied. Total rules applied 1538 place count 378 transition count 948
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1550 place count 366 transition count 924
Iterating global reduction 8 with 12 rules applied. Total rules applied 1562 place count 366 transition count 924
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1574 place count 354 transition count 803
Iterating global reduction 8 with 12 rules applied. Total rules applied 1586 place count 354 transition count 803
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1598 place count 354 transition count 791
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1599 place count 353 transition count 790
Applied a total of 1599 rules in 161 ms. Remains 353 /1461 variables (removed 1108) and now considering 790/2509 (removed 1719) transitions.
[2022-05-14 23:30:12] [INFO ] Flow matrix only has 767 transitions (discarded 23 similar events)
// Phase 1: matrix 767 rows 353 cols
[2022-05-14 23:30:12] [INFO ] Computed 109 place invariants in 4 ms
[2022-05-14 23:30:12] [INFO ] Implicit Places using invariants in 156 ms returned []
[2022-05-14 23:30:12] [INFO ] Flow matrix only has 767 transitions (discarded 23 similar events)
// Phase 1: matrix 767 rows 353 cols
[2022-05-14 23:30:12] [INFO ] Computed 109 place invariants in 1 ms
[2022-05-14 23:30:12] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-14 23:30:13] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2022-05-14 23:30:13] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-14 23:30:13] [INFO ] Flow matrix only has 767 transitions (discarded 23 similar events)
// Phase 1: matrix 767 rows 353 cols
[2022-05-14 23:30:13] [INFO ] Computed 109 place invariants in 3 ms
[2022-05-14 23:30:13] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 353/1461 places, 790/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 353/1461 places, 790/2509 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-04 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s49 1) (EQ s160 1)), p1:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-04 finished in 1090 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((X(F(p1))&&p0)))||p2)))'
Support contains 4 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1447 transition count 2495
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1447 transition count 2495
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1447 transition count 2494
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 1441 transition count 2488
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 1441 transition count 2488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 1438 transition count 2485
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 1438 transition count 2485
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 1435 transition count 2482
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 1435 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1433 transition count 2480
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1433 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2479
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2479
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1431 transition count 2478
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1431 transition count 2478
Applied a total of 61 rules in 247 ms. Remains 1431 /1461 variables (removed 30) and now considering 2478/2509 (removed 31) transitions.
// Phase 1: matrix 2478 rows 1431 cols
[2022-05-14 23:30:13] [INFO ] Computed 109 place invariants in 10 ms
[2022-05-14 23:30:14] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 2478 rows 1431 cols
[2022-05-14 23:30:14] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:30:15] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
// Phase 1: matrix 2478 rows 1431 cols
[2022-05-14 23:30:15] [INFO ] Computed 109 place invariants in 10 ms
[2022-05-14 23:30:16] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1431/1461 places, 2478/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 1431/1461 places, 2478/2509 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s615 1) (EQ s1363 1)), p1:(AND (EQ s21 1) (EQ s991 1)), p0:(AND (EQ s615 1) (EQ s1363 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 440 ms.
Stack based approach found an accepted trace after 15648 steps with 1 reset with depth 10300 and stack size 10300 in 71 ms.
FORMULA DLCround-PT-06b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DLCround-PT-06b-LTLFireability-05 finished in 3467 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||p1||(G(X(G(p0)))&&p2)))))'
Support contains 2 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1448 transition count 2487
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1448 transition count 2487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1448 transition count 2486
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 1442 transition count 2480
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 1442 transition count 2480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 1439 transition count 2477
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 1439 transition count 2477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 1436 transition count 2474
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 1436 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 1434 transition count 2472
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1432 transition count 2470
Applied a total of 59 rules in 262 ms. Remains 1432 /1461 variables (removed 29) and now considering 2470/2509 (removed 39) transitions.
// Phase 1: matrix 2470 rows 1432 cols
[2022-05-14 23:30:17] [INFO ] Computed 109 place invariants in 13 ms
[2022-05-14 23:30:17] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 2470 rows 1432 cols
[2022-05-14 23:30:17] [INFO ] Computed 109 place invariants in 4 ms
[2022-05-14 23:30:18] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
// Phase 1: matrix 2470 rows 1432 cols
[2022-05-14 23:30:18] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:30:19] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1432/1461 places, 2470/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 1432/1461 places, 2470/2509 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s1226 1), p0:(EQ s1297 1), p2:(EQ s1226 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 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 2868 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(((p0 U X((G(p1) U p2)))&&p3))))))'
Support contains 6 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1447 transition count 2486
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1447 transition count 2486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1447 transition count 2485
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 1442 transition count 2480
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 1442 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1440 transition count 2478
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1440 transition count 2478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1438 transition count 2476
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1438 transition count 2476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1437 transition count 2475
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1437 transition count 2475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1436 transition count 2474
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1436 transition count 2474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1435 transition count 2473
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1435 transition count 2473
Applied a total of 53 rules in 232 ms. Remains 1435 /1461 variables (removed 26) and now considering 2473/2509 (removed 36) transitions.
// Phase 1: matrix 2473 rows 1435 cols
[2022-05-14 23:30:20] [INFO ] Computed 109 place invariants in 12 ms
[2022-05-14 23:30:20] [INFO ] Implicit Places using invariants in 348 ms returned []
// Phase 1: matrix 2473 rows 1435 cols
[2022-05-14 23:30:20] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:30:21] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
// Phase 1: matrix 2473 rows 1435 cols
[2022-05-14 23:30:21] [INFO ] Computed 109 place invariants in 8 ms
[2022-05-14 23:30:22] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1435/1461 places, 2473/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 1435/1461 places, 2473/2509 transitions.
Stuttering acceptance computed with spot in 722 ms :[(OR (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={1} source=0 dest: 0}, { cond=(NOT p3), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 p3), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p3 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p3 (NOT p1)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p3 (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p3 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p3 p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p3 p1), acceptance={0} source=3 dest: 5}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s33 1), p0:(OR (EQ s695 1) (AND (EQ s399 1) (EQ s1277 1))), p2:(AND (EQ s297 1) (EQ s922 1)), p1:(EQ s695 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 443 ms.
Product exploration explored 100000 steps with 0 reset in 561 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 (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3 (NOT p2) p1))), (X (NOT (AND p3 (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p3) (NOT p2) p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3 (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 2910 ms. Reduced automaton from 6 states, 33 edges and 4 AP to 6 states, 33 edges and 4 AP.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2473 rows 1435 cols
[2022-05-14 23:30:28] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:30:28] [INFO ] [Real]Absence check using 109 positive place invariants in 56 ms returned sat
[2022-05-14 23:30:28] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:8
[2022-05-14 23:30:29] [INFO ] [Nat]Absence check using 109 positive place invariants in 54 ms returned sat
[2022-05-14 23:30:30] [INFO ] After 1160ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2022-05-14 23:30:31] [INFO ] After 2145ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 505 ms.
[2022-05-14 23:30:31] [INFO ] After 3200ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 128 ms.
Support contains 6 out of 1435 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1435/1435 places, 2473/2473 transitions.
Graph (trivial) has 1292 edges and 1435 vertex of which 383 / 1435 are part of one of the 31 SCC in 5 ms
Free SCC test removed 352 places
Drop transitions removed 401 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 412 transitions.
Drop transitions removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 229 rules applied. Total rules applied 230 place count 1083 transition count 1832
Reduce places removed 229 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 262 rules applied. Total rules applied 492 place count 854 transition count 1799
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 515 place count 832 transition count 1798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 831 transition count 1798
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 112 Pre rules applied. Total rules applied 516 place count 831 transition count 1686
Deduced a syphon composed of 112 places in 4 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 4 with 224 rules applied. Total rules applied 740 place count 719 transition count 1686
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 788 place count 671 transition count 1380
Iterating global reduction 4 with 48 rules applied. Total rules applied 836 place count 671 transition count 1380
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 840 place count 671 transition count 1376
Performed 253 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 253 places in 0 ms
Reduce places removed 253 places and 0 transitions.
Iterating global reduction 5 with 506 rules applied. Total rules applied 1346 place count 418 transition count 1116
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1353 place count 418 transition count 1109
Renaming transitions due to excessive name length > 1024 char.
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1370 place count 401 transition count 948
Iterating global reduction 6 with 17 rules applied. Total rules applied 1387 place count 401 transition count 948
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1403 place count 401 transition count 932
Performed 35 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 1473 place count 366 transition count 1213
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1486 place count 366 transition count 1200
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1502 place count 350 transition count 899
Iterating global reduction 8 with 16 rules applied. Total rules applied 1518 place count 350 transition count 899
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 8 with 41 rules applied. Total rules applied 1559 place count 350 transition count 858
Drop transitions removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 9 with 91 rules applied. Total rules applied 1650 place count 350 transition count 767
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1657 place count 343 transition count 696
Iterating global reduction 9 with 7 rules applied. Total rules applied 1664 place count 343 transition count 696
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1671 place count 343 transition count 689
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1679 place count 339 transition count 716
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1684 place count 339 transition count 711
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 1706 place count 339 transition count 689
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1714 place count 335 transition count 719
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1720 place count 335 transition count 713
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 12 with 23 rules applied. Total rules applied 1743 place count 335 transition count 690
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1751 place count 331 transition count 718
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1757 place count 331 transition count 712
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 13 with 22 rules applied. Total rules applied 1779 place count 331 transition count 690
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1787 place count 327 transition count 722
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1793 place count 327 transition count 716
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1814 place count 327 transition count 695
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 14 with 8 rules applied. Total rules applied 1822 place count 323 transition count 726
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1828 place count 323 transition count 720
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1849 place count 323 transition count 699
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 1857 place count 319 transition count 727
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1863 place count 319 transition count 721
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1884 place count 319 transition count 700
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 1892 place count 315 transition count 727
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1898 place count 315 transition count 721
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 1919 place count 315 transition count 700
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 1927 place count 311 transition count 728
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 1933 place count 311 transition count 722
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 1954 place count 311 transition count 701
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 1962 place count 307 transition count 728
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 1968 place count 307 transition count 722
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 1989 place count 307 transition count 701
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 1997 place count 303 transition count 729
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2003 place count 303 transition count 723
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2024 place count 303 transition count 702
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 20 with 8 rules applied. Total rules applied 2032 place count 299 transition count 729
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2038 place count 299 transition count 723
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2059 place count 299 transition count 702
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2067 place count 295 transition count 732
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2073 place count 295 transition count 726
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2094 place count 295 transition count 705
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2102 place count 291 transition count 733
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 22 with 5 rules applied. Total rules applied 2107 place count 291 transition count 728
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 23 with 22 rules applied. Total rules applied 2129 place count 291 transition count 706
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 23 with 8 rules applied. Total rules applied 2137 place count 287 transition count 725
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 2141 place count 287 transition count 721
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 24 with 19 rules applied. Total rules applied 2160 place count 287 transition count 702
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 2168 place count 283 transition count 721
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 2172 place count 283 transition count 717
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 25 with 19 rules applied. Total rules applied 2191 place count 283 transition count 698
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
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 2199 place count 279 transition count 719
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 2203 place count 279 transition count 715
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 26 with 19 rules applied. Total rules applied 2222 place count 279 transition count 696
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 2230 place count 275 transition count 724
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 2234 place count 275 transition count 720
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 27 with 20 rules applied. Total rules applied 2254 place count 275 transition count 700
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
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 2262 place count 271 transition count 720
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 2266 place count 271 transition count 716
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 28 with 20 rules applied. Total rules applied 2286 place count 271 transition count 696
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
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 2294 place count 267 transition count 716
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2298 place count 267 transition count 712
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 29 with 20 rules applied. Total rules applied 2318 place count 267 transition count 692
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 2326 place count 263 transition count 711
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 2330 place count 263 transition count 707
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 2349 place count 263 transition count 688
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
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 2357 place count 259 transition count 708
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 2361 place count 259 transition count 704
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 31 with 20 rules applied. Total rules applied 2381 place count 259 transition count 684
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -22
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 2389 place count 255 transition count 706
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 2393 place count 255 transition count 702
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 32 with 20 rules applied. Total rules applied 2413 place count 255 transition count 682
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 2421 place count 251 transition count 705
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 2425 place count 251 transition count 701
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 2444 place count 251 transition count 682
Free-agglomeration rule applied 32 times with reduction of 1 identical transitions.
Iterating global reduction 33 with 32 rules applied. Total rules applied 2476 place count 251 transition count 649
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 232 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 233 transitions.
Graph (complete) has 660 edges and 219 vertex of which 167 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.0 ms
Discarding 52 places :
Also discarding 0 output transitions
Iterating post reduction 33 with 266 rules applied. Total rules applied 2742 place count 167 transition count 416
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 34 with 52 rules applied. Total rules applied 2794 place count 167 transition count 364
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 35 with 36 rules applied. Total rules applied 2830 place count 167 transition count 328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 35 with 1 rules applied. Total rules applied 2831 place count 166 transition count 327
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 2835 place count 162 transition count 327
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 36 with 60 rules applied. Total rules applied 2895 place count 122 transition count 307
Drop transitions removed 20 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 36 with 58 rules applied. Total rules applied 2953 place count 122 transition count 249
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 37 with 69 rules applied. Total rules applied 3022 place count 76 transition count 226
Drop transitions removed 42 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 63 transitions.
Graph (trivial) has 11 edges and 76 vertex of which 8 / 76 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 64 rules applied. Total rules applied 3086 place count 72 transition count 163
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 55 transitions.
Graph (complete) has 140 edges and 69 vertex of which 47 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Iterating post reduction 38 with 59 rules applied. Total rules applied 3145 place count 47 transition count 99
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 39 with 13 rules applied. Total rules applied 3158 place count 47 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 40 with 6 rules applied. Total rules applied 3164 place count 43 transition count 84
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 3168 place count 43 transition count 80
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 41 with 18 rules applied. Total rules applied 3186 place count 31 transition count 74
Drop transitions removed 9 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 41 with 18 rules applied. Total rules applied 3204 place count 31 transition count 56
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 42 with 19 rules applied. Total rules applied 3223 place count 31 transition count 37
Graph (complete) has 57 edges and 31 vertex of which 15 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Iterating post reduction 42 with 1 rules applied. Total rules applied 3224 place count 15 transition count 37
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 43 with 19 rules applied. Total rules applied 3243 place count 15 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 44 with 2 Pre rules applied. Total rules applied 3243 place count 15 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 44 with 4 rules applied. Total rules applied 3247 place count 13 transition count 16
Applied a total of 3247 rules in 527 ms. Remains 13 /1435 variables (removed 1422) and now considering 16/2473 (removed 2457) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/1435 places, 16/2473 transitions.
Finished random walk after 67 steps, including 0 resets, run visited all 8 properties in 2 ms. (steps per millisecond=33 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3 (NOT p2) p1))), (X (NOT (AND p3 (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p3) (NOT p2) p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3 (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 p1)))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2) p1 p3))), (G (NOT (AND (NOT p0) p1 p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) (NOT p1) p3)), (F (AND p0 (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p2) p1 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) p1 p3)), (F p3), (F (AND p0 p3)), (F (AND (NOT p0) p3)), (F (AND p0 (NOT p2) (NOT p1) p3)), (F (AND (NOT p0) (NOT p2) (NOT p1) p3)), (F (AND (NOT p2) p1 p3)), (F (AND p0 (NOT p2) p3)), (F (AND (NOT p2) p1 (NOT p3))), (F (AND p0 (NOT p1) p3)), (F (AND (NOT p0) (NOT p1) p3)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND (NOT p1) p3)), (F (AND p0 p1 p3)), (F (AND p1 (NOT p3))), (F (AND p1 p3)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 36 factoid took 3908 ms. Reduced automaton from 6 states, 33 edges and 4 AP to 5 states, 23 edges and 4 AP.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 2473 rows 1435 cols
[2022-05-14 23:30:36] [INFO ] Computed 109 place invariants in 7 ms
[2022-05-14 23:30:37] [INFO ] [Real]Absence check using 109 positive place invariants in 43 ms returned unsat
Proved EG (NOT p2)
// Phase 1: matrix 2473 rows 1435 cols
[2022-05-14 23:30:37] [INFO ] Computed 109 place invariants in 15 ms
[2022-05-14 23:30:38] [INFO ] [Real]Absence check using 109 positive place invariants in 110 ms returned sat
[2022-05-14 23:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:30:41] [INFO ] [Real]Absence check using state equation in 2574 ms returned sat
[2022-05-14 23:30:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:30:42] [INFO ] [Nat]Absence check using 109 positive place invariants in 117 ms returned sat
[2022-05-14 23:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:30:45] [INFO ] [Nat]Absence check using state equation in 2827 ms returned sat
[2022-05-14 23:30:45] [INFO ] Computed and/alt/rep : 2311/3941/2311 causal constraints (skipped 161 transitions) in 155 ms.
[2022-05-14 23:30:57] [INFO ] Deduced a trap composed of 13 places in 676 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-14 23:30:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p3)
Could not prove EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3 (NOT p2) p1))), (X (NOT (AND p3 (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p3) (NOT p2) p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3 (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 p1)))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2) p1 p3))), (G (NOT (AND (NOT p0) p1 p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p2) (NOT p1) p3)), (F (AND p0 (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p2) p1 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) p1 p3)), (F p3), (F (AND p0 p3)), (F (AND (NOT p0) p3)), (F (AND p0 (NOT p2) (NOT p1) p3)), (F (AND (NOT p0) (NOT p2) (NOT p1) p3)), (F (AND (NOT p2) p1 p3)), (F (AND p0 (NOT p2) p3)), (F (AND (NOT p2) p1 (NOT p3))), (F (AND p0 (NOT p1) p3)), (F (AND (NOT p0) (NOT p1) p3)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND (NOT p1) p3)), (F (AND p0 p1 p3)), (F (AND p1 (NOT p3))), (F (AND p1 p3)), (F (AND p0 (NOT 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 36 factoid took 2369 ms. Reduced automaton from 5 states, 23 edges and 4 AP to 1 states, 1 edges and 0 AP.
FORMULA DLCround-PT-06b-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-07 finished in 39655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 2 out of 1461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Graph (trivial) has 1323 edges and 1461 vertex of which 379 / 1461 are part of one of the 33 SCC in 2 ms
Free SCC test removed 346 places
Ensure Unique test removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 1114 transition count 1894
Reduce places removed 242 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 273 rules applied. Total rules applied 516 place count 872 transition count 1863
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 536 place count 852 transition count 1863
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 536 place count 852 transition count 1751
Deduced a syphon composed of 112 places in 4 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 760 place count 740 transition count 1751
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 814 place count 686 transition count 1439
Iterating global reduction 3 with 54 rules applied. Total rules applied 868 place count 686 transition count 1439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 872 place count 686 transition count 1435
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 872 place count 686 transition count 1428
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 886 place count 679 transition count 1428
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 1394 place count 425 transition count 1167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1401 place count 425 transition count 1160
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1420 place count 406 transition count 982
Iterating global reduction 5 with 19 rules applied. Total rules applied 1439 place count 406 transition count 982
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1455 place count 406 transition count 966
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1457 place count 405 transition count 965
Performed 18 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1493 place count 387 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1494 place count 387 transition count 1105
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1498 place count 383 transition count 1043
Iterating global reduction 7 with 4 rules applied. Total rules applied 1502 place count 383 transition count 1043
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1531 place count 383 transition count 1014
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 1559 place count 383 transition count 986
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1571 place count 371 transition count 962
Iterating global reduction 8 with 12 rules applied. Total rules applied 1583 place count 371 transition count 962
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1595 place count 359 transition count 840
Iterating global reduction 8 with 12 rules applied. Total rules applied 1607 place count 359 transition count 840
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1619 place count 359 transition count 828
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1620 place count 358 transition count 827
Applied a total of 1620 rules in 160 ms. Remains 358 /1461 variables (removed 1103) and now considering 827/2509 (removed 1682) transitions.
[2022-05-14 23:30:59] [INFO ] Flow matrix only has 802 transitions (discarded 25 similar events)
// Phase 1: matrix 802 rows 358 cols
[2022-05-14 23:30:59] [INFO ] Computed 109 place invariants in 4 ms
[2022-05-14 23:30:59] [INFO ] Implicit Places using invariants in 150 ms returned []
[2022-05-14 23:30:59] [INFO ] Flow matrix only has 802 transitions (discarded 25 similar events)
// Phase 1: matrix 802 rows 358 cols
[2022-05-14 23:30:59] [INFO ] Computed 109 place invariants in 2 ms
[2022-05-14 23:31:00] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-14 23:31:00] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2022-05-14 23:31:00] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-14 23:31:00] [INFO ] Flow matrix only has 802 transitions (discarded 25 similar events)
// Phase 1: matrix 802 rows 358 cols
[2022-05-14 23:31:00] [INFO ] Computed 109 place invariants in 1 ms
[2022-05-14 23:31:00] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/1461 places, 827/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 358/1461 places, 827/2509 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s9 1), p0:(EQ s61 1)], nbAcceptance=0, 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 1061 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1446 transition count 2485
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1446 transition count 2485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1446 transition count 2484
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 1440 transition count 2478
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 1440 transition count 2478
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 1437 transition count 2475
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 1437 transition count 2475
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 1434 transition count 2472
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 1434 transition count 2472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 1432 transition count 2470
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1431 transition count 2469
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1430 transition count 2468
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1430 transition count 2468
Applied a total of 63 rules in 236 ms. Remains 1430 /1461 variables (removed 31) and now considering 2468/2509 (removed 41) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2022-05-14 23:31:00] [INFO ] Computed 109 place invariants in 13 ms
[2022-05-14 23:31:01] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 2468 rows 1430 cols
[2022-05-14 23:31:01] [INFO ] Computed 109 place invariants in 13 ms
[2022-05-14 23:31:02] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
// Phase 1: matrix 2468 rows 1430 cols
[2022-05-14 23:31:02] [INFO ] Computed 109 place invariants in 9 ms
[2022-05-14 23:31:03] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1430/1461 places, 2468/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1461 places, 2468/2509 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s1069 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 104 reset in 428 ms.
Product exploration explored 100000 steps with 105 reset in 399 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 884 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=176 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2468 rows 1430 cols
[2022-05-14 23:31:04] [INFO ] Computed 109 place invariants in 13 ms
[2022-05-14 23:31:06] [INFO ] [Real]Absence check using 109 positive place invariants in 215 ms returned sat
[2022-05-14 23:31:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:31:10] [INFO ] [Real]Absence check using state equation in 4002 ms returned sat
[2022-05-14 23:31:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:31:11] [INFO ] [Nat]Absence check using 109 positive place invariants in 114 ms returned sat
[2022-05-14 23:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:31:14] [INFO ] [Nat]Absence check using state equation in 2747 ms returned sat
[2022-05-14 23:31:14] [INFO ] Computed and/alt/rep : 2306/3936/2306 causal constraints (skipped 161 transitions) in 110 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-14 23:31:25] [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 p0)
Could not prove EG (NOT p0)
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1430/1430 places, 2468/2468 transitions.
Applied a total of 0 rules in 36 ms. Remains 1430 /1430 variables (removed 0) and now considering 2468/2468 (removed 0) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2022-05-14 23:31:25] [INFO ] Computed 109 place invariants in 9 ms
[2022-05-14 23:31:26] [INFO ] Implicit Places using invariants in 367 ms returned []
// Phase 1: matrix 2468 rows 1430 cols
[2022-05-14 23:31:26] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:31:27] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
// Phase 1: matrix 2468 rows 1430 cols
[2022-05-14 23:31:27] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:31:28] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 2468/2468 transitions.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 988 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=197 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2468 rows 1430 cols
[2022-05-14 23:31:29] [INFO ] Computed 109 place invariants in 9 ms
[2022-05-14 23:31:30] [INFO ] [Real]Absence check using 109 positive place invariants in 127 ms returned sat
[2022-05-14 23:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:31:32] [INFO ] [Real]Absence check using state equation in 2653 ms returned sat
[2022-05-14 23:31:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:31:33] [INFO ] [Nat]Absence check using 109 positive place invariants in 127 ms returned sat
[2022-05-14 23:31:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:31:36] [INFO ] [Nat]Absence check using state equation in 2687 ms returned sat
[2022-05-14 23:31:36] [INFO ] Computed and/alt/rep : 2306/3936/2306 causal constraints (skipped 161 transitions) in 103 ms.
[2022-05-14 23:31:47] [INFO ] Added : 510 causal constraints over 102 iterations in 11323 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 104 reset in 312 ms.
Product exploration explored 100000 steps with 103 reset in 343 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1430/1430 places, 2468/2468 transitions.
Graph (trivial) has 1293 edges and 1430 vertex of which 389 / 1430 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.
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 226 rules applied. Total rules applied 227 place count 1073 transition count 2082
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 22 rules applied. Total rules applied 249 place count 1073 transition count 2071
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 249 place count 1073 transition count 2075
Deduced a syphon composed of 246 places in 4 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 258 place count 1073 transition count 2075
Discarding 121 places :
Symmetric choice reduction at 2 with 121 rule applications. Total rules 379 place count 952 transition count 1678
Deduced a syphon composed of 175 places in 3 ms
Iterating global reduction 2 with 121 rules applied. Total rules applied 500 place count 952 transition count 1678
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 504 place count 952 transition count 1674
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 525 places in 0 ms
Iterating global reduction 3 with 350 rules applied. Total rules applied 854 place count 952 transition count 1681
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 861 place count 952 transition count 1674
Renaming transitions due to excessive name length > 1024 char.
Discarding 261 places :
Symmetric choice reduction at 4 with 261 rule applications. Total rules 1122 place count 691 transition count 1263
Deduced a syphon composed of 282 places in 0 ms
Iterating global reduction 4 with 261 rules applied. Total rules applied 1383 place count 691 transition count 1263
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1401 place count 691 transition count 1245
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1408 place count 684 transition count 1238
Deduced a syphon composed of 275 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1415 place count 684 transition count 1238
Performed 29 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 304 places in 0 ms
Iterating global reduction 5 with 29 rules applied. Total rules applied 1444 place count 684 transition count 1461
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1459 place count 684 transition count 1446
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1499 place count 644 transition count 1307
Deduced a syphon composed of 268 places in 1 ms
Iterating global reduction 6 with 40 rules applied. Total rules applied 1539 place count 644 transition count 1307
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1571 place count 644 transition count 1275
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1579 place count 636 transition count 1259
Deduced a syphon composed of 260 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1587 place count 636 transition count 1259
Deduced a syphon composed of 260 places in 0 ms
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1621 place count 636 transition count 1225
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1635 place count 622 transition count 1197
Deduced a syphon composed of 260 places in 0 ms
Iterating global reduction 7 with 14 rules applied. Total rules applied 1649 place count 622 transition count 1197
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1663 place count 608 transition count 1051
Deduced a syphon composed of 260 places in 0 ms
Iterating global reduction 7 with 14 rules applied. Total rules applied 1677 place count 608 transition count 1051
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1698 place count 608 transition count 1030
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1712 place count 594 transition count 1009
Deduced a syphon composed of 246 places in 0 ms
Iterating global reduction 8 with 14 rules applied. Total rules applied 1726 place count 594 transition count 1009
Deduced a syphon composed of 246 places in 0 ms
Applied a total of 1726 rules in 570 ms. Remains 594 /1430 variables (removed 836) and now considering 1009/2468 (removed 1459) transitions.
[2022-05-14 23:31:49] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-14 23:31:49] [INFO ] Flow matrix only has 990 transitions (discarded 19 similar events)
// Phase 1: matrix 990 rows 594 cols
[2022-05-14 23:31:49] [INFO ] Computed 109 place invariants in 16 ms
[2022-05-14 23:31:49] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 594/1430 places, 1009/2468 transitions.
Finished structural reductions, in 1 iterations. Remains : 594/1430 places, 1009/2468 transitions.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-12 finished in 49255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Graph (trivial) has 1326 edges and 1461 vertex of which 400 / 1461 are part of one of the 32 SCC in 1 ms
Free SCC test removed 368 places
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 235 place count 1092 transition count 1877
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 268 rules applied. Total rules applied 503 place count 858 transition count 1843
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 525 place count 836 transition count 1843
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 525 place count 836 transition count 1735
Deduced a syphon composed of 108 places in 4 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 741 place count 728 transition count 1735
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 798 place count 671 transition count 1411
Iterating global reduction 3 with 57 rules applied. Total rules applied 855 place count 671 transition count 1411
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 859 place count 671 transition count 1407
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 859 place count 671 transition count 1400
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 873 place count 664 transition count 1400
Performed 248 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 248 places in 1 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 4 with 496 rules applied. Total rules applied 1369 place count 416 transition count 1145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1376 place count 416 transition count 1138
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1395 place count 397 transition count 960
Iterating global reduction 5 with 19 rules applied. Total rules applied 1414 place count 397 transition count 960
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1432 place count 397 transition count 942
Performed 16 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1464 place count 381 transition count 1067
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1468 place count 377 transition count 1005
Iterating global reduction 6 with 4 rules applied. Total rules applied 1472 place count 377 transition count 1005
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1501 place count 377 transition count 976
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 7 with 29 rules applied. Total rules applied 1530 place count 377 transition count 947
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1543 place count 364 transition count 921
Iterating global reduction 7 with 13 rules applied. Total rules applied 1556 place count 364 transition count 921
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1569 place count 351 transition count 789
Iterating global reduction 7 with 13 rules applied. Total rules applied 1582 place count 351 transition count 789
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1595 place count 351 transition count 776
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1596 place count 350 transition count 775
Applied a total of 1596 rules in 155 ms. Remains 350 /1461 variables (removed 1111) and now considering 775/2509 (removed 1734) transitions.
[2022-05-14 23:31:50] [INFO ] Flow matrix only has 752 transitions (discarded 23 similar events)
// Phase 1: matrix 752 rows 350 cols
[2022-05-14 23:31:50] [INFO ] Computed 109 place invariants in 3 ms
[2022-05-14 23:31:50] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-14 23:31:50] [INFO ] Flow matrix only has 752 transitions (discarded 23 similar events)
// Phase 1: matrix 752 rows 350 cols
[2022-05-14 23:31:50] [INFO ] Computed 109 place invariants in 1 ms
[2022-05-14 23:31:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-14 23:31:50] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2022-05-14 23:31:50] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-14 23:31:50] [INFO ] Flow matrix only has 752 transitions (discarded 23 similar events)
// Phase 1: matrix 752 rows 350 cols
[2022-05-14 23:31:50] [INFO ] Computed 109 place invariants in 1 ms
[2022-05-14 23:31:50] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 350/1461 places, 775/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 350/1461 places, 775/2509 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-13 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 s29 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-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-13 finished in 1080 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&!(p1 U p2)&&p0)))'
Support contains 5 out of 1461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Graph (trivial) has 1321 edges and 1461 vertex of which 400 / 1461 are part of one of the 32 SCC in 1 ms
Free SCC test removed 368 places
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 233 place count 1092 transition count 1879
Reduce places removed 232 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 266 rules applied. Total rules applied 499 place count 860 transition count 1845
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 521 place count 838 transition count 1845
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 521 place count 838 transition count 1736
Deduced a syphon composed of 109 places in 3 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 739 place count 729 transition count 1736
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 793 place count 675 transition count 1415
Iterating global reduction 3 with 54 rules applied. Total rules applied 847 place count 675 transition count 1415
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 851 place count 675 transition count 1411
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 851 place count 675 transition count 1407
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 859 place count 671 transition count 1407
Performed 252 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 252 places in 0 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 4 with 504 rules applied. Total rules applied 1363 place count 419 transition count 1148
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1370 place count 419 transition count 1141
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1390 place count 399 transition count 953
Iterating global reduction 5 with 20 rules applied. Total rules applied 1410 place count 399 transition count 953
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1428 place count 399 transition count 935
Performed 16 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1460 place count 383 transition count 1062
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1463 place count 380 transition count 1016
Iterating global reduction 6 with 3 rules applied. Total rules applied 1466 place count 380 transition count 1016
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1487 place count 380 transition count 995
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 7 with 40 rules applied. Total rules applied 1527 place count 380 transition count 955
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1541 place count 366 transition count 927
Iterating global reduction 7 with 14 rules applied. Total rules applied 1555 place count 366 transition count 927
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1569 place count 352 transition count 783
Iterating global reduction 7 with 14 rules applied. Total rules applied 1583 place count 352 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 1597 place count 352 transition count 769
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1598 place count 351 transition count 768
Applied a total of 1598 rules in 153 ms. Remains 351 /1461 variables (removed 1110) and now considering 768/2509 (removed 1741) transitions.
[2022-05-14 23:31:51] [INFO ] Flow matrix only has 743 transitions (discarded 25 similar events)
// Phase 1: matrix 743 rows 351 cols
[2022-05-14 23:31:51] [INFO ] Computed 109 place invariants in 4 ms
[2022-05-14 23:31:51] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-14 23:31:51] [INFO ] Flow matrix only has 743 transitions (discarded 25 similar events)
// Phase 1: matrix 743 rows 351 cols
[2022-05-14 23:31:51] [INFO ] Computed 109 place invariants in 1 ms
[2022-05-14 23:31:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-14 23:31:51] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2022-05-14 23:31:51] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-14 23:31:51] [INFO ] Flow matrix only has 743 transitions (discarded 25 similar events)
// Phase 1: matrix 743 rows 351 cols
[2022-05-14 23:31:51] [INFO ] Computed 109 place invariants in 1 ms
[2022-05-14 23:31:51] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/1461 places, 768/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/1461 places, 768/2509 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) p2), p2]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s255 1), p2:(OR (EQ s84 1) (AND (EQ s2 1) (EQ s177 1))), p1:(EQ s301 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-14 finished in 983 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(G(X(X(p0))))) U (p1 U p2))))'
Support contains 4 out of 1461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1461/1461 places, 2509/2509 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1447 transition count 2486
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1447 transition count 2486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1447 transition count 2485
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 1442 transition count 2480
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 1442 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1440 transition count 2478
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1440 transition count 2478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1438 transition count 2476
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1438 transition count 2476
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1436 transition count 2474
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1436 transition count 2474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1435 transition count 2473
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1435 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1434 transition count 2472
Applied a total of 55 rules in 315 ms. Remains 1434 /1461 variables (removed 27) and now considering 2472/2509 (removed 37) transitions.
// Phase 1: matrix 2472 rows 1434 cols
[2022-05-14 23:31:52] [INFO ] Computed 109 place invariants in 9 ms
[2022-05-14 23:31:52] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 2472 rows 1434 cols
[2022-05-14 23:31:52] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:31:53] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1431 ms to find 0 implicit places.
// Phase 1: matrix 2472 rows 1434 cols
[2022-05-14 23:31:53] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:31:54] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1434/1461 places, 2472/2509 transitions.
Finished structural reductions, in 1 iterations. Remains : 1434/1461 places, 2472/2509 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s427 1), p1:(AND (EQ s323 1) (EQ s1234 1)), p0:(EQ s1031 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 415 ms.
Product exploration explored 100000 steps with 0 reset in 557 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 (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p2)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 437 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Finished random walk after 944 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=134 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p2)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 300 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
// Phase 1: matrix 2472 rows 1434 cols
[2022-05-14 23:31:56] [INFO ] Computed 109 place invariants in 9 ms
[2022-05-14 23:31:57] [INFO ] [Real]Absence check using 109 positive place invariants in 106 ms returned sat
[2022-05-14 23:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:32:00] [INFO ] [Real]Absence check using state equation in 2852 ms returned sat
[2022-05-14 23:32:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:32:01] [INFO ] [Nat]Absence check using 109 positive place invariants in 117 ms returned sat
[2022-05-14 23:32:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:32:04] [INFO ] [Nat]Absence check using state equation in 2800 ms returned sat
[2022-05-14 23:32:04] [INFO ] Computed and/alt/rep : 2310/3940/2310 causal constraints (skipped 161 transitions) in 131 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-14 23:32:15] [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 p2)
Could not prove EG (NOT p2)
// Phase 1: matrix 2472 rows 1434 cols
[2022-05-14 23:32:15] [INFO ] Computed 109 place invariants in 8 ms
[2022-05-14 23:32:16] [INFO ] [Real]Absence check using 109 positive place invariants in 116 ms returned sat
[2022-05-14 23:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:32:19] [INFO ] [Real]Absence check using state equation in 3037 ms returned sat
[2022-05-14 23:32:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:32:20] [INFO ] [Nat]Absence check using 109 positive place invariants in 113 ms returned sat
[2022-05-14 23:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:32:23] [INFO ] [Nat]Absence check using state equation in 2885 ms returned sat
[2022-05-14 23:32:23] [INFO ] Computed and/alt/rep : 2310/3940/2310 causal constraints (skipped 161 transitions) in 114 ms.
[2022-05-14 23:32:35] [INFO ] Deduced a trap composed of 9 places in 629 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-14 23:32:35] [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 p0)
Could not prove EG (NOT p0)
Support contains 4 out of 1434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1434/1434 places, 2472/2472 transitions.
Applied a total of 0 rules in 35 ms. Remains 1434 /1434 variables (removed 0) and now considering 2472/2472 (removed 0) transitions.
// Phase 1: matrix 2472 rows 1434 cols
[2022-05-14 23:32:35] [INFO ] Computed 109 place invariants in 12 ms
[2022-05-14 23:32:35] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 2472 rows 1434 cols
[2022-05-14 23:32:35] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:32:36] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
// Phase 1: matrix 2472 rows 1434 cols
[2022-05-14 23:32:36] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:32:37] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1434/1434 places, 2472/2472 transitions.
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 (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 254 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Finished random walk after 2584 steps, including 0 resets, run visited all 3 properties in 89 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
// Phase 1: matrix 2472 rows 1434 cols
[2022-05-14 23:32:39] [INFO ] Computed 109 place invariants in 13 ms
[2022-05-14 23:32:39] [INFO ] [Real]Absence check using 109 positive place invariants in 105 ms returned sat
[2022-05-14 23:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:32:42] [INFO ] [Real]Absence check using state equation in 2876 ms returned sat
[2022-05-14 23:32:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:32:43] [INFO ] [Nat]Absence check using 109 positive place invariants in 120 ms returned sat
[2022-05-14 23:32:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:32:46] [INFO ] [Nat]Absence check using state equation in 2777 ms returned sat
[2022-05-14 23:32:46] [INFO ] Computed and/alt/rep : 2310/3940/2310 causal constraints (skipped 161 transitions) in 110 ms.
[2022-05-14 23:32:58] [INFO ] Deduced a trap composed of 9 places in 603 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-14 23:32:58] [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 p2)
Could not prove EG (NOT p2)
// Phase 1: matrix 2472 rows 1434 cols
[2022-05-14 23:32:58] [INFO ] Computed 109 place invariants in 7 ms
[2022-05-14 23:32:59] [INFO ] [Real]Absence check using 109 positive place invariants in 113 ms returned sat
[2022-05-14 23:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:33:02] [INFO ] [Real]Absence check using state equation in 2933 ms returned sat
[2022-05-14 23:33:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:33:03] [INFO ] [Nat]Absence check using 109 positive place invariants in 114 ms returned sat
[2022-05-14 23:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:33:06] [INFO ] [Nat]Absence check using state equation in 2911 ms returned sat
[2022-05-14 23:33:06] [INFO ] Computed and/alt/rep : 2310/3940/2310 causal constraints (skipped 161 transitions) in 109 ms.
[2022-05-14 23:33:17] [INFO ] Deduced a trap composed of 9 places in 604 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-14 23:33:17] [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 p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Product exploration explored 100000 steps with 0 reset in 532 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Support contains 4 out of 1434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1434/1434 places, 2472/2472 transitions.
Graph (trivial) has 1293 edges and 1434 vertex of which 389 / 1434 are part of one of the 32 SCC in 1 ms
Free SCC test removed 357 places
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 385 transitions.
Performed 228 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 228 rules applied. Total rules applied 229 place count 1077 transition count 2087
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 22 rules applied. Total rules applied 251 place count 1077 transition count 2076
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 251 place count 1077 transition count 2080
Deduced a syphon composed of 248 places in 4 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 260 place count 1077 transition count 2080
Discarding 121 places :
Symmetric choice reduction at 2 with 121 rule applications. Total rules 381 place count 956 transition count 1692
Deduced a syphon composed of 176 places in 3 ms
Iterating global reduction 2 with 121 rules applied. Total rules applied 502 place count 956 transition count 1692
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 506 place count 956 transition count 1688
Performed 350 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 526 places in 1 ms
Iterating global reduction 3 with 350 rules applied. Total rules applied 856 place count 956 transition count 1695
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 863 place count 956 transition count 1688
Renaming transitions due to excessive name length > 1024 char.
Discarding 261 places :
Symmetric choice reduction at 4 with 261 rule applications. Total rules 1124 place count 695 transition count 1277
Deduced a syphon composed of 283 places in 0 ms
Iterating global reduction 4 with 261 rules applied. Total rules applied 1385 place count 695 transition count 1277
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1403 place count 695 transition count 1259
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1410 place count 688 transition count 1252
Deduced a syphon composed of 276 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1417 place count 688 transition count 1252
Performed 29 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 305 places in 0 ms
Iterating global reduction 5 with 29 rules applied. Total rules applied 1446 place count 688 transition count 1475
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1461 place count 688 transition count 1460
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1501 place count 648 transition count 1321
Deduced a syphon composed of 269 places in 1 ms
Iterating global reduction 6 with 40 rules applied. Total rules applied 1541 place count 648 transition count 1321
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1573 place count 648 transition count 1289
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1581 place count 640 transition count 1273
Deduced a syphon composed of 261 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1589 place count 640 transition count 1273
Deduced a syphon composed of 261 places in 0 ms
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 7 with 33 rules applied. Total rules applied 1622 place count 640 transition count 1240
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1635 place count 627 transition count 1214
Deduced a syphon composed of 261 places in 0 ms
Iterating global reduction 7 with 13 rules applied. Total rules applied 1648 place count 627 transition count 1214
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1661 place count 614 transition count 1078
Deduced a syphon composed of 261 places in 0 ms
Iterating global reduction 7 with 13 rules applied. Total rules applied 1674 place count 614 transition count 1078
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1693 place count 614 transition count 1059
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1705 place count 602 transition count 1041
Deduced a syphon composed of 249 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 1717 place count 602 transition count 1041
Deduced a syphon composed of 249 places in 0 ms
Applied a total of 1717 rules in 402 ms. Remains 602 /1434 variables (removed 832) and now considering 1041/2472 (removed 1431) transitions.
[2022-05-14 23:33:19] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-14 23:33:19] [INFO ] Flow matrix only has 1021 transitions (discarded 20 similar events)
// Phase 1: matrix 1021 rows 602 cols
[2022-05-14 23:33:19] [INFO ] Computed 109 place invariants in 19 ms
[2022-05-14 23:33:20] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 602/1434 places, 1041/2472 transitions.
Finished structural reductions, in 1 iterations. Remains : 602/1434 places, 1041/2472 transitions.
Stuttering criterion allowed to conclude after 156 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 88127 ms.
All properties solved by simple procedures.
Total runtime 233194 ms.

BK_STOP 1652571200131

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DLCround-PT-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 r060-tall-165254771700172"
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 ;