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.r150-smll-165276998500220.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 NoC3x3-PT-7B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998500220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.2K Apr 29 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 2.0M May 10 09:34 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 NoC3x3-PT-7B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-7B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653033622827

Running Version 202205111006
[2022-05-20 08:00:25] [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-20 08:00:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 08:00:26] [INFO ] Load time of PNML (sax parser for PT used): 829 ms
[2022-05-20 08:00:26] [INFO ] Transformed 7014 places.
[2022-05-20 08:00:26] [INFO ] Transformed 8833 transitions.
[2022-05-20 08:00:26] [INFO ] Found NUPN structural information;
[2022-05-20 08:00:26] [INFO ] Parsed PT model containing 7014 places and 8833 transitions in 1162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA NoC3x3-PT-7B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 7014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Discarding 1850 places :
Symmetric choice reduction at 0 with 1850 rule applications. Total rules 1850 place count 5164 transition count 6983
Iterating global reduction 0 with 1850 rules applied. Total rules applied 3700 place count 5164 transition count 6983
Discarding 487 places :
Symmetric choice reduction at 0 with 487 rule applications. Total rules 4187 place count 4677 transition count 6496
Iterating global reduction 0 with 487 rules applied. Total rules applied 4674 place count 4677 transition count 6496
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 4754 place count 4597 transition count 6336
Iterating global reduction 0 with 80 rules applied. Total rules applied 4834 place count 4597 transition count 6336
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 4914 place count 4517 transition count 6256
Iterating global reduction 0 with 80 rules applied. Total rules applied 4994 place count 4517 transition count 6256
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 5074 place count 4437 transition count 6176
Iterating global reduction 0 with 80 rules applied. Total rules applied 5154 place count 4437 transition count 6176
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 5234 place count 4357 transition count 6052
Iterating global reduction 0 with 80 rules applied. Total rules applied 5314 place count 4357 transition count 6052
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 5393 place count 4278 transition count 5894
Iterating global reduction 0 with 79 rules applied. Total rules applied 5472 place count 4278 transition count 5894
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 5491 place count 4278 transition count 5875
Applied a total of 5491 rules in 5808 ms. Remains 4278 /7014 variables (removed 2736) and now considering 5875/8833 (removed 2958) transitions.
// Phase 1: matrix 5875 rows 4278 cols
[2022-05-20 08:00:32] [INFO ] Computed 66 place invariants in 56 ms
[2022-05-20 08:00:34] [INFO ] Implicit Places using invariants in 1493 ms returned []
// Phase 1: matrix 5875 rows 4278 cols
[2022-05-20 08:00:34] [INFO ] Computed 66 place invariants in 41 ms
[2022-05-20 08:00:36] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 3355 ms to find 0 implicit places.
// Phase 1: matrix 5875 rows 4278 cols
[2022-05-20 08:00:36] [INFO ] Computed 66 place invariants in 27 ms
[2022-05-20 08:00:42] [INFO ] Dead Transitions using invariants and state equation in 6002 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4278/7014 places, 5875/8833 transitions.
Finished structural reductions, in 1 iterations. Remains : 4278/7014 places, 5875/8833 transitions.
Support contains 40 out of 4278 places after structural reductions.
[2022-05-20 08:00:43] [INFO ] Flatten gal took : 622 ms
[2022-05-20 08:00:43] [INFO ] Flatten gal took : 240 ms
[2022-05-20 08:00:43] [INFO ] Input system was already deterministic with 5875 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 907 ms. (steps per millisecond=11 ) properties (out of 34) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 5875 rows 4278 cols
[2022-05-20 08:00:45] [INFO ] Computed 66 place invariants in 27 ms
[2022-05-20 08:00:49] [INFO ] [Real]Absence check using 66 positive place invariants in 110 ms returned sat
[2022-05-20 08:00:49] [INFO ] After 4226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-20 08:00:52] [INFO ] [Nat]Absence check using 66 positive place invariants in 126 ms returned sat
[2022-05-20 08:01:07] [INFO ] After 11432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-05-20 08:01:07] [INFO ] Deduced a trap composed of 124 places in 557 ms of which 5 ms to minimize.
[2022-05-20 08:01:08] [INFO ] Deduced a trap composed of 165 places in 380 ms of which 2 ms to minimize.
[2022-05-20 08:01:09] [INFO ] Deduced a trap composed of 166 places in 159 ms of which 1 ms to minimize.
[2022-05-20 08:01:09] [INFO ] Deduced a trap composed of 169 places in 161 ms of which 0 ms to minimize.
[2022-05-20 08:01:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2744 ms
[2022-05-20 08:01:20] [INFO ] Deduced a trap composed of 6 places in 5554 ms of which 6 ms to minimize.
[2022-05-20 08:01:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 08:01:20] [INFO ] After 30574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 17 different solutions.
Parikh walk visited 20 properties in 2718 ms.
Support contains 5 out of 4278 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Graph (trivial) has 5163 edges and 4278 vertex of which 3236 / 4278 are part of one of the 33 SCC in 23 ms
Free SCC test removed 3203 places
Drop transitions removed 4181 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 4341 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 1075 transition count 1523
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 19 rules applied. Total rules applied 31 place count 1064 transition count 1515
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 38 place count 1059 transition count 1513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 1058 transition count 1513
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 39 place count 1058 transition count 1471
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 123 place count 1016 transition count 1471
Discarding 279 places :
Symmetric choice reduction at 4 with 279 rule applications. Total rules 402 place count 737 transition count 1057
Iterating global reduction 4 with 279 rules applied. Total rules applied 681 place count 737 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 682 place count 737 transition count 1056
Discarding 200 places :
Symmetric choice reduction at 5 with 200 rule applications. Total rules 882 place count 537 transition count 812
Iterating global reduction 5 with 200 rules applied. Total rules applied 1082 place count 537 transition count 812
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 5 with 199 rules applied. Total rules applied 1281 place count 537 transition count 613
Performed 138 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 138 places in 1 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 6 with 276 rules applied. Total rules applied 1557 place count 399 transition count 473
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1559 place count 399 transition count 471
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1561 place count 397 transition count 469
Iterating global reduction 7 with 2 rules applied. Total rules applied 1563 place count 397 transition count 469
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1565 place count 397 transition count 467
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1567 place count 396 transition count 466
Performed 7 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1581 place count 389 transition count 488
Drop transitions removed 2 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1595 place count 389 transition count 474
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 1608 place count 389 transition count 461
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1609 place count 388 transition count 460
Iterating global reduction 9 with 1 rules applied. Total rules applied 1610 place count 388 transition count 460
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1612 place count 387 transition count 471
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1615 place count 387 transition count 468
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1616 place count 386 transition count 467
Iterating global reduction 9 with 1 rules applied. Total rules applied 1617 place count 386 transition count 467
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1619 place count 386 transition count 465
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1620 place count 385 transition count 464
Iterating global reduction 9 with 1 rules applied. Total rules applied 1621 place count 385 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1622 place count 385 transition count 463
Free-agglomeration rule applied 197 times.
Iterating global reduction 10 with 197 rules applied. Total rules applied 1819 place count 385 transition count 266
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 515 edges and 188 vertex of which 37 are kept as prefixes of interest. Removing 151 places using SCC suffix rule.5 ms
Discarding 151 places :
Also discarding 154 output transitions
Drop transitions removed 154 transitions
Iterating post reduction 10 with 234 rules applied. Total rules applied 2053 place count 37 transition count 76
Drop transitions removed 33 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 11 with 36 rules applied. Total rules applied 2089 place count 37 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2090 place count 36 transition count 39
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 13 edges and 30 vertex of which 11 / 30 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 12 with 7 rules applied. Total rules applied 2097 place count 22 transition count 39
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 2110 place count 22 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 2111 place count 22 transition count 25
Applied a total of 2111 rules in 718 ms. Remains 22 /4278 variables (removed 4256) and now considering 25/5875 (removed 5850) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/4278 places, 25/5875 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :2
Finished Best-First random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
FORMULA NoC3x3-PT-7B-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 68 stabilizing places and 68 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 4278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 4260 transition count 5857
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 4260 transition count 5857
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 4250 transition count 5844
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 4250 transition count 5844
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 4244 transition count 5834
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 4244 transition count 5834
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 4238 transition count 5828
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 4238 transition count 5828
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 4232 transition count 5818
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 4232 transition count 5818
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 4226 transition count 5810
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 4226 transition count 5810
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 4222 transition count 5802
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 4222 transition count 5802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 113 place count 4222 transition count 5801
Applied a total of 113 rules in 4050 ms. Remains 4222 /4278 variables (removed 56) and now considering 5801/5875 (removed 74) transitions.
// Phase 1: matrix 5801 rows 4222 cols
[2022-05-20 08:01:28] [INFO ] Computed 66 place invariants in 25 ms
[2022-05-20 08:01:29] [INFO ] Implicit Places using invariants in 1551 ms returned []
// Phase 1: matrix 5801 rows 4222 cols
[2022-05-20 08:01:29] [INFO ] Computed 66 place invariants in 27 ms
[2022-05-20 08:01:31] [INFO ] Implicit Places using invariants and state equation in 1457 ms returned []
Implicit Place search using SMT with State Equation took 3010 ms to find 0 implicit places.
// Phase 1: matrix 5801 rows 4222 cols
[2022-05-20 08:01:31] [INFO ] Computed 66 place invariants in 16 ms
[2022-05-20 08:01:38] [INFO ] Dead Transitions using invariants and state equation in 7141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4222/4278 places, 5801/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 4222/4278 places, 5801/5875 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s754 1) (EQ s890 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-00 finished in 14579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U !(p1 U p2)) U X(p3))))'
Support contains 5 out of 4278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 4260 transition count 5857
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 4260 transition count 5857
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 4250 transition count 5844
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 4250 transition count 5844
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 4244 transition count 5834
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 4244 transition count 5834
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 4238 transition count 5828
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 4238 transition count 5828
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 4232 transition count 5818
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 4232 transition count 5818
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 4226 transition count 5810
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 4226 transition count 5810
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 4222 transition count 5802
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 4222 transition count 5802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 113 place count 4222 transition count 5801
Applied a total of 113 rules in 4078 ms. Remains 4222 /4278 variables (removed 56) and now considering 5801/5875 (removed 74) transitions.
// Phase 1: matrix 5801 rows 4222 cols
[2022-05-20 08:01:42] [INFO ] Computed 66 place invariants in 20 ms
[2022-05-20 08:01:44] [INFO ] Implicit Places using invariants in 1509 ms returned []
// Phase 1: matrix 5801 rows 4222 cols
[2022-05-20 08:01:44] [INFO ] Computed 66 place invariants in 22 ms
[2022-05-20 08:01:46] [INFO ] Implicit Places using invariants and state equation in 1719 ms returned []
Implicit Place search using SMT with State Equation took 3230 ms to find 0 implicit places.
// Phase 1: matrix 5801 rows 4222 cols
[2022-05-20 08:01:46] [INFO ] Computed 66 place invariants in 24 ms
[2022-05-20 08:01:52] [INFO ] Dead Transitions using invariants and state equation in 6927 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4222/4278 places, 5801/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 4222/4278 places, 5801/5875 transitions.
Stuttering acceptance computed with spot in 395 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND p2 (NOT p3)), (AND p2 (NOT p3)), true, p2, p2]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={} source=4 dest: 8}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=8 dest: 8}, { cond=(AND p2 p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(NEQ s3306 1), p0:(AND (EQ s3404 1) (EQ s796 1) (EQ s3306 1)), p1:(EQ s3404 1), p3:(AND (EQ s1320 1) (EQ s1560 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-01 finished in 14703 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(X((F(p1)||p2)))))))'
Support contains 3 out of 4278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 4261 transition count 5858
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 4261 transition count 5858
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 4252 transition count 5846
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 4252 transition count 5846
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 4246 transition count 5836
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 4246 transition count 5836
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 4240 transition count 5830
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 4240 transition count 5830
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 4234 transition count 5820
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 4234 transition count 5820
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 4228 transition count 5812
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 4228 transition count 5812
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 4224 transition count 5804
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 4224 transition count 5804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 4224 transition count 5803
Applied a total of 109 rules in 4230 ms. Remains 4224 /4278 variables (removed 54) and now considering 5803/5875 (removed 72) transitions.
// Phase 1: matrix 5803 rows 4224 cols
[2022-05-20 08:01:57] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:01:58] [INFO ] Implicit Places using invariants in 1227 ms returned []
// Phase 1: matrix 5803 rows 4224 cols
[2022-05-20 08:01:58] [INFO ] Computed 66 place invariants in 15 ms
[2022-05-20 08:02:00] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 2422 ms to find 0 implicit places.
// Phase 1: matrix 5803 rows 4224 cols
[2022-05-20 08:02:00] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:02:00] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4224/4278 places, 5803/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 4224/4278 places, 5803/5875 transitions.
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}]], initial=2, aps=[p0:(EQ s1988 1), p2:(AND (EQ s1988 1) (EQ s458 1)), p1:(EQ s3753 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 410 reset in 1031 ms.
Product exploration explored 100000 steps with 414 reset in 623 ms.
Computed a total of 66 stabilizing places and 66 stable transitions
Computed a total of 66 stabilizing places and 66 stable transitions
Detected a total of 66/4224 stabilizing places and 66/5803 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 6 states, 6 edges and 3 AP to 6 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 308 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 6 states, 6 edges and 3 AP to 6 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
// Phase 1: matrix 5803 rows 4224 cols
[2022-05-20 08:02:04] [INFO ] Computed 66 place invariants in 25 ms
[2022-05-20 08:02:10] [INFO ] [Real]Absence check using 66 positive place invariants in 133 ms returned sat
[2022-05-20 08:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:02:19] [INFO ] [Real]Absence check using state equation in 9285 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 3 out of 4224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4224/4224 places, 5803/5803 transitions.
Applied a total of 0 rules in 449 ms. Remains 4224 /4224 variables (removed 0) and now considering 5803/5803 (removed 0) transitions.
// Phase 1: matrix 5803 rows 4224 cols
[2022-05-20 08:02:19] [INFO ] Computed 66 place invariants in 17 ms
[2022-05-20 08:02:21] [INFO ] Implicit Places using invariants in 1679 ms returned []
// Phase 1: matrix 5803 rows 4224 cols
[2022-05-20 08:02:21] [INFO ] Computed 66 place invariants in 22 ms
[2022-05-20 08:02:22] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 2547 ms to find 0 implicit places.
// Phase 1: matrix 5803 rows 4224 cols
[2022-05-20 08:02:22] [INFO ] Computed 66 place invariants in 22 ms
[2022-05-20 08:02:23] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4224/4224 places, 5803/5803 transitions.
Computed a total of 66 stabilizing places and 66 stable transitions
Computed a total of 66 stabilizing places and 66 stable transitions
Detected a total of 66/4224 stabilizing places and 66/5803 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 6 states, 6 edges and 3 AP to 6 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 189 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 6 states, 6 edges and 3 AP to 6 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
// Phase 1: matrix 5803 rows 4224 cols
[2022-05-20 08:02:25] [INFO ] Computed 66 place invariants in 24 ms
[2022-05-20 08:02:30] [INFO ] [Real]Absence check using 66 positive place invariants in 128 ms returned sat
[2022-05-20 08:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:02:40] [INFO ] [Real]Absence check using state equation in 10068 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 405 reset in 526 ms.
Product exploration explored 100000 steps with 408 reset in 593 ms.
Applying partial POR strategy [false, true, true, false, false, false]
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 4224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4224/4224 places, 5803/5803 transitions.
Graph (trivial) has 5107 edges and 4224 vertex of which 3234 / 4224 are part of one of the 33 SCC in 17 ms
Free SCC test removed 3201 places
Ensure Unique test removed 4316 transitions
Reduce isomorphic transitions removed 4316 transitions.
Discarding 247 places :
Symmetric choice reduction at 0 with 247 rule applications. Total rules 248 place count 776 transition count 1240
Iterating global reduction 0 with 247 rules applied. Total rules applied 495 place count 776 transition count 1240
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 695 place count 576 transition count 896
Iterating global reduction 0 with 200 rules applied. Total rules applied 895 place count 576 transition count 896
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 1095 place count 576 transition count 696
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 1095 place count 576 transition count 744
Deduced a syphon composed of 37 places in 3 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 1132 place count 576 transition count 744
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 1158 place count 550 transition count 684
Deduced a syphon composed of 37 places in 2 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 1184 place count 550 transition count 684
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 1210 place count 524 transition count 624
Deduced a syphon composed of 11 places in 2 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 1236 place count 524 transition count 624
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 129 rules applied. Total rules applied 1365 place count 524 transition count 624
Deduced a syphon composed of 140 places in 1 ms
Applied a total of 1365 rules in 526 ms. Remains 524 /4224 variables (removed 3700) and now considering 624/5803 (removed 5179) transitions.
[2022-05-20 08:02:42] [INFO ] Redundant transitions in 79 ms returned []
[2022-05-20 08:02:42] [INFO ] Flow matrix only has 592 transitions (discarded 32 similar events)
// Phase 1: matrix 592 rows 524 cols
[2022-05-20 08:02:42] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 08:02:43] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 524/4224 places, 624/5803 transitions.
Finished structural reductions, in 1 iterations. Remains : 524/4224 places, 624/5803 transitions.
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-04 finished in 49739 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X(p1))&&G(X(F(p2)))&&p0))))'
Support contains 4 out of 4278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Graph (trivial) has 5166 edges and 4278 vertex of which 3258 / 4278 are part of one of the 33 SCC in 7 ms
Free SCC test removed 3225 places
Ensure Unique test removed 4343 transitions
Reduce isomorphic transitions removed 4343 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 1052 transition count 1524
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 1045 transition count 1522
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 1044 transition count 1522
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 18 place count 1044 transition count 1483
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 96 place count 1005 transition count 1483
Discarding 280 places :
Symmetric choice reduction at 3 with 280 rule applications. Total rules 376 place count 725 transition count 1064
Iterating global reduction 3 with 280 rules applied. Total rules applied 656 place count 725 transition count 1064
Discarding 203 places :
Symmetric choice reduction at 3 with 203 rule applications. Total rules 859 place count 522 transition count 819
Iterating global reduction 3 with 203 rules applied. Total rules applied 1062 place count 522 transition count 819
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Iterating post reduction 3 with 202 rules applied. Total rules applied 1264 place count 522 transition count 617
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 1530 place count 389 transition count 484
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1532 place count 387 transition count 482
Iterating global reduction 4 with 2 rules applied. Total rules applied 1534 place count 387 transition count 482
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1536 place count 387 transition count 480
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1538 place count 387 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1539 place count 386 transition count 477
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 269 edges and 377 vertex of which 48 / 377 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 5 with 10 rules applied. Total rules applied 1549 place count 353 transition count 477
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 1597 place count 353 transition count 429
Applied a total of 1597 rules in 215 ms. Remains 353 /4278 variables (removed 3925) and now considering 429/5875 (removed 5446) transitions.
[2022-05-20 08:02:43] [INFO ] Flow matrix only has 397 transitions (discarded 32 similar events)
// Phase 1: matrix 397 rows 353 cols
[2022-05-20 08:02:43] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 08:02:43] [INFO ] Implicit Places using invariants in 358 ms returned []
[2022-05-20 08:02:43] [INFO ] Flow matrix only has 397 transitions (discarded 32 similar events)
// Phase 1: matrix 397 rows 353 cols
[2022-05-20 08:02:43] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 08:02:44] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-20 08:02:44] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2022-05-20 08:02:44] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-20 08:02:44] [INFO ] Flow matrix only has 397 transitions (discarded 32 similar events)
// Phase 1: matrix 397 rows 353 cols
[2022-05-20 08:02:44] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 08:02:44] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 353/4278 places, 429/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 353/4278 places, 429/5875 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s87 0) (OR (EQ s70 0) (EQ s85 0))), p1:(EQ s181 0), p2:(OR (EQ s70 0) (EQ s85 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 144 steps with 1 reset in 6 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-05 finished in 1808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F((G((p0 U X(p1)))&&F(G(p2))))))))'
Support contains 3 out of 4278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 4259 transition count 5856
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 4259 transition count 5856
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 4249 transition count 5843
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 4249 transition count 5843
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 4243 transition count 5833
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 4243 transition count 5833
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 4237 transition count 5827
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 4237 transition count 5827
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 4231 transition count 5817
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 4231 transition count 5817
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 4225 transition count 5809
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 4225 transition count 5809
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 110 place count 4221 transition count 5801
Iterating global reduction 0 with 4 rules applied. Total rules applied 114 place count 4221 transition count 5801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 115 place count 4221 transition count 5800
Applied a total of 115 rules in 4238 ms. Remains 4221 /4278 variables (removed 57) and now considering 5800/5875 (removed 75) transitions.
// Phase 1: matrix 5800 rows 4221 cols
[2022-05-20 08:02:49] [INFO ] Computed 66 place invariants in 15 ms
[2022-05-20 08:02:50] [INFO ] Implicit Places using invariants in 1442 ms returned []
// Phase 1: matrix 5800 rows 4221 cols
[2022-05-20 08:02:50] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:02:52] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 2770 ms to find 0 implicit places.
// Phase 1: matrix 5800 rows 4221 cols
[2022-05-20 08:02:52] [INFO ] Computed 66 place invariants in 22 ms
[2022-05-20 08:02:57] [INFO ] Dead Transitions using invariants and state equation in 5882 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4221/4278 places, 5800/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 4221/4278 places, 5800/5875 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2317 1), p2:(EQ s494 1), p1:(EQ s2566 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2576 steps with 0 reset in 14 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-06 finished in 13111 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U !X(X(p1))))&&X(p2)))'
Support contains 3 out of 4278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 4261 transition count 5858
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 4261 transition count 5858
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 4254 transition count 5848
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 4254 transition count 5848
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 4251 transition count 5844
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 4251 transition count 5844
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 4248 transition count 5841
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 4248 transition count 5841
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 4245 transition count 5834
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 4245 transition count 5834
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 4242 transition count 5829
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 4242 transition count 5829
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 4241 transition count 5827
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 4241 transition count 5827
Applied a total of 74 rules in 3765 ms. Remains 4241 /4278 variables (removed 37) and now considering 5827/5875 (removed 48) transitions.
// Phase 1: matrix 5827 rows 4241 cols
[2022-05-20 08:03:01] [INFO ] Computed 66 place invariants in 15 ms
[2022-05-20 08:03:03] [INFO ] Implicit Places using invariants in 1767 ms returned []
// Phase 1: matrix 5827 rows 4241 cols
[2022-05-20 08:03:03] [INFO ] Computed 66 place invariants in 22 ms
[2022-05-20 08:03:05] [INFO ] Implicit Places using invariants and state equation in 1778 ms returned []
Implicit Place search using SMT with State Equation took 3549 ms to find 0 implicit places.
// Phase 1: matrix 5827 rows 4241 cols
[2022-05-20 08:03:05] [INFO ] Computed 66 place invariants in 22 ms
[2022-05-20 08:03:06] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4241/4278 places, 5827/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 4241/4278 places, 5827/5875 transitions.
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p2) p1), p1, p1, (NOT p2), p1, p1, true, p1, p1]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 7}, { cond=p0, acceptance={} source=4 dest: 8}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s388 1), p2:(EQ s2198 1), p1:(EQ s3943 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 4 reset in 2 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-07 finished in 8657 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U !(X(p1)&&p2)) U G(p3)))'
Support contains 4 out of 4278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 4260 transition count 5857
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 4260 transition count 5857
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 4252 transition count 5847
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 4252 transition count 5847
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 4246 transition count 5837
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 4246 transition count 5837
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 4240 transition count 5831
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 4240 transition count 5831
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 4234 transition count 5821
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 4234 transition count 5821
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 4228 transition count 5813
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 4228 transition count 5813
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 4224 transition count 5805
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 4224 transition count 5805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 4224 transition count 5804
Applied a total of 109 rules in 3963 ms. Remains 4224 /4278 variables (removed 54) and now considering 5804/5875 (removed 71) transitions.
// Phase 1: matrix 5804 rows 4224 cols
[2022-05-20 08:03:10] [INFO ] Computed 66 place invariants in 16 ms
[2022-05-20 08:03:12] [INFO ] Implicit Places using invariants in 1246 ms returned []
// Phase 1: matrix 5804 rows 4224 cols
[2022-05-20 08:03:12] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:03:13] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 2717 ms to find 0 implicit places.
// Phase 1: matrix 5804 rows 4224 cols
[2022-05-20 08:03:13] [INFO ] Computed 66 place invariants in 21 ms
[2022-05-20 08:03:14] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4224/4278 places, 5804/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 4224/4278 places, 5804/5875 transitions.
Stuttering acceptance computed with spot in 375 ms :[(NOT p3), p1, (OR (AND (NOT p0) p1) (AND p1 p2)), (AND (NOT p3) p1), (AND (NOT p3) (NOT p0) p1), true, (NOT p0), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=0 dest: 2}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p3 p2 p0), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 5}, { cond=(AND p3 p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=4 dest: 7}, { cond=(AND p3 p0 p1), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 5}, { cond=p3, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p3) p0), acceptance={} source=8 dest: 6}, { cond=(AND p3 (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p3 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(EQ s1309 1), p2:(EQ s3473 1), p0:(EQ s1421 1), p1:(EQ s4148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2620 steps with 0 reset in 22 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-08 finished in 8021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F((F(p0)||p1)) U p2)||X(p3))))'
Support contains 5 out of 4278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 4260 transition count 5857
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 4260 transition count 5857
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 4251 transition count 5845
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 4251 transition count 5845
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 4246 transition count 5837
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 4246 transition count 5837
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 4241 transition count 5832
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 4241 transition count 5832
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 4236 transition count 5823
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 4236 transition count 5823
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 4231 transition count 5816
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 4231 transition count 5816
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 4228 transition count 5810
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 4228 transition count 5810
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 101 place count 4228 transition count 5809
Applied a total of 101 rules in 3743 ms. Remains 4228 /4278 variables (removed 50) and now considering 5809/5875 (removed 66) transitions.
// Phase 1: matrix 5809 rows 4228 cols
[2022-05-20 08:03:18] [INFO ] Computed 66 place invariants in 15 ms
[2022-05-20 08:03:19] [INFO ] Implicit Places using invariants in 1255 ms returned []
// Phase 1: matrix 5809 rows 4228 cols
[2022-05-20 08:03:19] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:03:21] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 2901 ms to find 0 implicit places.
// Phase 1: matrix 5809 rows 4228 cols
[2022-05-20 08:03:21] [INFO ] Computed 66 place invariants in 22 ms
[2022-05-20 08:03:22] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4228/4278 places, 5809/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 4228/4278 places, 5809/5875 transitions.
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p2 (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s663 1), p1:(EQ s1227 1), p0:(EQ s223 1), p3:(OR (EQ s1855 0) (EQ s2090 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3702 ms.
Product exploration explored 100000 steps with 33333 reset in 3241 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p2)), (X (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p2) (NOT p3)))))
Knowledge based reduction with 6 factoid took 223 ms. Reduced automaton from 6 states, 9 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA NoC3x3-PT-7B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7B-LTLFireability-09 finished in 15238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 4278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 4258 transition count 5855
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 4258 transition count 5855
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 4248 transition count 5842
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 4248 transition count 5842
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 4242 transition count 5832
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 4242 transition count 5832
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 4236 transition count 5826
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 4236 transition count 5826
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 4230 transition count 5816
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 4230 transition count 5816
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 4224 transition count 5808
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 4224 transition count 5808
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 112 place count 4220 transition count 5800
Iterating global reduction 0 with 4 rules applied. Total rules applied 116 place count 4220 transition count 5800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 117 place count 4220 transition count 5799
Applied a total of 117 rules in 4361 ms. Remains 4220 /4278 variables (removed 58) and now considering 5799/5875 (removed 76) transitions.
// Phase 1: matrix 5799 rows 4220 cols
[2022-05-20 08:03:34] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:03:35] [INFO ] Implicit Places using invariants in 879 ms returned []
// Phase 1: matrix 5799 rows 4220 cols
[2022-05-20 08:03:35] [INFO ] Computed 66 place invariants in 19 ms
[2022-05-20 08:03:36] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
// Phase 1: matrix 5799 rows 4220 cols
[2022-05-20 08:03:36] [INFO ] Computed 66 place invariants in 19 ms
[2022-05-20 08:03:43] [INFO ] Dead Transitions using invariants and state equation in 6757 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4220/4278 places, 5799/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 4220/4278 places, 5799/5875 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1063 1) (EQ s3195 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]]
Stuttering criterion allowed to conclude after 5302 steps with 4 reset in 25 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-10 finished in 13578 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((F(p1)||p2))))'
Support contains 3 out of 4278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 4259 transition count 5856
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 4259 transition count 5856
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 4251 transition count 5846
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 4251 transition count 5846
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 4246 transition count 5837
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 4246 transition count 5837
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 4241 transition count 5832
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 4241 transition count 5832
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 4236 transition count 5823
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 4236 transition count 5823
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 4231 transition count 5817
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 4231 transition count 5817
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 4227 transition count 5809
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 4227 transition count 5809
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 4227 transition count 5808
Applied a total of 103 rules in 3859 ms. Remains 4227 /4278 variables (removed 51) and now considering 5808/5875 (removed 67) transitions.
// Phase 1: matrix 5808 rows 4227 cols
[2022-05-20 08:03:47] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:03:48] [INFO ] Implicit Places using invariants in 1298 ms returned []
// Phase 1: matrix 5808 rows 4227 cols
[2022-05-20 08:03:48] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:03:50] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 2636 ms to find 0 implicit places.
// Phase 1: matrix 5808 rows 4227 cols
[2022-05-20 08:03:50] [INFO ] Computed 66 place invariants in 21 ms
[2022-05-20 08:03:51] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4227/4278 places, 5808/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 4227/4278 places, 5808/5875 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s3446 1), p1:(EQ s1098 0), p0:(AND (EQ s4086 1) (EQ s1098 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 37 reset in 652 ms.
Product exploration explored 100000 steps with 35 reset in 1125 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 159957 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159957 steps, saw 154631 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5808 rows 4227 cols
[2022-05-20 08:03:56] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:03:57] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:03:58] [INFO ] [Nat]Absence check using 66 positive place invariants in 71 ms returned sat
[2022-05-20 08:04:02] [INFO ] After 3993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 08:04:03] [INFO ] Deduced a trap composed of 157 places in 475 ms of which 1 ms to minimize.
[2022-05-20 08:04:04] [INFO ] Deduced a trap composed of 136 places in 301 ms of which 1 ms to minimize.
[2022-05-20 08:04:04] [INFO ] Deduced a trap composed of 159 places in 202 ms of which 1 ms to minimize.
[2022-05-20 08:04:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2370 ms
[2022-05-20 08:04:06] [INFO ] After 7233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 677 ms.
[2022-05-20 08:04:06] [INFO ] After 9033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 976 steps, including 0 resets, run visited all 2 properties in 35 ms. (steps per millisecond=27 )
Parikh walk visited 2 properties in 37 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 411 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 4227 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4227/4227 places, 5808/5808 transitions.
Applied a total of 0 rules in 686 ms. Remains 4227 /4227 variables (removed 0) and now considering 5808/5808 (removed 0) transitions.
// Phase 1: matrix 5808 rows 4227 cols
[2022-05-20 08:04:08] [INFO ] Computed 66 place invariants in 23 ms
[2022-05-20 08:04:09] [INFO ] Implicit Places using invariants in 1487 ms returned []
// Phase 1: matrix 5808 rows 4227 cols
[2022-05-20 08:04:09] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:04:11] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 3027 ms to find 0 implicit places.
// Phase 1: matrix 5808 rows 4227 cols
[2022-05-20 08:04:11] [INFO ] Computed 66 place invariants in 23 ms
[2022-05-20 08:04:18] [INFO ] Dead Transitions using invariants and state equation in 6860 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4227/4227 places, 5808/5808 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 151442 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151442 steps, saw 146398 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5808 rows 4227 cols
[2022-05-20 08:04:21] [INFO ] Computed 66 place invariants in 23 ms
[2022-05-20 08:04:23] [INFO ] After 1056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:04:24] [INFO ] [Nat]Absence check using 66 positive place invariants in 111 ms returned sat
[2022-05-20 08:04:28] [INFO ] After 4526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 08:04:29] [INFO ] Deduced a trap composed of 157 places in 483 ms of which 1 ms to minimize.
[2022-05-20 08:04:30] [INFO ] Deduced a trap composed of 136 places in 299 ms of which 1 ms to minimize.
[2022-05-20 08:04:30] [INFO ] Deduced a trap composed of 159 places in 196 ms of which 1 ms to minimize.
[2022-05-20 08:04:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2313 ms
[2022-05-20 08:04:31] [INFO ] After 7696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 670 ms.
[2022-05-20 08:04:32] [INFO ] After 9597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 866 steps, including 0 resets, run visited all 2 properties in 29 ms. (steps per millisecond=29 )
Parikh walk visited 2 properties in 31 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 373 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 36 reset in 656 ms.
Product exploration explored 100000 steps with 38 reset in 590 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 4227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4227/4227 places, 5808/5808 transitions.
Graph (trivial) has 5107 edges and 4227 vertex of which 3198 / 4227 are part of one of the 33 SCC in 4 ms
Free SCC test removed 3165 places
Ensure Unique test removed 4259 transitions
Reduce isomorphic transitions removed 4259 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 1062 transition count 1549
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 1062 transition count 1547
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 10 place count 1062 transition count 1557
Deduced a syphon composed of 17 places in 5 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 1062 transition count 1557
Discarding 246 places :
Symmetric choice reduction at 2 with 246 rule applications. Total rules 266 place count 816 transition count 1311
Deduced a syphon composed of 13 places in 5 ms
Iterating global reduction 2 with 246 rules applied. Total rules applied 512 place count 816 transition count 1311
Discarding 194 places :
Symmetric choice reduction at 2 with 194 rule applications. Total rules 706 place count 622 transition count 981
Deduced a syphon composed of 13 places in 4 ms
Iterating global reduction 2 with 194 rules applied. Total rules applied 900 place count 622 transition count 981
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 2 with 194 rules applied. Total rules applied 1094 place count 622 transition count 787
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1094 place count 622 transition count 831
Deduced a syphon composed of 46 places in 3 ms
Iterating global reduction 3 with 33 rules applied. Total rules applied 1127 place count 622 transition count 831
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1150 place count 599 transition count 777
Deduced a syphon composed of 46 places in 3 ms
Iterating global reduction 3 with 23 rules applied. Total rules applied 1173 place count 599 transition count 777
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1196 place count 576 transition count 723
Deduced a syphon composed of 23 places in 3 ms
Iterating global reduction 3 with 23 rules applied. Total rules applied 1219 place count 576 transition count 723
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 3 with 146 rules applied. Total rules applied 1365 place count 576 transition count 729
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1368 place count 576 transition count 726
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1372 place count 572 transition count 713
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1376 place count 572 transition count 713
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1379 place count 569 transition count 710
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 1382 place count 569 transition count 710
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 1383 place count 569 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1384 place count 569 transition count 709
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1386 place count 567 transition count 707
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1388 place count 567 transition count 707
Performed 11 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 175 places in 0 ms
Iterating global reduction 5 with 11 rules applied. Total rules applied 1399 place count 567 transition count 769
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1419 place count 567 transition count 749
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 1439 place count 547 transition count 694
Deduced a syphon composed of 155 places in 0 ms
Iterating global reduction 6 with 20 rules applied. Total rules applied 1459 place count 547 transition count 694
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 157 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 1461 place count 547 transition count 736
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1482 place count 547 transition count 715
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1484 place count 545 transition count 707
Deduced a syphon composed of 155 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 1486 place count 545 transition count 707
Deduced a syphon composed of 155 places in 0 ms
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 1500 place count 545 transition count 693
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1506 place count 539 transition count 686
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 1512 place count 539 transition count 686
Deduced a syphon composed of 152 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 1518 place count 539 transition count 680
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1521 place count 536 transition count 677
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1524 place count 536 transition count 677
Deduced a syphon composed of 149 places in 0 ms
Applied a total of 1524 rules in 548 ms. Remains 536 /4227 variables (removed 3691) and now considering 677/5808 (removed 5131) transitions.
[2022-05-20 08:04:35] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-20 08:04:35] [INFO ] Flow matrix only has 645 transitions (discarded 32 similar events)
// Phase 1: matrix 645 rows 536 cols
[2022-05-20 08:04:35] [INFO ] Computed 66 place invariants in 11 ms
[2022-05-20 08:04:35] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 536/4227 places, 677/5808 transitions.
Finished structural reductions, in 1 iterations. Remains : 536/4227 places, 677/5808 transitions.
Stuttering criterion allowed to conclude after 122 steps with 1 reset in 2 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-11 finished in 52368 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 4278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Graph (trivial) has 5170 edges and 4278 vertex of which 3270 / 4278 are part of one of the 33 SCC in 2 ms
Free SCC test removed 3237 places
Ensure Unique test removed 4360 transitions
Reduce isomorphic transitions removed 4360 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 1040 transition count 1509
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 1035 transition count 1509
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 11 place count 1035 transition count 1473
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 83 place count 999 transition count 1473
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 365 place count 717 transition count 1056
Iterating global reduction 2 with 282 rules applied. Total rules applied 647 place count 717 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 648 place count 717 transition count 1055
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 852 place count 513 transition count 807
Iterating global reduction 3 with 204 rules applied. Total rules applied 1056 place count 513 transition count 807
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Iterating post reduction 3 with 203 rules applied. Total rules applied 1259 place count 513 transition count 604
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 1517 place count 384 transition count 475
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1519 place count 382 transition count 473
Iterating global reduction 4 with 2 rules applied. Total rules applied 1521 place count 382 transition count 473
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1523 place count 382 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1524 place count 381 transition count 470
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 372 vertex of which 48 / 372 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 5 with 10 rules applied. Total rules applied 1534 place count 348 transition count 470
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 1582 place count 348 transition count 422
Applied a total of 1582 rules in 145 ms. Remains 348 /4278 variables (removed 3930) and now considering 422/5875 (removed 5453) transitions.
[2022-05-20 08:04:36] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
// Phase 1: matrix 390 rows 348 cols
[2022-05-20 08:04:36] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 08:04:36] [INFO ] Implicit Places using invariants in 228 ms returned []
[2022-05-20 08:04:36] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
// Phase 1: matrix 390 rows 348 cols
[2022-05-20 08:04:36] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 08:04:36] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-20 08:04:37] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2022-05-20 08:04:37] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-20 08:04:37] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
// Phase 1: matrix 390 rows 348 cols
[2022-05-20 08:04:37] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 08:04:37] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 348/4278 places, 422/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 348/4278 places, 422/5875 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s34 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-12 finished in 1601 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 4278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Graph (trivial) has 5171 edges and 4278 vertex of which 3270 / 4278 are part of one of the 33 SCC in 2 ms
Free SCC test removed 3237 places
Ensure Unique test removed 4360 transitions
Reduce isomorphic transitions removed 4360 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 1040 transition count 1509
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 1035 transition count 1509
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 11 place count 1035 transition count 1472
Deduced a syphon composed of 37 places in 4 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 85 place count 998 transition count 1472
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 367 place count 716 transition count 1051
Iterating global reduction 2 with 282 rules applied. Total rules applied 649 place count 716 transition count 1051
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 650 place count 716 transition count 1050
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 854 place count 512 transition count 803
Iterating global reduction 3 with 204 rules applied. Total rules applied 1058 place count 512 transition count 803
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Iterating post reduction 3 with 203 rules applied. Total rules applied 1261 place count 512 transition count 600
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 1519 place count 383 transition count 471
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1521 place count 381 transition count 469
Iterating global reduction 4 with 2 rules applied. Total rules applied 1523 place count 381 transition count 469
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1525 place count 381 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1526 place count 380 transition count 466
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 371 vertex of which 48 / 371 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 5 with 10 rules applied. Total rules applied 1536 place count 347 transition count 466
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 1584 place count 347 transition count 418
Applied a total of 1584 rules in 143 ms. Remains 347 /4278 variables (removed 3931) and now considering 418/5875 (removed 5457) transitions.
[2022-05-20 08:04:37] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2022-05-20 08:04:37] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 08:04:37] [INFO ] Implicit Places using invariants in 251 ms returned []
[2022-05-20 08:04:37] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2022-05-20 08:04:37] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 08:04:38] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-20 08:04:38] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2022-05-20 08:04:38] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-20 08:04:38] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2022-05-20 08:04:38] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 08:04:38] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 347/4278 places, 418/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/4278 places, 418/5875 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s221 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 681 steps with 8 reset in 4 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-13 finished in 1329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(X(F(p1)))))'
Support contains 2 out of 4278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4278/4278 places, 5875/5875 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 4259 transition count 5856
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 4259 transition count 5856
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 4249 transition count 5843
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 4249 transition count 5843
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 4243 transition count 5833
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 4243 transition count 5833
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 4237 transition count 5827
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 4237 transition count 5827
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 4231 transition count 5817
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 4231 transition count 5817
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 4225 transition count 5809
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 4225 transition count 5809
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 110 place count 4221 transition count 5801
Iterating global reduction 0 with 4 rules applied. Total rules applied 114 place count 4221 transition count 5801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 115 place count 4221 transition count 5800
Applied a total of 115 rules in 4462 ms. Remains 4221 /4278 variables (removed 57) and now considering 5800/5875 (removed 75) transitions.
// Phase 1: matrix 5800 rows 4221 cols
[2022-05-20 08:04:43] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:04:44] [INFO ] Implicit Places using invariants in 1446 ms returned []
// Phase 1: matrix 5800 rows 4221 cols
[2022-05-20 08:04:44] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:04:46] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 2780 ms to find 0 implicit places.
// Phase 1: matrix 5800 rows 4221 cols
[2022-05-20 08:04:46] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 08:04:52] [INFO ] Dead Transitions using invariants and state equation in 5884 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4221/4278 places, 5800/5875 transitions.
Finished structural reductions, in 1 iterations. Remains : 4221/4278 places, 5800/5875 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s2940 1), p1:(EQ s2514 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7B-LTLFireability-14 finished in 13275 ms.
All properties solved by simple procedures.
Total runtime 266825 ms.

BK_STOP 1653033892277

--------------------
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="NoC3x3-PT-7B"
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 NoC3x3-PT-7B, 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 r150-smll-165276998500220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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