fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r265-smll-167863539900348
Last Updated
May 14, 2023

About the Execution of LTSMin+red for NoC3x3-PT-8B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
650.827 61257.00 92518.00 676.20 FFFFFTTFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r265-smll-167863539900348.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r265-smll-167863539900348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 09:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 09:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 5 18:23 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 1678980739644

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 15:32:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 15:32:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 15:32:22] [INFO ] Load time of PNML (sax parser for PT used): 717 ms
[2023-03-16 15:32:23] [INFO ] Transformed 9140 places.
[2023-03-16 15:32:23] [INFO ] Transformed 14577 transitions.
[2023-03-16 15:32:23] [INFO ] Found NUPN structural information;
[2023-03-16 15:32:23] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 938 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA NoC3x3-PT-8B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLFireability-11 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 30 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 5496 places :
Symmetric choice reduction at 1 with 5496 rule applications. Total rules 5529 place count 3611 transition count 9081
Iterating global reduction 1 with 5496 rules applied. Total rules applied 11025 place count 3611 transition count 9081
Ensure Unique test removed 3044 transitions
Reduce isomorphic transitions removed 3044 transitions.
Iterating post reduction 1 with 3044 rules applied. Total rules applied 14069 place count 3611 transition count 6037
Discarding 1999 places :
Symmetric choice reduction at 2 with 1999 rule applications. Total rules 16068 place count 1612 transition count 4038
Iterating global reduction 2 with 1999 rules applied. Total rules applied 18067 place count 1612 transition count 4038
Ensure Unique test removed 1871 transitions
Reduce isomorphic transitions removed 1871 transitions.
Iterating post reduction 2 with 1871 rules applied. Total rules applied 19938 place count 1612 transition count 2167
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 20004 place count 1546 transition count 2101
Iterating global reduction 3 with 66 rules applied. Total rules applied 20070 place count 1546 transition count 2101
Applied a total of 20070 rules in 1912 ms. Remains 1546 /9140 variables (removed 7594) and now considering 2101/14577 (removed 12476) transitions.
// Phase 1: matrix 2101 rows 1546 cols
[2023-03-16 15:32:25] [INFO ] Computed 66 place invariants in 35 ms
[2023-03-16 15:32:26] [INFO ] Implicit Places using invariants in 1174 ms returned []
[2023-03-16 15:32:26] [INFO ] Invariant cache hit.
[2023-03-16 15:32:28] [INFO ] Implicit Places using invariants and state equation in 2169 ms returned []
Implicit Place search using SMT with State Equation took 3395 ms to find 0 implicit places.
[2023-03-16 15:32:28] [INFO ] Invariant cache hit.
[2023-03-16 15:32:30] [INFO ] Dead Transitions using invariants and state equation in 1690 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1546/9140 places, 2101/14577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7002 ms. Remains : 1546/9140 places, 2101/14577 transitions.
Support contains 30 out of 1546 places after structural reductions.
[2023-03-16 15:32:31] [INFO ] Flatten gal took : 259 ms
[2023-03-16 15:32:31] [INFO ] Flatten gal took : 138 ms
[2023-03-16 15:32:31] [INFO ] Input system was already deterministic with 2101 transitions.
Support contains 29 out of 1546 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 23) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-16 15:32:32] [INFO ] Invariant cache hit.
[2023-03-16 15:32:33] [INFO ] [Real]Absence check using 66 positive place invariants in 64 ms returned sat
[2023-03-16 15:32:33] [INFO ] After 718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-16 15:32:34] [INFO ] [Nat]Absence check using 66 positive place invariants in 62 ms returned sat
[2023-03-16 15:32:36] [INFO ] After 1764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-16 15:32:36] [INFO ] Deduced a trap composed of 51 places in 393 ms of which 6 ms to minimize.
[2023-03-16 15:32:37] [INFO ] Deduced a trap composed of 41 places in 439 ms of which 2 ms to minimize.
[2023-03-16 15:32:37] [INFO ] Deduced a trap composed of 42 places in 468 ms of which 2 ms to minimize.
[2023-03-16 15:32:38] [INFO ] Deduced a trap composed of 60 places in 478 ms of which 3 ms to minimize.
[2023-03-16 15:32:38] [INFO ] Deduced a trap composed of 76 places in 368 ms of which 2 ms to minimize.
[2023-03-16 15:32:39] [INFO ] Deduced a trap composed of 105 places in 308 ms of which 1 ms to minimize.
[2023-03-16 15:32:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3007 ms
[2023-03-16 15:32:40] [INFO ] After 5970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 674 ms.
[2023-03-16 15:32:41] [INFO ] After 7523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 157 ms.
Support contains 8 out of 1546 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Graph (trivial) has 1345 edges and 1546 vertex of which 485 / 1546 are part of one of the 33 SCC in 9 ms
Free SCC test removed 452 places
Drop transitions removed 518 transitions
Reduce isomorphic transitions removed 518 transitions.
Graph (complete) has 2669 edges and 1094 vertex of which 1093 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 251 rules applied. Total rules applied 253 place count 1093 transition count 1332
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 225 rules applied. Total rules applied 478 place count 890 transition count 1310
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 2 with 23 rules applied. Total rules applied 501 place count 880 transition count 1297
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 506 place count 875 transition count 1297
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 506 place count 875 transition count 1200
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 700 place count 778 transition count 1200
Discarding 94 places :
Symmetric choice reduction at 4 with 94 rule applications. Total rules 794 place count 684 transition count 1016
Iterating global reduction 4 with 94 rules applied. Total rules applied 888 place count 684 transition count 1016
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 4 with 68 rules applied. Total rules applied 956 place count 684 transition count 948
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 5 with 450 rules applied. Total rules applied 1406 place count 459 transition count 723
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1454 place count 459 transition count 675
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1460 place count 456 transition count 716
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1461 place count 456 transition count 715
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 1476 place count 456 transition count 700
Free-agglomeration rule applied 207 times.
Iterating global reduction 7 with 207 rules applied. Total rules applied 1683 place count 456 transition count 493
Reduce places removed 207 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 810 edges and 249 vertex of which 242 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 220 rules applied. Total rules applied 1903 place count 242 transition count 481
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1910 place count 242 transition count 474
Drop transitions removed 168 transitions
Redundant transition composition rules discarded 168 transitions
Iterating global reduction 9 with 168 rules applied. Total rules applied 2078 place count 242 transition count 306
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 629 edges and 234 vertex of which 212 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 9 rules applied. Total rules applied 2087 place count 212 transition count 306
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 2109 place count 212 transition count 284
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 11 with 25 rules applied. Total rules applied 2134 place count 212 transition count 284
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2135 place count 212 transition count 283
Applied a total of 2135 rules in 435 ms. Remains 212 /1546 variables (removed 1334) and now considering 283/2101 (removed 1818) transitions.
// Phase 1: matrix 283 rows 212 cols
[2023-03-16 15:32:41] [INFO ] Computed 58 place invariants in 35 ms
[2023-03-16 15:32:42] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 732 ms. Remains : 212/1546 places, 283/2101 transitions.
Finished random walk after 802 steps, including 0 resets, run visited all 5 properties in 12 ms. (steps per millisecond=66 )
Computed a total of 199 stabilizing places and 319 stable transitions
Graph (complete) has 3242 edges and 1546 vertex of which 1544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.57 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1)||(p2&&F(p3)))))'
Support contains 3 out of 1546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Graph (trivial) has 1351 edges and 1546 vertex of which 485 / 1546 are part of one of the 33 SCC in 3 ms
Free SCC test removed 452 places
Ensure Unique test removed 484 transitions
Reduce isomorphic transitions removed 484 transitions.
Graph (complete) has 2702 edges and 1094 vertex of which 1092 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 255 rules applied. Total rules applied 257 place count 1091 transition count 1359
Reduce places removed 205 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 1 with 230 rules applied. Total rules applied 487 place count 886 transition count 1334
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 2 with 27 rules applied. Total rules applied 514 place count 875 transition count 1318
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 521 place count 868 transition count 1318
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 521 place count 868 transition count 1222
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 713 place count 772 transition count 1222
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 810 place count 675 transition count 1033
Iterating global reduction 4 with 97 rules applied. Total rules applied 907 place count 675 transition count 1033
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 977 place count 675 transition count 963
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 5 with 448 rules applied. Total rules applied 1425 place count 451 transition count 739
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1473 place count 451 transition count 691
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1475 place count 451 transition count 689
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1477 place count 451 transition count 689
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1479 place count 449 transition count 687
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 1512 place count 440 transition count 663
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 1560 place count 416 transition count 639
Applied a total of 1560 rules in 273 ms. Remains 416 /1546 variables (removed 1130) and now considering 639/2101 (removed 1462) transitions.
[2023-03-16 15:32:42] [INFO ] Flow matrix only has 607 transitions (discarded 32 similar events)
// Phase 1: matrix 607 rows 416 cols
[2023-03-16 15:32:42] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 15:32:43] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-16 15:32:43] [INFO ] Flow matrix only has 607 transitions (discarded 32 similar events)
[2023-03-16 15:32:43] [INFO ] Invariant cache hit.
[2023-03-16 15:32:43] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-16 15:32:43] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
[2023-03-16 15:32:43] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-16 15:32:43] [INFO ] Flow matrix only has 607 transitions (discarded 32 similar events)
[2023-03-16 15:32:43] [INFO ] Invariant cache hit.
[2023-03-16 15:32:44] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 416/1546 places, 639/2101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1765 ms. Remains : 416/1546 places, 639/2101 transitions.
Stuttering acceptance computed with spot in 418 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s409 1), p1:(EQ s325 1), p2:(EQ s109 0), p3:(EQ s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-00 finished in 2268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 3 out of 1546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Graph (trivial) has 1351 edges and 1546 vertex of which 486 / 1546 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 2700 edges and 1093 vertex of which 1091 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 1090 transition count 1359
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 1 with 227 rules applied. Total rules applied 482 place count 887 transition count 1335
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 2 with 26 rules applied. Total rules applied 508 place count 876 transition count 1320
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 514 place count 870 transition count 1320
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 514 place count 870 transition count 1223
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 708 place count 773 transition count 1223
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 805 place count 676 transition count 1034
Iterating global reduction 4 with 97 rules applied. Total rules applied 902 place count 676 transition count 1034
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 972 place count 676 transition count 964
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 5 with 448 rules applied. Total rules applied 1420 place count 452 transition count 740
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1468 place count 452 transition count 692
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1470 place count 452 transition count 690
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1472 place count 452 transition count 690
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1474 place count 450 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 6 with 33 rules applied. Total rules applied 1507 place count 441 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 7 with 48 rules applied. Total rules applied 1555 place count 417 transition count 640
Applied a total of 1555 rules in 237 ms. Remains 417 /1546 variables (removed 1129) and now considering 640/2101 (removed 1461) transitions.
[2023-03-16 15:32:45] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
// Phase 1: matrix 608 rows 417 cols
[2023-03-16 15:32:45] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 15:32:45] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-16 15:32:45] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
[2023-03-16 15:32:45] [INFO ] Invariant cache hit.
[2023-03-16 15:32:45] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-16 15:32:46] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
[2023-03-16 15:32:46] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-16 15:32:46] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
[2023-03-16 15:32:46] [INFO ] Invariant cache hit.
[2023-03-16 15:32:46] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 417/1546 places, 640/2101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1991 ms. Remains : 417/1546 places, 640/2101 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s57 0) (EQ s152 0)), p1:(EQ s226 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8302 steps with 50 reset in 129 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-01 finished in 2259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(G((F(G(p2))&&p1)) U p3)))))'
Support contains 6 out of 1546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1526 transition count 2081
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1526 transition count 2081
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 60 place count 1526 transition count 2061
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 74 place count 1512 transition count 2047
Iterating global reduction 1 with 14 rules applied. Total rules applied 88 place count 1512 transition count 2047
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 102 place count 1512 transition count 2033
Applied a total of 102 rules in 316 ms. Remains 1512 /1546 variables (removed 34) and now considering 2033/2101 (removed 68) transitions.
// Phase 1: matrix 2033 rows 1512 cols
[2023-03-16 15:32:47] [INFO ] Computed 66 place invariants in 14 ms
[2023-03-16 15:32:48] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-03-16 15:32:48] [INFO ] Invariant cache hit.
[2023-03-16 15:32:50] [INFO ] Implicit Places using invariants and state equation in 2079 ms returned []
Implicit Place search using SMT with State Equation took 2872 ms to find 0 implicit places.
[2023-03-16 15:32:50] [INFO ] Invariant cache hit.
[2023-03-16 15:32:52] [INFO ] Dead Transitions using invariants and state equation in 1851 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1512/1546 places, 2033/2101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5049 ms. Remains : 1512/1546 places, 2033/2101 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), true, (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p3 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s609 1) (EQ s718 1)), p1:(AND (EQ s512 1) (EQ s582 1)), p0:(EQ s1375 1), p2:(EQ s1382 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-02 finished in 5411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Graph (trivial) has 1355 edges and 1546 vertex of which 485 / 1546 are part of one of the 33 SCC in 2 ms
Free SCC test removed 452 places
Ensure Unique test removed 484 transitions
Reduce isomorphic transitions removed 484 transitions.
Graph (complete) has 2702 edges and 1094 vertex of which 1092 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 1091 transition count 1357
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 236 rules applied. Total rules applied 495 place count 884 transition count 1328
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 2 with 33 rules applied. Total rules applied 528 place count 871 transition count 1308
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 537 place count 862 transition count 1308
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 537 place count 862 transition count 1214
Deduced a syphon composed of 94 places in 3 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 725 place count 768 transition count 1214
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 822 place count 671 transition count 1025
Iterating global reduction 4 with 97 rules applied. Total rules applied 919 place count 671 transition count 1025
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 989 place count 671 transition count 955
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 1433 place count 449 transition count 733
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1481 place count 449 transition count 685
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1483 place count 447 transition count 683
Reduce places removed 1 places and 0 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 6 with 3 rules applied. Total rules applied 1486 place count 446 transition count 681
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1490 place count 444 transition count 679
Applied a total of 1490 rules in 162 ms. Remains 444 /1546 variables (removed 1102) and now considering 679/2101 (removed 1422) transitions.
[2023-03-16 15:32:52] [INFO ] Flow matrix only has 647 transitions (discarded 32 similar events)
// Phase 1: matrix 647 rows 444 cols
[2023-03-16 15:32:52] [INFO ] Computed 65 place invariants in 3 ms
[2023-03-16 15:32:52] [INFO ] Implicit Places using invariants in 328 ms returned [11, 51, 100, 142, 205, 278, 327, 370]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 333 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 436/1546 places, 679/2101 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 436 transition count 657
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 66 place count 414 transition count 635
Applied a total of 66 rules in 20 ms. Remains 414 /436 variables (removed 22) and now considering 635/679 (removed 44) transitions.
[2023-03-16 15:32:52] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
// Phase 1: matrix 603 rows 414 cols
[2023-03-16 15:32:52] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 15:32:53] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-16 15:32:53] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
[2023-03-16 15:32:53] [INFO ] Invariant cache hit.
[2023-03-16 15:32:53] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-16 15:32:54] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 414/1546 places, 635/2101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1578 ms. Remains : 414/1546 places, 635/2101 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-03 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 s1 0) (EQ s241 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-8B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-03 finished in 1643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 3 out of 1546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Graph (trivial) has 1351 edges and 1546 vertex of which 486 / 1546 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 2700 edges and 1093 vertex of which 1091 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 1090 transition count 1359
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 229 rules applied. Total rules applied 484 place count 887 transition count 1333
Reduce places removed 12 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 2 with 31 rules applied. Total rules applied 515 place count 875 transition count 1314
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 523 place count 867 transition count 1314
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 523 place count 867 transition count 1217
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 717 place count 770 transition count 1217
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 814 place count 673 transition count 1028
Iterating global reduction 4 with 97 rules applied. Total rules applied 911 place count 673 transition count 1028
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 981 place count 673 transition count 958
Performed 221 Post agglomeration using F-continuation condition.Transition count delta: 221
Deduced a syphon composed of 221 places in 0 ms
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 5 with 442 rules applied. Total rules applied 1423 place count 452 transition count 737
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1471 place count 452 transition count 689
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1473 place count 452 transition count 689
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1475 place count 450 transition count 687
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 1508 place count 441 transition count 663
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 1556 place count 417 transition count 639
Applied a total of 1556 rules in 141 ms. Remains 417 /1546 variables (removed 1129) and now considering 639/2101 (removed 1462) transitions.
[2023-03-16 15:32:54] [INFO ] Flow matrix only has 607 transitions (discarded 32 similar events)
// Phase 1: matrix 607 rows 417 cols
[2023-03-16 15:32:54] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 15:32:54] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-16 15:32:54] [INFO ] Flow matrix only has 607 transitions (discarded 32 similar events)
[2023-03-16 15:32:54] [INFO ] Invariant cache hit.
[2023-03-16 15:32:54] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-16 15:32:55] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
[2023-03-16 15:32:55] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 15:32:55] [INFO ] Flow matrix only has 607 transitions (discarded 32 similar events)
[2023-03-16 15:32:55] [INFO ] Invariant cache hit.
[2023-03-16 15:32:55] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 417/1546 places, 639/2101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1810 ms. Remains : 417/1546 places, 639/2101 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s237 1), p0:(OR (EQ s141 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-8B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-04 finished in 1865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F(p1))))))'
Support contains 2 out of 1546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1526 transition count 2081
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1526 transition count 2081
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 58 place count 1526 transition count 2063
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 71 place count 1513 transition count 2050
Iterating global reduction 1 with 13 rules applied. Total rules applied 84 place count 1513 transition count 2050
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 97 place count 1513 transition count 2037
Applied a total of 97 rules in 209 ms. Remains 1513 /1546 variables (removed 33) and now considering 2037/2101 (removed 64) transitions.
// Phase 1: matrix 2037 rows 1513 cols
[2023-03-16 15:32:56] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-16 15:32:56] [INFO ] Implicit Places using invariants in 724 ms returned []
[2023-03-16 15:32:56] [INFO ] Invariant cache hit.
[2023-03-16 15:32:58] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2718 ms to find 0 implicit places.
[2023-03-16 15:32:58] [INFO ] Invariant cache hit.
[2023-03-16 15:33:00] [INFO ] Dead Transitions using invariants and state equation in 1854 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1513/1546 places, 2037/2101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4788 ms. Remains : 1513/1546 places, 2037/2101 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s332 0), p0:(EQ s1106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1867 steps with 0 reset in 10 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-07 finished in 4958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 1546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1527 transition count 2082
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1527 transition count 2082
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 56 place count 1527 transition count 2064
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 68 place count 1515 transition count 2052
Iterating global reduction 1 with 12 rules applied. Total rules applied 80 place count 1515 transition count 2052
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 92 place count 1515 transition count 2040
Applied a total of 92 rules in 221 ms. Remains 1515 /1546 variables (removed 31) and now considering 2040/2101 (removed 61) transitions.
// Phase 1: matrix 2040 rows 1515 cols
[2023-03-16 15:33:01] [INFO ] Computed 66 place invariants in 10 ms
[2023-03-16 15:33:01] [INFO ] Implicit Places using invariants in 823 ms returned []
[2023-03-16 15:33:01] [INFO ] Invariant cache hit.
[2023-03-16 15:33:03] [INFO ] Implicit Places using invariants and state equation in 2046 ms returned []
Implicit Place search using SMT with State Equation took 2871 ms to find 0 implicit places.
[2023-03-16 15:33:04] [INFO ] Invariant cache hit.
[2023-03-16 15:33:06] [INFO ] Dead Transitions using invariants and state equation in 2167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1515/1546 places, 2040/2101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5263 ms. Remains : 1515/1546 places, 2040/2101 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-08 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 s607 1) (AND (EQ s188 0) (EQ s188 1) (EQ s427 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 3248 steps with 0 reset in 17 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-08 finished in 5458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 3 out of 1546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Graph (trivial) has 1351 edges and 1546 vertex of which 486 / 1546 are part of one of the 33 SCC in 1 ms
Free SCC test removed 453 places
Ensure Unique test removed 486 transitions
Reduce isomorphic transitions removed 486 transitions.
Graph (complete) has 2700 edges and 1093 vertex of which 1091 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 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 254 rules applied. Total rules applied 256 place count 1090 transition count 1358
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 227 rules applied. Total rules applied 483 place count 886 transition count 1335
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 2 with 24 rules applied. Total rules applied 507 place count 876 transition count 1321
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 513 place count 870 transition count 1321
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 97 Pre rules applied. Total rules applied 513 place count 870 transition count 1224
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 707 place count 773 transition count 1224
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 804 place count 676 transition count 1035
Iterating global reduction 4 with 97 rules applied. Total rules applied 901 place count 676 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 971 place count 676 transition count 965
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 7 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 5 with 448 rules applied. Total rules applied 1419 place count 452 transition count 741
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1467 place count 452 transition count 693
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1470 place count 452 transition count 690
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1473 place count 452 transition count 690
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1475 place count 450 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 6 with 33 rules applied. Total rules applied 1508 place count 441 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 7 with 48 rules applied. Total rules applied 1556 place count 417 transition count 640
Applied a total of 1556 rules in 160 ms. Remains 417 /1546 variables (removed 1129) and now considering 640/2101 (removed 1461) transitions.
[2023-03-16 15:33:06] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
// Phase 1: matrix 608 rows 417 cols
[2023-03-16 15:33:06] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-16 15:33:06] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-16 15:33:06] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
[2023-03-16 15:33:06] [INFO ] Invariant cache hit.
[2023-03-16 15:33:07] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-16 15:33:07] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2023-03-16 15:33:07] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 15:33:07] [INFO ] Flow matrix only has 608 transitions (discarded 32 similar events)
[2023-03-16 15:33:07] [INFO ] Invariant cache hit.
[2023-03-16 15:33:08] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 417/1546 places, 640/2101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1720 ms. Remains : 417/1546 places, 640/2101 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
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 p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s57 0), p1:(EQ s141 0), p2:(EQ s154 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 106 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-09 finished in 1911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1546 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Graph (trivial) has 1354 edges and 1546 vertex of which 486 / 1546 are part of one of the 33 SCC in 0 ms
Free SCC test removed 453 places
Ensure Unique test removed 486 transitions
Reduce isomorphic transitions removed 486 transitions.
Graph (complete) has 2700 edges and 1093 vertex of which 1091 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 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 256 rules applied. Total rules applied 258 place count 1090 transition count 1356
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 234 rules applied. Total rules applied 492 place count 884 transition count 1328
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 2 with 30 rules applied. Total rules applied 522 place count 872 transition count 1310
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 531 place count 864 transition count 1309
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 533 place count 863 transition count 1308
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 95 Pre rules applied. Total rules applied 533 place count 863 transition count 1213
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 723 place count 768 transition count 1213
Discarding 97 places :
Symmetric choice reduction at 5 with 97 rule applications. Total rules 820 place count 671 transition count 1024
Iterating global reduction 5 with 97 rules applied. Total rules applied 917 place count 671 transition count 1024
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 5 with 70 rules applied. Total rules applied 987 place count 671 transition count 954
Performed 223 Post agglomeration using F-continuation condition.Transition count delta: 223
Deduced a syphon composed of 223 places in 0 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 6 with 446 rules applied. Total rules applied 1433 place count 448 transition count 731
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 1481 place count 448 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1483 place count 446 transition count 681
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 1516 place count 437 transition count 657
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 1564 place count 413 transition count 633
Applied a total of 1564 rules in 117 ms. Remains 413 /1546 variables (removed 1133) and now considering 633/2101 (removed 1468) transitions.
[2023-03-16 15:33:08] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
// Phase 1: matrix 601 rows 413 cols
[2023-03-16 15:33:08] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-16 15:33:08] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-16 15:33:08] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
[2023-03-16 15:33:08] [INFO ] Invariant cache hit.
[2023-03-16 15:33:09] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-16 15:33:09] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
[2023-03-16 15:33:09] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 15:33:09] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
[2023-03-16 15:33:09] [INFO ] Invariant cache hit.
[2023-03-16 15:33:09] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 413/1546 places, 633/2101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1569 ms. Remains : 413/1546 places, 633/2101 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-10 finished in 1623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1525 transition count 2080
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1525 transition count 2080
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 62 place count 1525 transition count 2060
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 75 place count 1512 transition count 2047
Iterating global reduction 1 with 13 rules applied. Total rules applied 88 place count 1512 transition count 2047
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 101 place count 1512 transition count 2034
Applied a total of 101 rules in 215 ms. Remains 1512 /1546 variables (removed 34) and now considering 2034/2101 (removed 67) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2023-03-16 15:33:10] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-16 15:33:10] [INFO ] Implicit Places using invariants in 777 ms returned []
[2023-03-16 15:33:10] [INFO ] Invariant cache hit.
[2023-03-16 15:33:12] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 2807 ms to find 0 implicit places.
[2023-03-16 15:33:12] [INFO ] Invariant cache hit.
[2023-03-16 15:33:14] [INFO ] Dead Transitions using invariants and state equation in 1553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1512/1546 places, 2034/2101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4582 ms. Remains : 1512/1546 places, 2034/2101 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s425 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4231 steps with 1 reset in 22 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-13 finished in 4754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F((p0&&F(p1)))))))'
Support contains 2 out of 1546 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1546/1546 places, 2101/2101 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1526 transition count 2081
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1526 transition count 2081
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 59 place count 1526 transition count 2062
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 72 place count 1513 transition count 2049
Iterating global reduction 1 with 13 rules applied. Total rules applied 85 place count 1513 transition count 2049
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 98 place count 1513 transition count 2036
Applied a total of 98 rules in 217 ms. Remains 1513 /1546 variables (removed 33) and now considering 2036/2101 (removed 65) transitions.
// Phase 1: matrix 2036 rows 1513 cols
[2023-03-16 15:33:14] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-16 15:33:15] [INFO ] Implicit Places using invariants in 783 ms returned []
[2023-03-16 15:33:15] [INFO ] Invariant cache hit.
[2023-03-16 15:33:17] [INFO ] Implicit Places using invariants and state equation in 2171 ms returned []
Implicit Place search using SMT with State Equation took 2960 ms to find 0 implicit places.
[2023-03-16 15:33:17] [INFO ] Invariant cache hit.
[2023-03-16 15:33:19] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1513/1546 places, 2036/2101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4879 ms. Remains : 1513/1546 places, 2036/2101 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s153 1), p0:(EQ s967 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-15 finished in 5094 ms.
All properties solved by simple procedures.
Total runtime 57584 ms.
ITS solved all properties within timeout

BK_STOP 1678980800901

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
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 r265-smll-167863539900348"
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 ;