fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r150-smll-165276998600236
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for NoC3x3-PT-8B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
723.075 91140.00 134725.00 695.00 FFFFFFFFFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 7.7K Apr 29 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 29 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 29 13:03 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 3.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-8B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653044919304

Running Version 202205111006
[2022-05-20 11:08:41] [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 11:08:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 11:08:43] [INFO ] Load time of PNML (sax parser for PT used): 1003 ms
[2022-05-20 11:08:43] [INFO ] Transformed 9140 places.
[2022-05-20 11:08:43] [INFO ] Transformed 14577 transitions.
[2022-05-20 11:08:43] [INFO ] Found NUPN structural information;
[2022-05-20 11:08:43] [INFO ] Parsed PT model containing 9140 places and 14577 transitions in 1386 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA NoC3x3-PT-8B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 9140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 9107 transition count 14577
Discarding 5502 places :
Symmetric choice reduction at 1 with 5502 rule applications. Total rules 5535 place count 3605 transition count 9075
Iterating global reduction 1 with 5502 rules applied. Total rules applied 11037 place count 3605 transition count 9075
Ensure Unique test removed 3053 transitions
Reduce isomorphic transitions removed 3053 transitions.
Iterating post reduction 1 with 3053 rules applied. Total rules applied 14090 place count 3605 transition count 6022
Discarding 2001 places :
Symmetric choice reduction at 2 with 2001 rule applications. Total rules 16091 place count 1604 transition count 4021
Iterating global reduction 2 with 2001 rules applied. Total rules applied 18092 place count 1604 transition count 4021
Ensure Unique test removed 1873 transitions
Reduce isomorphic transitions removed 1873 transitions.
Iterating post reduction 2 with 1873 rules applied. Total rules applied 19965 place count 1604 transition count 2148
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 20031 place count 1538 transition count 2082
Iterating global reduction 3 with 66 rules applied. Total rules applied 20097 place count 1538 transition count 2082
Applied a total of 20097 rules in 2709 ms. Remains 1538 /9140 variables (removed 7602) and now considering 2082/14577 (removed 12495) transitions.
// Phase 1: matrix 2082 rows 1538 cols
[2022-05-20 11:08:46] [INFO ] Computed 66 place invariants in 66 ms
[2022-05-20 11:08:47] [INFO ] Implicit Places using invariants in 1327 ms returned []
// Phase 1: matrix 2082 rows 1538 cols
[2022-05-20 11:08:47] [INFO ] Computed 66 place invariants in 11 ms
[2022-05-20 11:08:50] [INFO ] Implicit Places using invariants and state equation in 2161 ms returned []
Implicit Place search using SMT with State Equation took 3534 ms to find 0 implicit places.
// Phase 1: matrix 2082 rows 1538 cols
[2022-05-20 11:08:50] [INFO ] Computed 66 place invariants in 17 ms
[2022-05-20 11:08:52] [INFO ] Dead Transitions using invariants and state equation in 2490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1538/9140 places, 2082/14577 transitions.
Finished structural reductions, in 1 iterations. Remains : 1538/9140 places, 2082/14577 transitions.
Support contains 35 out of 1538 places after structural reductions.
[2022-05-20 11:08:53] [INFO ] Flatten gal took : 392 ms
[2022-05-20 11:08:53] [INFO ] Flatten gal took : 231 ms
[2022-05-20 11:08:54] [INFO ] Input system was already deterministic with 2082 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1086 ms. (steps per millisecond=9 ) properties (out of 27) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2082 rows 1538 cols
[2022-05-20 11:08:55] [INFO ] Computed 66 place invariants in 12 ms
[2022-05-20 11:08:56] [INFO ] [Real]Absence check using 66 positive place invariants in 82 ms returned sat
[2022-05-20 11:08:59] [INFO ] After 2322ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:2
[2022-05-20 11:09:00] [INFO ] Deduced a trap composed of 43 places in 1047 ms of which 19 ms to minimize.
[2022-05-20 11:09:01] [INFO ] Deduced a trap composed of 102 places in 831 ms of which 4 ms to minimize.
[2022-05-20 11:09:01] [INFO ] Deduced a trap composed of 53 places in 658 ms of which 3 ms to minimize.
[2022-05-20 11:09:02] [INFO ] Deduced a trap composed of 139 places in 624 ms of which 4 ms to minimize.
[2022-05-20 11:09:03] [INFO ] Deduced a trap composed of 168 places in 628 ms of which 2 ms to minimize.
[2022-05-20 11:09:04] [INFO ] Deduced a trap composed of 99 places in 615 ms of which 2 ms to minimize.
[2022-05-20 11:09:04] [INFO ] Deduced a trap composed of 120 places in 317 ms of which 1 ms to minimize.
[2022-05-20 11:09:05] [INFO ] Deduced a trap composed of 89 places in 376 ms of which 1 ms to minimize.
[2022-05-20 11:09:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6171 ms
[2022-05-20 11:09:05] [INFO ] After 9024ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 11:09:05] [INFO ] After 10065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 11:09:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 56 ms returned sat
[2022-05-20 11:09:08] [INFO ] After 2210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 11:09:09] [INFO ] Deduced a trap composed of 43 places in 778 ms of which 2 ms to minimize.
[2022-05-20 11:09:10] [INFO ] Deduced a trap composed of 53 places in 701 ms of which 1 ms to minimize.
[2022-05-20 11:09:11] [INFO ] Deduced a trap composed of 168 places in 621 ms of which 1 ms to minimize.
[2022-05-20 11:09:11] [INFO ] Deduced a trap composed of 74 places in 577 ms of which 1 ms to minimize.
[2022-05-20 11:09:12] [INFO ] Deduced a trap composed of 103 places in 577 ms of which 1 ms to minimize.
[2022-05-20 11:09:13] [INFO ] Deduced a trap composed of 161 places in 578 ms of which 1 ms to minimize.
[2022-05-20 11:09:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4672 ms
[2022-05-20 11:09:15] [INFO ] Deduced a trap composed of 66 places in 899 ms of which 1 ms to minimize.
[2022-05-20 11:09:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1160 ms
[2022-05-20 11:09:15] [INFO ] After 9203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 760 ms.
[2022-05-20 11:09:16] [INFO ] After 10646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 634 ms.
Support contains 6 out of 1538 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Graph (trivial) has 1332 edges and 1538 vertex of which 487 / 1538 are part of one of the 33 SCC in 23 ms
Free SCC test removed 454 places
Drop transitions removed 522 transitions
Reduce isomorphic transitions removed 522 transitions.
Graph (complete) has 2647 edges and 1084 vertex of which 1083 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 1083 transition count 1308
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 220 rules applied. Total rules applied 474 place count 879 transition count 1292
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 9 rules applied. Total rules applied 483 place count 873 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 484 place count 872 transition count 1289
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 484 place count 872 transition count 1192
Deduced a syphon composed of 97 places in 7 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 678 place count 775 transition count 1192
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 775 place count 678 transition count 1003
Iterating global reduction 4 with 97 rules applied. Total rules applied 872 place count 678 transition count 1003
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 942 place count 678 transition count 933
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 5 with 448 rules applied. Total rules applied 1390 place count 454 transition count 709
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1438 place count 454 transition count 661
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1448 place count 449 transition count 724
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1449 place count 449 transition count 723
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 1460 place count 449 transition count 712
Free-agglomeration rule applied 199 times.
Iterating global reduction 7 with 199 rules applied. Total rules applied 1659 place count 449 transition count 513
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 837 edges and 250 vertex of which 245 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 212 rules applied. Total rules applied 1871 place count 245 transition count 501
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1876 place count 245 transition count 496
Drop transitions removed 166 transitions
Redundant transition composition rules discarded 166 transitions
Iterating global reduction 9 with 166 rules applied. Total rules applied 2042 place count 245 transition count 330
Reduce places removed 7 places and 0 transitions.
Graph (complete) has 659 edges and 238 vertex of which 215 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 8 rules applied. Total rules applied 2050 place count 215 transition count 330
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 2073 place count 215 transition count 307
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 11 with 25 rules applied. Total rules applied 2098 place count 215 transition count 307
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2099 place count 215 transition count 306
Applied a total of 2099 rules in 670 ms. Remains 215 /1538 variables (removed 1323) and now considering 306/2082 (removed 1776) transitions.
// Phase 1: matrix 306 rows 215 cols
[2022-05-20 11:09:17] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-20 11:09:17] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 215/1538 places, 306/2082 transitions.
Finished random walk after 271 steps, including 0 resets, run visited all 5 properties in 11 ms. (steps per millisecond=24 )
FORMULA NoC3x3-PT-8B-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 199 stabilizing places and 317 stable transitions
Graph (complete) has 3224 edges and 1538 vertex of which 1537 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.61 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((p0 U (p1 U p2))&&p3) U X(p4)))'
Support contains 6 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1520 transition count 2064
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1520 transition count 2064
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 51 place count 1520 transition count 2049
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 1514 transition count 2043
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 1514 transition count 2043
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 69 place count 1514 transition count 2037
Applied a total of 69 rules in 322 ms. Remains 1514 /1538 variables (removed 24) and now considering 2037/2082 (removed 45) transitions.
// Phase 1: matrix 2037 rows 1514 cols
[2022-05-20 11:09:18] [INFO ] Computed 66 place invariants in 15 ms
[2022-05-20 11:09:20] [INFO ] Implicit Places using invariants in 1289 ms returned []
// Phase 1: matrix 2037 rows 1514 cols
[2022-05-20 11:09:20] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 11:09:22] [INFO ] Implicit Places using invariants and state equation in 2469 ms returned []
Implicit Place search using SMT with State Equation took 3763 ms to find 0 implicit places.
// Phase 1: matrix 2037 rows 1514 cols
[2022-05-20 11:09:22] [INFO ] Computed 66 place invariants in 12 ms
[2022-05-20 11:09:24] [INFO ] Dead Transitions using invariants and state equation in 2433 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1514/1538 places, 2037/2082 transitions.
Finished structural reductions, in 1 iterations. Remains : 1514/1538 places, 2037/2082 transitions.
Stuttering acceptance computed with spot in 1271 ms :[(OR (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p2) (NOT p0) p1 (NOT p4)) (AND (NOT p3) (NOT p2) p0 (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p2) p0 p1 (NOT p4)) (AND (NOT p3) p2 (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p3) p2 (NOT p0) p1 (NOT p4)) (AND (NOT p3) p2 p0 (NOT p1) (NOT p4)) (AND (NOT p3) p2 p0 p1 (NOT p4)) (AND p3 (NOT p2) (NOT p0) (NOT p1) (NOT p4)) (AND p3 (NOT p2) (NOT p0) p1 (NOT p4)) (AND p3 (NOT p2) p0 (NOT p1) (NOT p4)) (AND p3 (NOT p2) p0 p1 (NOT p4)) (AND p3 p2 (NOT p0) (NOT p1) (NOT p4)) (AND p3 p2 (NOT p0) p1 (NOT p4)) (AND p3 p2 p0 (NOT p1) (NOT p4)) (AND p3 p2 p0 p1 (NOT p4))), (NOT p4), (NOT p4), (AND p2 (NOT p4)), (AND p2 (NOT p4)), true, p2, p2]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p3 p2), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p4), acceptance={} source=1 dest: 5}], [{ cond=(AND p3 p2 (NOT p4)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p0) p1 (NOT p2) (NOT p4)), acceptance={0} source=2 dest: 3}, { cond=(AND p3 p0 (NOT p2) (NOT p4)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p2 (NOT p4)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p4)), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 (NOT p4)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p4)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p4)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(EQ s1039 1), p2:(EQ s1102 1), p0:(EQ s965 1), p1:(AND (EQ s304 1) (EQ s312 1)), p4:(AND (EQ s1039 1) (EQ s1346 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][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2497 steps with 0 reset in 41 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-00 finished in 7972 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((X(p0)&&p0)))||G(p1)))'
Support contains 2 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1517 transition count 2061
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1517 transition count 2061
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 59 place count 1517 transition count 2044
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 1510 transition count 2037
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 1510 transition count 2037
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 80 place count 1510 transition count 2030
Applied a total of 80 rules in 289 ms. Remains 1510 /1538 variables (removed 28) and now considering 2030/2082 (removed 52) transitions.
// Phase 1: matrix 2030 rows 1510 cols
[2022-05-20 11:09:26] [INFO ] Computed 66 place invariants in 17 ms
[2022-05-20 11:09:27] [INFO ] Implicit Places using invariants in 1137 ms returned []
// Phase 1: matrix 2030 rows 1510 cols
[2022-05-20 11:09:27] [INFO ] Computed 66 place invariants in 10 ms
[2022-05-20 11:09:30] [INFO ] Implicit Places using invariants and state equation in 2520 ms returned []
Implicit Place search using SMT with State Equation took 3660 ms to find 0 implicit places.
// Phase 1: matrix 2030 rows 1510 cols
[2022-05-20 11:09:30] [INFO ] Computed 66 place invariants in 9 ms
[2022-05-20 11:09:32] [INFO ] Dead Transitions using invariants and state equation in 2623 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1510/1538 places, 2030/2082 transitions.
Finished structural reductions, in 1 iterations. Remains : 1510/1538 places, 2030/2082 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s759 1), p1:(EQ s153 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2618 steps with 1 reset in 16 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-01 finished in 6824 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1518 transition count 2062
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1518 transition count 2062
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 56 place count 1518 transition count 2046
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 1512 transition count 2040
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 1512 transition count 2040
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 74 place count 1512 transition count 2034
Applied a total of 74 rules in 231 ms. Remains 1512 /1538 variables (removed 26) and now considering 2034/2082 (removed 48) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2022-05-20 11:09:33] [INFO ] Computed 66 place invariants in 30 ms
[2022-05-20 11:09:34] [INFO ] Implicit Places using invariants in 1221 ms returned []
// Phase 1: matrix 2034 rows 1512 cols
[2022-05-20 11:09:34] [INFO ] Computed 66 place invariants in 11 ms
[2022-05-20 11:09:36] [INFO ] Implicit Places using invariants and state equation in 2296 ms returned []
Implicit Place search using SMT with State Equation took 3522 ms to find 0 implicit places.
// Phase 1: matrix 2034 rows 1512 cols
[2022-05-20 11:09:36] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-20 11:09:38] [INFO ] Dead Transitions using invariants and state equation in 1494 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1512/1538 places, 2034/2082 transitions.
Finished structural reductions, in 1 iterations. Remains : 1512/1538 places, 2034/2082 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1344 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 2309 steps with 0 reset in 15 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-02 finished in 5373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F((F(p0)&&G(p1)))||F(X(G(p2)))))))'
Support contains 3 out of 1538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Graph (trivial) has 1337 edges and 1538 vertex of which 474 / 1538 are part of one of the 33 SCC in 3 ms
Free SCC test removed 441 places
Ensure Unique test removed 472 transitions
Reduce isomorphic transitions removed 472 transitions.
Graph (complete) has 2703 edges and 1097 vertex of which 1096 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 261 rules applied. Total rules applied 263 place count 1095 transition count 1347
Reduce places removed 213 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 234 rules applied. Total rules applied 497 place count 882 transition count 1326
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 512 place count 873 transition count 1320
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 515 place count 871 transition count 1319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 516 place count 870 transition count 1319
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 95 Pre rules applied. Total rules applied 516 place count 870 transition count 1224
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 5 with 190 rules applied. Total rules applied 706 place count 775 transition count 1224
Discarding 94 places :
Symmetric choice reduction at 5 with 94 rule applications. Total rules 800 place count 681 transition count 1041
Iterating global reduction 5 with 94 rules applied. Total rules applied 894 place count 681 transition count 1041
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 5 with 66 rules applied. Total rules applied 960 place count 681 transition count 975
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 225
Deduced a syphon composed of 225 places in 1 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 6 with 450 rules applied. Total rules applied 1410 place count 456 transition count 750
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 6 with 50 rules applied. Total rules applied 1460 place count 456 transition count 700
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1461 place count 456 transition count 700
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1463 place count 454 transition count 698
Reduce places removed 2 places and 0 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 7 with 7 rules applied. Total rules applied 1470 place count 452 transition count 693
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1480 place count 447 transition count 688
Applied a total of 1480 rules in 240 ms. Remains 447 /1538 variables (removed 1091) and now considering 688/2082 (removed 1394) transitions.
[2022-05-20 11:09:38] [INFO ] Flow matrix only has 656 transitions (discarded 32 similar events)
// Phase 1: matrix 656 rows 447 cols
[2022-05-20 11:09:38] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-20 11:09:39] [INFO ] Implicit Places using invariants in 465 ms returned [11, 51, 100, 142, 211, 283]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 468 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 441/1538 places, 688/2082 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 441 transition count 671
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 51 place count 424 transition count 654
Applied a total of 51 rules in 25 ms. Remains 424 /441 variables (removed 17) and now considering 654/688 (removed 34) transitions.
[2022-05-20 11:09:39] [INFO ] Flow matrix only has 622 transitions (discarded 32 similar events)
// Phase 1: matrix 622 rows 424 cols
[2022-05-20 11:09:39] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-20 11:09:39] [INFO ] Implicit Places using invariants in 392 ms returned []
[2022-05-20 11:09:39] [INFO ] Flow matrix only has 622 transitions (discarded 32 similar events)
// Phase 1: matrix 622 rows 424 cols
[2022-05-20 11:09:39] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-20 11:09:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-20 11:09:40] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 424/1538 places, 654/2082 transitions.
Finished structural reductions, in 2 iterations. Remains : 424/1538 places, 654/2082 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s383 1), p1:(EQ s172 1), p2:(EQ s1 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-03 finished in 2361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(X(X(F(G(X((G(p2)||p1)))))))))'
Support contains 4 out of 1538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Graph (trivial) has 1333 edges and 1538 vertex of which 482 / 1538 are part of one of the 33 SCC in 3 ms
Free SCC test removed 449 places
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Graph (complete) has 2688 edges and 1089 vertex of which 1088 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 1087 transition count 1346
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 227 rules applied. Total rules applied 483 place count 881 transition count 1325
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 498 place count 872 transition count 1319
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 501 place count 870 transition count 1318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 502 place count 869 transition count 1318
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 95 Pre rules applied. Total rules applied 502 place count 869 transition count 1223
Deduced a syphon composed of 95 places in 5 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 5 with 190 rules applied. Total rules applied 692 place count 774 transition count 1223
Discarding 98 places :
Symmetric choice reduction at 5 with 98 rule applications. Total rules 790 place count 676 transition count 1033
Iterating global reduction 5 with 98 rules applied. Total rules applied 888 place count 676 transition count 1033
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 5 with 67 rules applied. Total rules applied 955 place count 676 transition count 966
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 225
Deduced a syphon composed of 225 places in 0 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 6 with 450 rules applied. Total rules applied 1405 place count 451 transition count 741
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 1453 place count 451 transition count 693
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1456 place count 451 transition count 690
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1457 place count 451 transition count 690
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1459 place count 449 transition count 688
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 7 with 33 rules applied. Total rules applied 1492 place count 440 transition count 664
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 1540 place count 416 transition count 640
Applied a total of 1540 rules in 326 ms. Remains 416 /1538 variables (removed 1122) and now considering 640/2082 (removed 1442) transitions.
[2022-05-20 11:09:41] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
// Phase 1: matrix 608 rows 416 cols
[2022-05-20 11:09:41] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 11:09:41] [INFO ] Implicit Places using invariants in 493 ms returned []
[2022-05-20 11:09:41] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
// Phase 1: matrix 608 rows 416 cols
[2022-05-20 11:09:41] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 11:09:42] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-20 11:09:42] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2022-05-20 11:09:42] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-20 11:09:42] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
// Phase 1: matrix 608 rows 416 cols
[2022-05-20 11:09:42] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 11:09:43] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 416/1538 places, 640/2082 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/1538 places, 640/2082 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s312 1), p2:(EQ s81 1), p1:(OR (EQ s29 1) (EQ s327 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-04 finished in 2721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(p0)))&&X(p1)))'
Support contains 2 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1519 transition count 2063
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1519 transition count 2063
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 53 place count 1519 transition count 2048
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 1512 transition count 2041
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 1512 transition count 2041
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 74 place count 1512 transition count 2034
Applied a total of 74 rules in 359 ms. Remains 1512 /1538 variables (removed 26) and now considering 2034/2082 (removed 48) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2022-05-20 11:09:43] [INFO ] Computed 66 place invariants in 12 ms
[2022-05-20 11:09:45] [INFO ] Implicit Places using invariants in 1115 ms returned []
// Phase 1: matrix 2034 rows 1512 cols
[2022-05-20 11:09:45] [INFO ] Computed 66 place invariants in 14 ms
[2022-05-20 11:09:47] [INFO ] Implicit Places using invariants and state equation in 2638 ms returned []
Implicit Place search using SMT with State Equation took 3755 ms to find 0 implicit places.
// Phase 1: matrix 2034 rows 1512 cols
[2022-05-20 11:09:47] [INFO ] Computed 66 place invariants in 10 ms
[2022-05-20 11:09:50] [INFO ] Dead Transitions using invariants and state equation in 2553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1512/1538 places, 2034/2082 transitions.
Finished structural reductions, in 1 iterations. Remains : 1512/1538 places, 2034/2082 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s966 1), p0:(EQ s641 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-05 finished in 6852 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F(p1))))'
Support contains 3 out of 1538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Graph (trivial) has 1336 edges and 1538 vertex of which 487 / 1538 are part of one of the 33 SCC in 2 ms
Free SCC test removed 454 places
Ensure Unique test removed 488 transitions
Reduce isomorphic transitions removed 488 transitions.
Graph (complete) has 2680 edges and 1084 vertex of which 1083 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 1082 transition count 1340
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 223 rules applied. Total rules applied 477 place count 878 transition count 1321
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 492 place count 870 transition count 1314
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 497 place count 867 transition count 1312
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 501 place count 865 transition count 1310
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 94 Pre rules applied. Total rules applied 501 place count 865 transition count 1216
Deduced a syphon composed of 94 places in 4 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 5 with 188 rules applied. Total rules applied 689 place count 771 transition count 1216
Discarding 97 places :
Symmetric choice reduction at 5 with 97 rule applications. Total rules 786 place count 674 transition count 1027
Iterating global reduction 5 with 97 rules applied. Total rules applied 883 place count 674 transition count 1027
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 5 with 70 rules applied. Total rules applied 953 place count 674 transition count 957
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 0 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 6 with 448 rules applied. Total rules applied 1401 place count 450 transition count 733
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 1449 place count 450 transition count 685
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1451 place count 448 transition count 683
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 7 with 33 rules applied. Total rules applied 1484 place count 439 transition count 659
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 1532 place count 415 transition count 635
Applied a total of 1532 rules in 144 ms. Remains 415 /1538 variables (removed 1123) and now considering 635/2082 (removed 1447) transitions.
[2022-05-20 11:09:50] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
// Phase 1: matrix 603 rows 415 cols
[2022-05-20 11:09:50] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 11:09:50] [INFO ] Implicit Places using invariants in 352 ms returned []
[2022-05-20 11:09:50] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
// Phase 1: matrix 603 rows 415 cols
[2022-05-20 11:09:50] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 11:09:51] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-20 11:09:51] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
[2022-05-20 11:09:52] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-20 11:09:52] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
// Phase 1: matrix 603 rows 415 cols
[2022-05-20 11:09:52] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 11:09:52] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 415/1538 places, 635/2082 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/1538 places, 635/2082 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s150 1), p1:(OR (EQ s213 0) (EQ s253 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 862 steps with 4 reset in 21 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-07 finished in 2598 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Graph (trivial) has 1339 edges and 1538 vertex of which 474 / 1538 are part of one of the 33 SCC in 2 ms
Free SCC test removed 441 places
Ensure Unique test removed 472 transitions
Reduce isomorphic transitions removed 472 transitions.
Graph (complete) has 2701 edges and 1097 vertex of which 1096 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 262 rules applied. Total rules applied 264 place count 1095 transition count 1346
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 236 rules applied. Total rules applied 500 place count 881 transition count 1324
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 516 place count 872 transition count 1317
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 519 place count 869 transition count 1317
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 95 Pre rules applied. Total rules applied 519 place count 869 transition count 1222
Deduced a syphon composed of 95 places in 6 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 709 place count 774 transition count 1222
Discarding 95 places :
Symmetric choice reduction at 4 with 95 rule applications. Total rules 804 place count 679 transition count 1037
Iterating global reduction 4 with 95 rules applied. Total rules applied 899 place count 679 transition count 1037
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 4 with 67 rules applied. Total rules applied 966 place count 679 transition count 970
Performed 228 Post agglomeration using F-continuation condition.Transition count delta: 228
Deduced a syphon composed of 228 places in 1 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 5 with 456 rules applied. Total rules applied 1422 place count 451 transition count 742
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 5 with 50 rules applied. Total rules applied 1472 place count 451 transition count 692
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1474 place count 449 transition count 690
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1507 place count 440 transition count 666
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1555 place count 416 transition count 642
Applied a total of 1555 rules in 196 ms. Remains 416 /1538 variables (removed 1122) and now considering 642/2082 (removed 1440) transitions.
[2022-05-20 11:09:53] [INFO ] Flow matrix only has 610 transitions (discarded 32 similar events)
// Phase 1: matrix 610 rows 416 cols
[2022-05-20 11:09:53] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 11:09:53] [INFO ] Implicit Places using invariants in 465 ms returned []
[2022-05-20 11:09:53] [INFO ] Flow matrix only has 610 transitions (discarded 32 similar events)
// Phase 1: matrix 610 rows 416 cols
[2022-05-20 11:09:53] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 11:09:54] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-20 11:09:54] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2022-05-20 11:09:54] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-20 11:09:54] [INFO ] Flow matrix only has 610 transitions (discarded 32 similar events)
// Phase 1: matrix 610 rows 416 cols
[2022-05-20 11:09:54] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 11:09:55] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 416/1538 places, 642/2082 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/1538 places, 642/2082 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 180 steps with 1 reset in 2 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-09 finished in 2135 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F((G(p1)&&p0))))||G(p2)))'
Support contains 5 out of 1538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Graph (trivial) has 1331 edges and 1538 vertex of which 486 / 1538 are part of one of the 33 SCC in 2 ms
Free SCC test removed 453 places
Ensure Unique test removed 486 transitions
Reduce isomorphic transitions removed 486 transitions.
Graph (complete) has 2682 edges and 1085 vertex of which 1084 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 250 rules applied. Total rules applied 252 place count 1083 transition count 1344
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 218 rules applied. Total rules applied 470 place count 881 transition count 1328
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 481 place count 875 transition count 1323
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 483 place count 873 transition count 1323
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 98 Pre rules applied. Total rules applied 483 place count 873 transition count 1225
Deduced a syphon composed of 98 places in 5 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 679 place count 775 transition count 1225
Discarding 98 places :
Symmetric choice reduction at 4 with 98 rule applications. Total rules 777 place count 677 transition count 1035
Iterating global reduction 4 with 98 rules applied. Total rules applied 875 place count 677 transition count 1035
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 945 place count 677 transition count 965
Performed 222 Post agglomeration using F-continuation condition.Transition count delta: 222
Deduced a syphon composed of 222 places in 0 ms
Reduce places removed 222 places and 0 transitions.
Iterating global reduction 5 with 444 rules applied. Total rules applied 1389 place count 455 transition count 743
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1437 place count 455 transition count 695
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1438 place count 455 transition count 694
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1441 place count 455 transition count 694
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1443 place count 453 transition count 692
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1476 place count 444 transition count 668
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1524 place count 420 transition count 644
Applied a total of 1524 rules in 214 ms. Remains 420 /1538 variables (removed 1118) and now considering 644/2082 (removed 1438) transitions.
[2022-05-20 11:09:55] [INFO ] Flow matrix only has 612 transitions (discarded 32 similar events)
// Phase 1: matrix 612 rows 420 cols
[2022-05-20 11:09:55] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 11:09:55] [INFO ] Implicit Places using invariants in 552 ms returned []
[2022-05-20 11:09:55] [INFO ] Flow matrix only has 612 transitions (discarded 32 similar events)
// Phase 1: matrix 612 rows 420 cols
[2022-05-20 11:09:55] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 11:09:56] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-20 11:09:56] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
[2022-05-20 11:09:57] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-20 11:09:57] [INFO ] Flow matrix only has 612 transitions (discarded 32 similar events)
// Phase 1: matrix 612 rows 420 cols
[2022-05-20 11:09:57] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 11:09:57] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/1538 places, 644/2082 transitions.
Finished structural reductions, in 1 iterations. Remains : 420/1538 places, 644/2082 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s272 1), p0:(AND (OR (EQ s144 0) (EQ s111 0)) (EQ s117 0)), p1:(EQ s16 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 191 steps with 1 reset in 2 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-10 finished in 2809 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U X(p1)))'
Support contains 4 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1519 transition count 2063
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1519 transition count 2063
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 53 place count 1519 transition count 2048
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 1513 transition count 2042
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 1513 transition count 2042
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 1513 transition count 2036
Applied a total of 71 rules in 217 ms. Remains 1513 /1538 variables (removed 25) and now considering 2036/2082 (removed 46) transitions.
// Phase 1: matrix 2036 rows 1513 cols
[2022-05-20 11:09:58] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-20 11:09:59] [INFO ] Implicit Places using invariants in 1120 ms returned []
// Phase 1: matrix 2036 rows 1513 cols
[2022-05-20 11:09:59] [INFO ] Computed 66 place invariants in 9 ms
[2022-05-20 11:10:01] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 3192 ms to find 0 implicit places.
// Phase 1: matrix 2036 rows 1513 cols
[2022-05-20 11:10:01] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 11:10:03] [INFO ] Dead Transitions using invariants and state equation in 2592 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1513/1538 places, 2036/2082 transitions.
Finished structural reductions, in 1 iterations. Remains : 1513/1538 places, 2036/2082 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s369 1) (EQ s606 1)), p0:(AND (EQ s505 1) (EQ s584 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-11 finished in 6134 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((F(p0)||p1)))))'
Support contains 3 out of 1538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1538/1538 places, 2082/2082 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1519 transition count 2063
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1519 transition count 2063
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 53 place count 1519 transition count 2048
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 1514 transition count 2043
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 1514 transition count 2043
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 68 place count 1514 transition count 2038
Applied a total of 68 rules in 287 ms. Remains 1514 /1538 variables (removed 24) and now considering 2038/2082 (removed 44) transitions.
// Phase 1: matrix 2038 rows 1514 cols
[2022-05-20 11:10:04] [INFO ] Computed 66 place invariants in 9 ms
[2022-05-20 11:10:05] [INFO ] Implicit Places using invariants in 1197 ms returned []
// Phase 1: matrix 2038 rows 1514 cols
[2022-05-20 11:10:05] [INFO ] Computed 66 place invariants in 10 ms
[2022-05-20 11:10:07] [INFO ] Implicit Places using invariants and state equation in 2283 ms returned []
Implicit Place search using SMT with State Equation took 3483 ms to find 0 implicit places.
// Phase 1: matrix 2038 rows 1514 cols
[2022-05-20 11:10:07] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-20 11:10:10] [INFO ] Dead Transitions using invariants and state equation in 2278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1514/1538 places, 2038/2082 transitions.
Finished structural reductions, in 1 iterations. Remains : 1514/1538 places, 2038/2082 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s1383 1) (EQ s641 1)) (EQ s641 1)), p1:(EQ s1132 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 2085 steps with 0 reset in 19 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-15 finished in 6203 ms.
All properties solved by simple procedures.
Total runtime 88484 ms.

BK_STOP 1653045010444

--------------------
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-8B"
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-8B, 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-165276998600236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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