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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.0K Apr 30 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 07:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 07:30 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.4K May 9 07:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 674K 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-05b-LTLFireability-00
FORMULA_NAME DLCround-PT-05b-LTLFireability-01
FORMULA_NAME DLCround-PT-05b-LTLFireability-02
FORMULA_NAME DLCround-PT-05b-LTLFireability-03
FORMULA_NAME DLCround-PT-05b-LTLFireability-04
FORMULA_NAME DLCround-PT-05b-LTLFireability-05
FORMULA_NAME DLCround-PT-05b-LTLFireability-06
FORMULA_NAME DLCround-PT-05b-LTLFireability-07
FORMULA_NAME DLCround-PT-05b-LTLFireability-08
FORMULA_NAME DLCround-PT-05b-LTLFireability-09
FORMULA_NAME DLCround-PT-05b-LTLFireability-10
FORMULA_NAME DLCround-PT-05b-LTLFireability-11
FORMULA_NAME DLCround-PT-05b-LTLFireability-12
FORMULA_NAME DLCround-PT-05b-LTLFireability-13
FORMULA_NAME DLCround-PT-05b-LTLFireability-14
FORMULA_NAME DLCround-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652570510027

Running Version 202205111006
[2022-05-14 23:21:51] [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:21:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 23:21:51] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2022-05-14 23:21:51] [INFO ] Transformed 1999 places.
[2022-05-14 23:21:51] [INFO ] Transformed 2887 transitions.
[2022-05-14 23:21:51] [INFO ] Found NUPN structural information;
[2022-05-14 23:21:51] [INFO ] Parsed PT model containing 1999 places and 2887 transitions in 306 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DLCround-PT-05b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1999/1999 places, 2887/2887 transitions.
Discarding 344 places :
Symmetric choice reduction at 0 with 344 rule applications. Total rules 344 place count 1655 transition count 2543
Iterating global reduction 0 with 344 rules applied. Total rules applied 688 place count 1655 transition count 2543
Discarding 263 places :
Symmetric choice reduction at 0 with 263 rule applications. Total rules 951 place count 1392 transition count 2280
Iterating global reduction 0 with 263 rules applied. Total rules applied 1214 place count 1392 transition count 2280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1220 place count 1392 transition count 2274
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 1268 place count 1344 transition count 2191
Iterating global reduction 1 with 48 rules applied. Total rules applied 1316 place count 1344 transition count 2191
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 1346 place count 1314 transition count 2161
Iterating global reduction 1 with 30 rules applied. Total rules applied 1376 place count 1314 transition count 2161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1379 place count 1314 transition count 2158
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1394 place count 1299 transition count 2143
Iterating global reduction 2 with 15 rules applied. Total rules applied 1409 place count 1299 transition count 2143
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1423 place count 1285 transition count 2129
Iterating global reduction 2 with 14 rules applied. Total rules applied 1437 place count 1285 transition count 2129
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1451 place count 1271 transition count 2115
Iterating global reduction 2 with 14 rules applied. Total rules applied 1465 place count 1271 transition count 2115
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1476 place count 1260 transition count 2104
Iterating global reduction 2 with 11 rules applied. Total rules applied 1487 place count 1260 transition count 2104
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1494 place count 1253 transition count 2097
Iterating global reduction 2 with 7 rules applied. Total rules applied 1501 place count 1253 transition count 2097
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1508 place count 1246 transition count 2090
Iterating global reduction 2 with 7 rules applied. Total rules applied 1515 place count 1246 transition count 2090
Applied a total of 1515 rules in 1007 ms. Remains 1246 /1999 variables (removed 753) and now considering 2090/2887 (removed 797) transitions.
// Phase 1: matrix 2090 rows 1246 cols
[2022-05-14 23:21:52] [INFO ] Computed 88 place invariants in 61 ms
[2022-05-14 23:21:54] [INFO ] Implicit Places using invariants in 1228 ms returned []
// Phase 1: matrix 2090 rows 1246 cols
[2022-05-14 23:21:54] [INFO ] Computed 88 place invariants in 9 ms
[2022-05-14 23:21:54] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 2248 ms to find 0 implicit places.
// Phase 1: matrix 2090 rows 1246 cols
[2022-05-14 23:21:55] [INFO ] Computed 88 place invariants in 7 ms
[2022-05-14 23:21:55] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1246/1999 places, 2090/2887 transitions.
Finished structural reductions, in 1 iterations. Remains : 1246/1999 places, 2090/2887 transitions.
Support contains 38 out of 1246 places after structural reductions.
[2022-05-14 23:21:56] [INFO ] Flatten gal took : 147 ms
[2022-05-14 23:21:56] [INFO ] Flatten gal took : 95 ms
[2022-05-14 23:21:56] [INFO ] Input system was already deterministic with 2090 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 32) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2090 rows 1246 cols
[2022-05-14 23:21:57] [INFO ] Computed 88 place invariants in 9 ms
[2022-05-14 23:21:57] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-14 23:21:57] [INFO ] [Nat]Absence check using 88 positive place invariants in 44 ms returned sat
[2022-05-14 23:21:58] [INFO ] After 915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-14 23:21:59] [INFO ] After 1571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 350 ms.
[2022-05-14 23:21:59] [INFO ] After 2376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 5 properties in 26 ms.
Support contains 1 out of 1246 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Graph (trivial) has 1143 edges and 1246 vertex of which 355 / 1246 are part of one of the 28 SCC in 7 ms
Free SCC test removed 327 places
Drop transitions removed 371 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 382 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 919 transition count 1505
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 235 rules applied. Total rules applied 439 place count 716 transition count 1473
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 460 place count 695 transition count 1473
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 460 place count 695 transition count 1385
Deduced a syphon composed of 88 places in 5 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 636 place count 607 transition count 1385
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 689 place count 554 transition count 1112
Iterating global reduction 3 with 53 rules applied. Total rules applied 742 place count 554 transition count 1112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 746 place count 554 transition count 1108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 746 place count 554 transition count 1101
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 760 place count 547 transition count 1101
Performed 203 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 203 places in 0 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 4 with 406 rules applied. Total rules applied 1166 place count 344 transition count 893
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1172 place count 344 transition count 887
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1188 place count 328 transition count 755
Iterating global reduction 5 with 16 rules applied. Total rules applied 1204 place count 328 transition count 755
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1220 place count 328 transition count 739
Performed 34 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 1288 place count 294 transition count 977
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1301 place count 294 transition count 964
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1317 place count 278 transition count 695
Iterating global reduction 7 with 16 rules applied. Total rules applied 1333 place count 278 transition count 695
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 7 with 37 rules applied. Total rules applied 1370 place count 278 transition count 658
Drop transitions removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 8 with 74 rules applied. Total rules applied 1444 place count 278 transition count 584
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1450 place count 272 transition count 529
Iterating global reduction 8 with 6 rules applied. Total rules applied 1456 place count 272 transition count 529
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1462 place count 272 transition count 523
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1470 place count 268 transition count 550
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1475 place count 268 transition count 545
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 1497 place count 268 transition count 523
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 1505 place count 264 transition count 550
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1511 place count 264 transition count 544
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 1532 place count 264 transition count 523
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 1540 place count 260 transition count 550
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1546 place count 260 transition count 544
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1567 place count 260 transition count 523
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 1575 place count 256 transition count 550
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1581 place count 256 transition count 544
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1602 place count 256 transition count 523
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 1610 place count 252 transition count 550
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1616 place count 252 transition count 544
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1637 place count 252 transition count 523
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 1645 place count 248 transition count 550
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1651 place count 248 transition count 544
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1672 place count 248 transition count 523
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 1680 place count 244 transition count 550
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1686 place count 244 transition count 544
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1707 place count 244 transition count 523
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 16 with 8 rules applied. Total rules applied 1715 place count 240 transition count 552
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1721 place count 240 transition count 546
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 1742 place count 240 transition count 525
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 17 with 8 rules applied. Total rules applied 1750 place count 236 transition count 554
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 1756 place count 236 transition count 548
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 1777 place count 236 transition count 527
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 1785 place count 232 transition count 554
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 1791 place count 232 transition count 548
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 1812 place count 232 transition count 527
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 1820 place count 228 transition count 554
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 1826 place count 228 transition count 548
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 1847 place count 228 transition count 527
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 20 with 8 rules applied. Total rules applied 1855 place count 224 transition count 546
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 1859 place count 224 transition count 542
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 21 with 19 rules applied. Total rules applied 1878 place count 224 transition count 523
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 21 with 8 rules applied. Total rules applied 1886 place count 220 transition count 542
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 1890 place count 220 transition count 538
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 22 with 19 rules applied. Total rules applied 1909 place count 220 transition count 519
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 1917 place count 216 transition count 538
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 1921 place count 216 transition count 534
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 23 with 19 rules applied. Total rules applied 1940 place count 216 transition count 515
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 1948 place count 212 transition count 534
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 1952 place count 212 transition count 530
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 24 with 19 rules applied. Total rules applied 1971 place count 212 transition count 511
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 1979 place count 208 transition count 530
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 1983 place count 208 transition count 526
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 25 with 19 rules applied. Total rules applied 2002 place count 208 transition count 507
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 25 with 8 rules applied. Total rules applied 2010 place count 204 transition count 530
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 2014 place count 204 transition count 526
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 26 with 19 rules applied. Total rules applied 2033 place count 204 transition count 507
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 26 with 8 rules applied. Total rules applied 2041 place count 200 transition count 527
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 2045 place count 200 transition count 523
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 27 with 19 rules applied. Total rules applied 2064 place count 200 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 27 with 4 rules applied. Total rules applied 2068 place count 198 transition count 509
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 2070 place count 198 transition count 507
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 28 with 5 rules applied. Total rules applied 2075 place count 198 transition count 502
Free-agglomeration rule applied 25 times.
Iterating global reduction 28 with 25 rules applied. Total rules applied 2100 place count 198 transition count 477
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Graph (complete) has 492 edges and 173 vertex of which 123 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.4 ms
Discarding 50 places :
Also discarding 0 output transitions
Iterating post reduction 28 with 206 rules applied. Total rules applied 2306 place count 123 transition count 297
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 29 with 50 rules applied. Total rules applied 2356 place count 123 transition count 247
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 30 with 24 rules applied. Total rules applied 2380 place count 123 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 30 with 1 rules applied. Total rules applied 2381 place count 122 transition count 222
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 30 with 5 rules applied. Total rules applied 2386 place count 117 transition count 222
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 31 with 60 rules applied. Total rules applied 2446 place count 77 transition count 202
Drop transitions removed 20 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 31 with 56 rules applied. Total rules applied 2502 place count 77 transition count 146
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 50 places and 0 transitions.
Iterating global reduction 32 with 75 rules applied. Total rules applied 2577 place count 27 transition count 121
Drop transitions removed 45 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 70 transitions.
Graph (trivial) has 9 edges and 27 vertex of which 8 / 27 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 71 rules applied. Total rules applied 2648 place count 23 transition count 51
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 31 edges and 19 vertex of which 11 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 33 with 29 rules applied. Total rules applied 2677 place count 11 transition count 23
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 2681 place count 11 transition count 19
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 35 with 12 rules applied. Total rules applied 2693 place count 3 transition count 15
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 35 with 12 rules applied. Total rules applied 2705 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 2705 place count 3 transition count 2
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 2707 place count 2 transition count 2
Applied a total of 2707 rules in 540 ms. Remains 2 /1246 variables (removed 1244) and now considering 2/2090 (removed 2088) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/1246 places, 2/2090 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA DLCround-PT-05b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 183 stabilizing places and 183 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)&&(G(p1)||p2)))))'
Support contains 3 out of 1246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1233 transition count 2068
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1233 transition count 2068
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 1225 transition count 2060
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1225 transition count 2060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1225 transition count 2059
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 1221 transition count 2047
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 1221 transition count 2047
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 1218 transition count 2044
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 1218 transition count 2044
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1216 transition count 2042
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1216 transition count 2042
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1214 transition count 2040
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1214 transition count 2040
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1212 transition count 2038
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1212 transition count 2038
Applied a total of 69 rules in 186 ms. Remains 1212 /1246 variables (removed 34) and now considering 2038/2090 (removed 52) transitions.
// Phase 1: matrix 2038 rows 1212 cols
[2022-05-14 23:22:01] [INFO ] Computed 88 place invariants in 11 ms
[2022-05-14 23:22:01] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 2038 rows 1212 cols
[2022-05-14 23:22:01] [INFO ] Computed 88 place invariants in 6 ms
[2022-05-14 23:22:02] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
// Phase 1: matrix 2038 rows 1212 cols
[2022-05-14 23:22:02] [INFO ] Computed 88 place invariants in 6 ms
[2022-05-14 23:22:03] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1212/1246 places, 2038/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 1212/1246 places, 2038/2090 transitions.
Stuttering acceptance computed with spot in 1696 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s1165 1), p2:(EQ s459 1), p1:(OR (EQ s1126 0) (EQ s459 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 1 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-01 finished in 4047 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(G((G((X(p0)||p1))&&p2))))))'
Support contains 4 out of 1246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1233 transition count 2068
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1233 transition count 2068
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 1225 transition count 2060
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1225 transition count 2060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1225 transition count 2059
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 1221 transition count 2047
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 1221 transition count 2047
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 1218 transition count 2044
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 1218 transition count 2044
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1216 transition count 2042
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1216 transition count 2042
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1214 transition count 2040
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1214 transition count 2040
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1212 transition count 2038
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1212 transition count 2038
Applied a total of 69 rules in 193 ms. Remains 1212 /1246 variables (removed 34) and now considering 2038/2090 (removed 52) transitions.
// Phase 1: matrix 2038 rows 1212 cols
[2022-05-14 23:22:05] [INFO ] Computed 88 place invariants in 9 ms
[2022-05-14 23:22:05] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 2038 rows 1212 cols
[2022-05-14 23:22:05] [INFO ] Computed 88 place invariants in 4 ms
[2022-05-14 23:22:06] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
// Phase 1: matrix 2038 rows 1212 cols
[2022-05-14 23:22:06] [INFO ] Computed 88 place invariants in 9 ms
[2022-05-14 23:22:07] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1212/1246 places, 2038/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 1212/1246 places, 2038/2090 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(EQ s134 1), p1:(EQ s887 1), p0:(AND (EQ s417 1) (EQ s854 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-02 finished in 2447 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(F(G(F(p0)))) U p1)||p2)))'
Support contains 2 out of 1246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Graph (trivial) has 1142 edges and 1246 vertex of which 355 / 1246 are part of one of the 28 SCC in 6 ms
Free SCC test removed 327 places
Ensure Unique test removed 354 transitions
Reduce isomorphic transitions removed 354 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 203 place count 918 transition count 1533
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 234 rules applied. Total rules applied 437 place count 716 transition count 1501
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 458 place count 695 transition count 1501
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 458 place count 695 transition count 1412
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 636 place count 606 transition count 1412
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 688 place count 554 transition count 1140
Iterating global reduction 3 with 52 rules applied. Total rules applied 740 place count 554 transition count 1140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 744 place count 554 transition count 1136
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 744 place count 554 transition count 1131
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 754 place count 549 transition count 1131
Performed 203 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 203 places in 0 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 4 with 406 rules applied. Total rules applied 1160 place count 346 transition count 923
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1166 place count 346 transition count 917
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1183 place count 329 transition count 776
Iterating global reduction 5 with 17 rules applied. Total rules applied 1200 place count 329 transition count 776
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1217 place count 329 transition count 759
Performed 17 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1251 place count 312 transition count 876
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1255 place count 308 transition count 822
Iterating global reduction 6 with 4 rules applied. Total rules applied 1259 place count 308 transition count 822
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1285 place count 308 transition count 796
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 1315 place count 308 transition count 766
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1327 place count 296 transition count 742
Iterating global reduction 7 with 12 rules applied. Total rules applied 1339 place count 296 transition count 742
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1351 place count 284 transition count 630
Iterating global reduction 7 with 12 rules applied. Total rules applied 1363 place count 284 transition count 630
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1375 place count 284 transition count 618
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1376 place count 283 transition count 617
Applied a total of 1376 rules in 189 ms. Remains 283 /1246 variables (removed 963) and now considering 617/2090 (removed 1473) transitions.
[2022-05-14 23:22:07] [INFO ] Flow matrix only has 597 transitions (discarded 20 similar events)
// Phase 1: matrix 597 rows 283 cols
[2022-05-14 23:22:07] [INFO ] Computed 88 place invariants in 3 ms
[2022-05-14 23:22:07] [INFO ] Implicit Places using invariants in 119 ms returned []
[2022-05-14 23:22:07] [INFO ] Flow matrix only has 597 transitions (discarded 20 similar events)
// Phase 1: matrix 597 rows 283 cols
[2022-05-14 23:22:07] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-14 23:22:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-14 23:22:07] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2022-05-14 23:22:07] [INFO ] Redundant transitions in 37 ms returned []
[2022-05-14 23:22:08] [INFO ] Flow matrix only has 597 transitions (discarded 20 similar events)
// Phase 1: matrix 597 rows 283 cols
[2022-05-14 23:22:08] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-14 23:22:08] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/1246 places, 617/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/1246 places, 617/2090 transitions.
Stuttering acceptance computed with spot in 1047 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s155 0), p1:(EQ s242 1), p0:(EQ s155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 5 ms.
FORMULA DLCround-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-03 finished in 1940 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1232 transition count 2067
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1232 transition count 2067
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 1224 transition count 2059
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1224 transition count 2059
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 1224 transition count 2058
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 1220 transition count 2046
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 1220 transition count 2046
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 1217 transition count 2043
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 1217 transition count 2043
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 1215 transition count 2041
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 1215 transition count 2041
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 1213 transition count 2039
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 1213 transition count 2039
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 1211 transition count 2037
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 1211 transition count 2037
Applied a total of 71 rules in 215 ms. Remains 1211 /1246 variables (removed 35) and now considering 2037/2090 (removed 53) transitions.
// Phase 1: matrix 2037 rows 1211 cols
[2022-05-14 23:22:09] [INFO ] Computed 88 place invariants in 12 ms
[2022-05-14 23:22:09] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 2037 rows 1211 cols
[2022-05-14 23:22:09] [INFO ] Computed 88 place invariants in 14 ms
[2022-05-14 23:22:10] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
// Phase 1: matrix 2037 rows 1211 cols
[2022-05-14 23:22:10] [INFO ] Computed 88 place invariants in 5 ms
[2022-05-14 23:22:11] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1211/1246 places, 2037/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 1211/1246 places, 2037/2090 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s213 1) (EQ s758 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8 reset in 507 ms.
Product exploration explored 100000 steps with 12 reset in 568 ms.
Computed a total of 171 stabilizing places and 171 stable transitions
Computed a total of 171 stabilizing places and 171 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 279 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 34 ms :[(NOT p0)]
Finished random walk after 8445 steps, including 2 resets, run visited all 1 properties in 37 ms. (steps per millisecond=228 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 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 28 ms :[(NOT p0)]
// Phase 1: matrix 2037 rows 1211 cols
[2022-05-14 23:22:13] [INFO ] Computed 88 place invariants in 8 ms
[2022-05-14 23:22:13] [INFO ] [Real]Absence check using 88 positive place invariants in 32 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 3313 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA DLCround-PT-05b-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05b-LTLFireability-04 finished in 7797 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Graph (trivial) has 1143 edges and 1246 vertex of which 353 / 1246 are part of one of the 28 SCC in 3 ms
Free SCC test removed 325 places
Ensure Unique test removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 205 place count 920 transition count 1534
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 236 rules applied. Total rules applied 441 place count 716 transition count 1502
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 462 place count 695 transition count 1502
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 462 place count 695 transition count 1414
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 638 place count 607 transition count 1414
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 692 place count 553 transition count 1140
Iterating global reduction 3 with 54 rules applied. Total rules applied 746 place count 553 transition count 1140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 750 place count 553 transition count 1136
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 750 place count 553 transition count 1129
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 764 place count 546 transition count 1129
Performed 201 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 201 places in 0 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 1166 place count 345 transition count 923
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1172 place count 345 transition count 917
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1189 place count 328 transition count 776
Iterating global reduction 5 with 17 rules applied. Total rules applied 1206 place count 328 transition count 776
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1223 place count 328 transition count 759
Performed 16 Post agglomeration using F-continuation condition with reduction of 24 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 1255 place count 312 transition count 868
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1259 place count 308 transition count 814
Iterating global reduction 6 with 4 rules applied. Total rules applied 1263 place count 308 transition count 814
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1288 place count 308 transition count 789
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 7 with 27 rules applied. Total rules applied 1315 place count 308 transition count 762
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1327 place count 296 transition count 738
Iterating global reduction 7 with 12 rules applied. Total rules applied 1339 place count 296 transition count 738
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1351 place count 284 transition count 628
Iterating global reduction 7 with 12 rules applied. Total rules applied 1363 place count 284 transition count 628
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1375 place count 284 transition count 616
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1376 place count 283 transition count 615
Applied a total of 1376 rules in 126 ms. Remains 283 /1246 variables (removed 963) and now considering 615/2090 (removed 1475) transitions.
[2022-05-14 23:22:17] [INFO ] Flow matrix only has 595 transitions (discarded 20 similar events)
// Phase 1: matrix 595 rows 283 cols
[2022-05-14 23:22:17] [INFO ] Computed 88 place invariants in 2 ms
[2022-05-14 23:22:17] [INFO ] Implicit Places using invariants in 132 ms returned []
[2022-05-14 23:22:17] [INFO ] Flow matrix only has 595 transitions (discarded 20 similar events)
// Phase 1: matrix 595 rows 283 cols
[2022-05-14 23:22:17] [INFO ] Computed 88 place invariants in 2 ms
[2022-05-14 23:22:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-14 23:22:17] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2022-05-14 23:22:17] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-14 23:22:17] [INFO ] Flow matrix only has 595 transitions (discarded 20 similar events)
// Phase 1: matrix 595 rows 283 cols
[2022-05-14 23:22:17] [INFO ] Computed 88 place invariants in 2 ms
[2022-05-14 23:22:17] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/1246 places, 615/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 283/1246 places, 615/2090 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-06 finished in 772 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1232 transition count 2067
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1232 transition count 2067
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 1224 transition count 2059
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1224 transition count 2059
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 1224 transition count 2058
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 1220 transition count 2046
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 1220 transition count 2046
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 1217 transition count 2043
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 1217 transition count 2043
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 1215 transition count 2041
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 1215 transition count 2041
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 1213 transition count 2039
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 1213 transition count 2039
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 1211 transition count 2037
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 1211 transition count 2037
Applied a total of 71 rules in 177 ms. Remains 1211 /1246 variables (removed 35) and now considering 2037/2090 (removed 53) transitions.
// Phase 1: matrix 2037 rows 1211 cols
[2022-05-14 23:22:19] [INFO ] Computed 88 place invariants in 4 ms
[2022-05-14 23:22:19] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 2037 rows 1211 cols
[2022-05-14 23:22:19] [INFO ] Computed 88 place invariants in 6 ms
[2022-05-14 23:22:20] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
// Phase 1: matrix 2037 rows 1211 cols
[2022-05-14 23:22:20] [INFO ] Computed 88 place invariants in 8 ms
[2022-05-14 23:22:21] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1211/1246 places, 2037/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 1211/1246 places, 2037/2090 transitions.
Stuttering acceptance computed with spot in 585 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s363 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 784 ms.
Product exploration explored 100000 steps with 50000 reset in 746 ms.
Computed a total of 171 stabilizing places and 171 stable transitions
Computed a total of 171 stabilizing places and 171 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DLCround-PT-05b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05b-LTLFireability-07 finished in 5348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)||G(p1)))))'
Support contains 2 out of 1246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Graph (trivial) has 1142 edges and 1246 vertex of which 355 / 1246 are part of one of the 28 SCC in 3 ms
Free SCC test removed 327 places
Ensure Unique test removed 354 transitions
Reduce isomorphic transitions removed 354 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 203 place count 918 transition count 1533
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 234 rules applied. Total rules applied 437 place count 716 transition count 1501
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 458 place count 695 transition count 1501
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 458 place count 695 transition count 1413
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 634 place count 607 transition count 1413
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 687 place count 554 transition count 1140
Iterating global reduction 3 with 53 rules applied. Total rules applied 740 place count 554 transition count 1140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 743 place count 554 transition count 1137
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 743 place count 554 transition count 1131
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 755 place count 548 transition count 1131
Performed 202 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 202 places in 0 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 4 with 404 rules applied. Total rules applied 1159 place count 346 transition count 924
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1165 place count 346 transition count 918
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1182 place count 329 transition count 777
Iterating global reduction 5 with 17 rules applied. Total rules applied 1199 place count 329 transition count 777
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1216 place count 329 transition count 760
Performed 16 Post agglomeration using F-continuation condition with reduction of 24 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 1248 place count 313 transition count 869
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1252 place count 309 transition count 815
Iterating global reduction 6 with 4 rules applied. Total rules applied 1256 place count 309 transition count 815
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 1281 place count 309 transition count 790
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 7 with 27 rules applied. Total rules applied 1308 place count 309 transition count 763
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1320 place count 297 transition count 739
Iterating global reduction 7 with 12 rules applied. Total rules applied 1332 place count 297 transition count 739
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1344 place count 285 transition count 629
Iterating global reduction 7 with 12 rules applied. Total rules applied 1356 place count 285 transition count 629
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1368 place count 285 transition count 617
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1369 place count 284 transition count 616
Applied a total of 1369 rules in 134 ms. Remains 284 /1246 variables (removed 962) and now considering 616/2090 (removed 1474) transitions.
[2022-05-14 23:22:23] [INFO ] Flow matrix only has 596 transitions (discarded 20 similar events)
// Phase 1: matrix 596 rows 284 cols
[2022-05-14 23:22:23] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-14 23:22:23] [INFO ] Implicit Places using invariants in 399 ms returned []
[2022-05-14 23:22:23] [INFO ] Flow matrix only has 596 transitions (discarded 20 similar events)
// Phase 1: matrix 596 rows 284 cols
[2022-05-14 23:22:23] [INFO ] Computed 88 place invariants in 6 ms
[2022-05-14 23:22:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-14 23:22:24] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2022-05-14 23:22:24] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-14 23:22:24] [INFO ] Flow matrix only has 596 transitions (discarded 20 similar events)
// Phase 1: matrix 596 rows 284 cols
[2022-05-14 23:22:24] [INFO ] Computed 88 place invariants in 2 ms
[2022-05-14 23:22:24] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/1246 places, 616/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 284/1246 places, 616/2090 transitions.
Stuttering acceptance computed with spot in 1601 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s215 1), p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-09 finished in 2682 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((F(p0)&&p1))&&p2))))'
Support contains 3 out of 1246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1233 transition count 2069
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1233 transition count 2069
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 1226 transition count 2062
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 1226 transition count 2062
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 1222 transition count 2050
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1222 transition count 2050
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1220 transition count 2048
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1220 transition count 2048
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1218 transition count 2046
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1218 transition count 2046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1216 transition count 2044
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1216 transition count 2044
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1214 transition count 2042
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1214 transition count 2042
Applied a total of 64 rules in 186 ms. Remains 1214 /1246 variables (removed 32) and now considering 2042/2090 (removed 48) transitions.
// Phase 1: matrix 2042 rows 1214 cols
[2022-05-14 23:22:26] [INFO ] Computed 88 place invariants in 8 ms
[2022-05-14 23:22:26] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 2042 rows 1214 cols
[2022-05-14 23:22:26] [INFO ] Computed 88 place invariants in 9 ms
[2022-05-14 23:22:27] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
// Phase 1: matrix 2042 rows 1214 cols
[2022-05-14 23:22:27] [INFO ] Computed 88 place invariants in 5 ms
[2022-05-14 23:22:27] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1214/1246 places, 2042/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 1214/1246 places, 2042/2090 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s96 1), p0:(EQ s431 1), p1:(EQ s498 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-10 finished in 2179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))||(X((G(p1)&&p2))&&G(p1))))'
Support contains 3 out of 1246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1234 transition count 2069
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1234 transition count 2069
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 1227 transition count 2062
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 1227 transition count 2062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1227 transition count 2061
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 1223 transition count 2049
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 1223 transition count 2049
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 1220 transition count 2046
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 1220 transition count 2046
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1218 transition count 2044
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1218 transition count 2044
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 1216 transition count 2042
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 1216 transition count 2042
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1214 transition count 2040
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1214 transition count 2040
Applied a total of 65 rules in 183 ms. Remains 1214 /1246 variables (removed 32) and now considering 2040/2090 (removed 50) transitions.
// Phase 1: matrix 2040 rows 1214 cols
[2022-05-14 23:22:28] [INFO ] Computed 88 place invariants in 10 ms
[2022-05-14 23:22:28] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 2040 rows 1214 cols
[2022-05-14 23:22:28] [INFO ] Computed 88 place invariants in 4 ms
[2022-05-14 23:22:29] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
// Phase 1: matrix 2040 rows 1214 cols
[2022-05-14 23:22:29] [INFO ] Computed 88 place invariants in 9 ms
[2022-05-14 23:22:30] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1214/1246 places, 2040/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 1214/1246 places, 2040/2090 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s965 1), p2:(EQ s290 1), p0:(EQ s1103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 43 reset in 337 ms.
Product exploration explored 100000 steps with 33 reset in 396 ms.
Computed a total of 173 stabilizing places and 173 stable transitions
Computed a total of 173 stabilizing places and 173 stable transitions
Detected a total of 173/1214 stabilizing places and 173/2040 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 945 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4030 steps, including 1 resets, run visited all 1 properties in 15 ms. (steps per millisecond=268 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 261 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 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2040 rows 1214 cols
[2022-05-14 23:22:32] [INFO ] Computed 88 place invariants in 5 ms
[2022-05-14 23:22:33] [INFO ] [Real]Absence check using 88 positive place invariants in 71 ms returned sat
[2022-05-14 23:22:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:22:35] [INFO ] [Real]Absence check using state equation in 1941 ms returned sat
[2022-05-14 23:22:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:22:36] [INFO ] [Nat]Absence check using 88 positive place invariants in 74 ms returned sat
[2022-05-14 23:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:22:38] [INFO ] [Nat]Absence check using state equation in 1883 ms returned sat
[2022-05-14 23:22:38] [INFO ] Computed and/alt/rep : 1926/3405/1926 causal constraints (skipped 113 transitions) in 93 ms.
[2022-05-14 23:22:50] [INFO ] Deduced a trap composed of 10 places in 518 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: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:22:50] [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 1214 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1214/1214 places, 2040/2040 transitions.
Applied a total of 0 rules in 23 ms. Remains 1214 /1214 variables (removed 0) and now considering 2040/2040 (removed 0) transitions.
// Phase 1: matrix 2040 rows 1214 cols
[2022-05-14 23:22:50] [INFO ] Computed 88 place invariants in 8 ms
[2022-05-14 23:22:51] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 2040 rows 1214 cols
[2022-05-14 23:22:51] [INFO ] Computed 88 place invariants in 5 ms
[2022-05-14 23:22:51] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
// Phase 1: matrix 2040 rows 1214 cols
[2022-05-14 23:22:51] [INFO ] Computed 88 place invariants in 4 ms
[2022-05-14 23:22:52] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1214/1214 places, 2040/2040 transitions.
Computed a total of 173 stabilizing places and 173 stable transitions
Computed a total of 173 stabilizing places and 173 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 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 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2998 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=249 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 85 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 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2040 rows 1214 cols
[2022-05-14 23:22:53] [INFO ] Computed 88 place invariants in 4 ms
[2022-05-14 23:22:53] [INFO ] [Real]Absence check using 88 positive place invariants in 65 ms returned sat
[2022-05-14 23:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 23:22:55] [INFO ] [Real]Absence check using state equation in 2057 ms returned sat
[2022-05-14 23:22:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 23:22:56] [INFO ] [Nat]Absence check using 88 positive place invariants in 69 ms returned sat
[2022-05-14 23:22:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 23:22:58] [INFO ] [Nat]Absence check using state equation in 1922 ms returned sat
[2022-05-14 23:22:58] [INFO ] Computed and/alt/rep : 1926/3405/1926 causal constraints (skipped 113 transitions) in 91 ms.
[2022-05-14 23:23:11] [INFO ] Deduced a trap composed of 10 places in 476 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: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: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:23:11] [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 76 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27 reset in 408 ms.
Stack based approach found an accepted trace after 29567 steps with 9 reset with depth 7906 and stack size 7906 in 113 ms.
FORMULA DLCround-PT-05b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DLCround-PT-05b-LTLFireability-11 finished in 43975 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (X(p1) U p2)))'
Support contains 6 out of 1246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1232 transition count 2067
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1232 transition count 2067
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 1224 transition count 2059
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1224 transition count 2059
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 1224 transition count 2058
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 1220 transition count 2046
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 1220 transition count 2046
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 1217 transition count 2043
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 1217 transition count 2043
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 1215 transition count 2041
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 1215 transition count 2041
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 1213 transition count 2039
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 1213 transition count 2039
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 1211 transition count 2037
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 1211 transition count 2037
Applied a total of 71 rules in 185 ms. Remains 1211 /1246 variables (removed 35) and now considering 2037/2090 (removed 53) transitions.
// Phase 1: matrix 2037 rows 1211 cols
[2022-05-14 23:23:12] [INFO ] Computed 88 place invariants in 11 ms
[2022-05-14 23:23:12] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 2037 rows 1211 cols
[2022-05-14 23:23:12] [INFO ] Computed 88 place invariants in 4 ms
[2022-05-14 23:23:13] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
// Phase 1: matrix 2037 rows 1211 cols
[2022-05-14 23:23:13] [INFO ] Computed 88 place invariants in 4 ms
[2022-05-14 23:23:14] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1211/1246 places, 2037/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 1211/1246 places, 2037/2090 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s417 1) (EQ s1136 1)), p0:(AND (EQ s39 1) (EQ s939 1)), p1:(AND (EQ s575 1) (EQ s1173 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-12 finished in 2292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||p1))&&F(G(X(G(p2))))))'
Support contains 4 out of 1246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Graph (trivial) has 1139 edges and 1246 vertex of which 334 / 1246 are part of one of the 29 SCC in 0 ms
Free SCC test removed 305 places
Ensure Unique test removed 329 transitions
Reduce isomorphic transitions removed 329 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 212 place count 940 transition count 1549
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 243 rules applied. Total rules applied 455 place count 729 transition count 1517
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 476 place count 708 transition count 1517
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 476 place count 708 transition count 1425
Deduced a syphon composed of 92 places in 2 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 660 place count 616 transition count 1425
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 709 place count 567 transition count 1172
Iterating global reduction 3 with 49 rules applied. Total rules applied 758 place count 567 transition count 1172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 762 place count 567 transition count 1168
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 762 place count 567 transition count 1161
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 776 place count 560 transition count 1161
Performed 206 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 206 places in 0 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 4 with 412 rules applied. Total rules applied 1188 place count 354 transition count 951
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1194 place count 354 transition count 945
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1210 place count 338 transition count 813
Iterating global reduction 5 with 16 rules applied. Total rules applied 1226 place count 338 transition count 813
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1241 place count 338 transition count 798
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1243 place count 337 transition count 797
Performed 17 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1277 place count 320 transition count 916
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1278 place count 320 transition count 915
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1282 place count 316 transition count 861
Iterating global reduction 7 with 4 rules applied. Total rules applied 1286 place count 316 transition count 861
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1311 place count 316 transition count 836
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 8 with 25 rules applied. Total rules applied 1336 place count 316 transition count 811
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1346 place count 306 transition count 791
Iterating global reduction 8 with 10 rules applied. Total rules applied 1356 place count 306 transition count 791
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1366 place count 296 transition count 699
Iterating global reduction 8 with 10 rules applied. Total rules applied 1376 place count 296 transition count 699
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1386 place count 296 transition count 689
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1387 place count 295 transition count 688
Applied a total of 1387 rules in 125 ms. Remains 295 /1246 variables (removed 951) and now considering 688/2090 (removed 1402) transitions.
[2022-05-14 23:23:14] [INFO ] Flow matrix only has 665 transitions (discarded 23 similar events)
// Phase 1: matrix 665 rows 295 cols
[2022-05-14 23:23:14] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-14 23:23:14] [INFO ] Implicit Places using invariants in 271 ms returned []
[2022-05-14 23:23:14] [INFO ] Flow matrix only has 665 transitions (discarded 23 similar events)
// Phase 1: matrix 665 rows 295 cols
[2022-05-14 23:23:14] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-14 23:23:14] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-05-14 23:23:15] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2022-05-14 23:23:15] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-14 23:23:15] [INFO ] Flow matrix only has 665 transitions (discarded 23 similar events)
// Phase 1: matrix 665 rows 295 cols
[2022-05-14 23:23:15] [INFO ] Computed 88 place invariants in 3 ms
[2022-05-14 23:23:15] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 295/1246 places, 688/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 295/1246 places, 688/2090 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p2)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s16 1), p0:(EQ s51 1), p2:(OR (EQ s61 0) (EQ s288 0))], 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 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-13 finished in 1020 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((G(X(F(X(X(G(p1))))))&&p2)))))'
Support contains 4 out of 1246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1234 transition count 2069
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1234 transition count 2069
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1228 transition count 2063
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1228 transition count 2063
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1228 transition count 2062
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1226 transition count 2060
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1226 transition count 2060
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1224 transition count 2058
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1224 transition count 2058
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 1222 transition count 2056
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 1222 transition count 2056
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1220 transition count 2054
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1220 transition count 2054
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 1218 transition count 2052
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 1218 transition count 2052
Applied a total of 57 rules in 190 ms. Remains 1218 /1246 variables (removed 28) and now considering 2052/2090 (removed 38) transitions.
// Phase 1: matrix 2052 rows 1218 cols
[2022-05-14 23:23:15] [INFO ] Computed 88 place invariants in 9 ms
[2022-05-14 23:23:15] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 2052 rows 1218 cols
[2022-05-14 23:23:15] [INFO ] Computed 88 place invariants in 3 ms
[2022-05-14 23:23:16] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
// Phase 1: matrix 2052 rows 1218 cols
[2022-05-14 23:23:16] [INFO ] Computed 88 place invariants in 4 ms
[2022-05-14 23:23:17] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1218/1246 places, 2052/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 1218/1246 places, 2052/2090 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s174 1) (EQ s843 1)), p2:(EQ s567 1), p1:(EQ s426 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-14 finished in 2359 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1246/1246 places, 2090/2090 transitions.
Graph (trivial) has 1140 edges and 1246 vertex of which 341 / 1246 are part of one of the 29 SCC in 1 ms
Free SCC test removed 312 places
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 336 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 208 place count 933 transition count 1546
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 239 rules applied. Total rules applied 447 place count 726 transition count 1514
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 23 rules applied. Total rules applied 470 place count 705 transition count 1512
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 472 place count 703 transition count 1512
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 89 Pre rules applied. Total rules applied 472 place count 703 transition count 1423
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 650 place count 614 transition count 1423
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 701 place count 563 transition count 1160
Iterating global reduction 4 with 51 rules applied. Total rules applied 752 place count 563 transition count 1160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 756 place count 563 transition count 1156
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 756 place count 563 transition count 1149
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 770 place count 556 transition count 1149
Performed 207 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 207 places in 0 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 5 with 414 rules applied. Total rules applied 1184 place count 349 transition count 937
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1190 place count 349 transition count 931
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1206 place count 333 transition count 799
Iterating global reduction 6 with 16 rules applied. Total rules applied 1222 place count 333 transition count 799
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1237 place count 333 transition count 784
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 1239 place count 332 transition count 783
Performed 17 Post agglomeration using F-continuation condition with reduction of 24 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 1273 place count 315 transition count 902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1274 place count 315 transition count 901
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1278 place count 311 transition count 847
Iterating global reduction 8 with 4 rules applied. Total rules applied 1282 place count 311 transition count 847
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 1307 place count 311 transition count 822
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 9 with 25 rules applied. Total rules applied 1332 place count 311 transition count 797
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1342 place count 301 transition count 777
Iterating global reduction 9 with 10 rules applied. Total rules applied 1352 place count 301 transition count 777
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1362 place count 291 transition count 685
Iterating global reduction 9 with 10 rules applied. Total rules applied 1372 place count 291 transition count 685
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1382 place count 291 transition count 675
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1383 place count 290 transition count 674
Applied a total of 1383 rules in 122 ms. Remains 290 /1246 variables (removed 956) and now considering 674/2090 (removed 1416) transitions.
[2022-05-14 23:23:17] [INFO ] Flow matrix only has 651 transitions (discarded 23 similar events)
// Phase 1: matrix 651 rows 290 cols
[2022-05-14 23:23:17] [INFO ] Computed 88 place invariants in 2 ms
[2022-05-14 23:23:17] [INFO ] Implicit Places using invariants in 118 ms returned []
[2022-05-14 23:23:18] [INFO ] Flow matrix only has 651 transitions (discarded 23 similar events)
// Phase 1: matrix 651 rows 290 cols
[2022-05-14 23:23:18] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-14 23:23:18] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-14 23:23:18] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2022-05-14 23:23:18] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-14 23:23:18] [INFO ] Flow matrix only has 651 transitions (discarded 23 similar events)
// Phase 1: matrix 651 rows 290 cols
[2022-05-14 23:23:18] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-14 23:23:18] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/1246 places, 674/2090 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/1246 places, 674/2090 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05b-LTLFireability-15 finished in 803 ms.
All properties solved by simple procedures.
Total runtime 87322 ms.

BK_STOP 1652570598625

--------------------
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-05b"
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-05b, 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-165254771600156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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