Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372700393.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is NoC3x3-PT-5B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372700393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 525K May 18 16:43 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-5B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716691933899

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 02:52:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 02:52:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:52:16] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-26 02:52:16] [INFO ] Transformed 1571 places.
[2024-05-26 02:52:16] [INFO ] Transformed 2173 transitions.
[2024-05-26 02:52:16] [INFO ] Found NUPN structural information;
[2024-05-26 02:52:16] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-5B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Discarding 438 places :
Symmetric choice reduction at 0 with 438 rule applications. Total rules 438 place count 1133 transition count 1735
Iterating global reduction 0 with 438 rules applied. Total rules applied 876 place count 1133 transition count 1735
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 994 place count 1015 transition count 1609
Iterating global reduction 0 with 118 rules applied. Total rules applied 1112 place count 1015 transition count 1609
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 1205 place count 922 transition count 1451
Iterating global reduction 0 with 93 rules applied. Total rules applied 1298 place count 922 transition count 1451
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 1322 place count 898 transition count 1403
Iterating global reduction 0 with 24 rules applied. Total rules applied 1346 place count 898 transition count 1403
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 1353 place count 891 transition count 1389
Iterating global reduction 0 with 7 rules applied. Total rules applied 1360 place count 891 transition count 1389
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 1367 place count 884 transition count 1382
Iterating global reduction 0 with 7 rules applied. Total rules applied 1374 place count 884 transition count 1382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1377 place count 881 transition count 1376
Iterating global reduction 0 with 3 rules applied. Total rules applied 1380 place count 881 transition count 1376
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1382 place count 879 transition count 1370
Iterating global reduction 0 with 2 rules applied. Total rules applied 1384 place count 879 transition count 1370
Applied a total of 1384 rules in 384 ms. Remains 879 /1571 variables (removed 692) and now considering 1370/2173 (removed 803) transitions.
// Phase 1: matrix 1370 rows 879 cols
[2024-05-26 02:52:17] [INFO ] Computed 66 invariants in 32 ms
[2024-05-26 02:52:17] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-26 02:52:17] [INFO ] Invariant cache hit.
[2024-05-26 02:52:18] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2024-05-26 02:52:18] [INFO ] Invariant cache hit.
[2024-05-26 02:52:19] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 879/1571 places, 1370/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2241 ms. Remains : 879/1571 places, 1370/2173 transitions.
Support contains 34 out of 879 places after structural reductions.
[2024-05-26 02:52:19] [INFO ] Flatten gal took : 112 ms
[2024-05-26 02:52:19] [INFO ] Flatten gal took : 66 ms
[2024-05-26 02:52:19] [INFO ] Input system was already deterministic with 1370 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 23) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-26 02:52:20] [INFO ] Invariant cache hit.
[2024-05-26 02:52:20] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-26 02:52:21] [INFO ] [Nat]Absence check using 66 positive place invariants in 30 ms returned sat
[2024-05-26 02:52:22] [INFO ] After 1434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-26 02:52:22] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 5 ms to minimize.
[2024-05-26 02:52:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2024-05-26 02:52:23] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-26 02:52:23] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
[2024-05-26 02:52:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2024-05-26 02:52:23] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2024-05-26 02:52:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-05-26 02:52:23] [INFO ] After 2734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 364 ms.
[2024-05-26 02:52:24] [INFO ] After 3456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 120 ms.
Support contains 14 out of 879 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 879 transition count 1311
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 820 transition count 1311
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 118 place count 820 transition count 1277
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 186 place count 786 transition count 1277
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 212 place count 760 transition count 1185
Iterating global reduction 2 with 26 rules applied. Total rules applied 238 place count 760 transition count 1185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 238 place count 760 transition count 1184
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 240 place count 759 transition count 1184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 242 place count 757 transition count 1175
Iterating global reduction 2 with 2 rules applied. Total rules applied 244 place count 757 transition count 1175
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 1 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 2 with 388 rules applied. Total rules applied 632 place count 563 transition count 981
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 636 place count 563 transition count 977
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 838 place count 462 transition count 1004
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 852 place count 462 transition count 990
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 918 place count 429 transition count 998
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 4 with 60 rules applied. Total rules applied 978 place count 429 transition count 938
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 987 place count 420 transition count 938
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 987 place count 420 transition count 933
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 997 place count 415 transition count 933
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1031 place count 398 transition count 916
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1035 place count 396 transition count 917
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1038 place count 396 transition count 914
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1041 place count 393 transition count 914
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1042 place count 393 transition count 913
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1047 place count 393 transition count 913
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1048 place count 392 transition count 912
Applied a total of 1048 rules in 317 ms. Remains 392 /879 variables (removed 487) and now considering 912/1370 (removed 458) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 392/879 places, 912/1370 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 912 rows 392 cols
[2024-05-26 02:52:24] [INFO ] Computed 57 invariants in 8 ms
[2024-05-26 02:52:25] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 02:52:25] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:52:25] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 02:52:25] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 02:52:25] [INFO ] After 96ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-26 02:52:25] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-05-26 02:52:25] [INFO ] After 696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 15 ms.
Support contains 4 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 912/912 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 0 with 1 rules applied. Total rules applied 1 place count 392 transition count 911
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 391 transition count 911
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 391 transition count 909
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 389 transition count 909
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 388 transition count 905
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 388 transition count 905
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 387 transition count 904
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 387 transition count 903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 386 transition count 903
Applied a total of 12 rules in 50 ms. Remains 386 /392 variables (removed 6) and now considering 903/912 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 386/392 places, 903/912 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 394646 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394646 steps, saw 88828 distinct states, run finished after 3002 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 903 rows 386 cols
[2024-05-26 02:52:28] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 02:52:29] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:52:29] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:52:29] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:52:29] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 02:52:29] [INFO ] After 57ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 02:52:29] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2024-05-26 02:52:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2024-05-26 02:52:29] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-26 02:52:29] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 903/903 transitions.
Applied a total of 0 rules in 9 ms. Remains 386 /386 variables (removed 0) and now considering 903/903 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 386/386 places, 903/903 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 903/903 transitions.
Applied a total of 0 rules in 9 ms. Remains 386 /386 variables (removed 0) and now considering 903/903 (removed 0) transitions.
[2024-05-26 02:52:29] [INFO ] Invariant cache hit.
[2024-05-26 02:52:29] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-26 02:52:29] [INFO ] Invariant cache hit.
[2024-05-26 02:52:30] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 02:52:30] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2024-05-26 02:52:30] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-26 02:52:30] [INFO ] Invariant cache hit.
[2024-05-26 02:52:30] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 949 ms. Remains : 386/386 places, 903/903 transitions.
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 386 transition count 880
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 25 place count 384 transition count 874
Iterating global reduction 0 with 2 rules applied. Total rules applied 27 place count 384 transition count 874
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 384 transition count 874
Applied a total of 29 rules in 33 ms. Remains 384 /386 variables (removed 2) and now considering 874/903 (removed 29) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 874 rows 384 cols
[2024-05-26 02:52:30] [INFO ] Computed 57 invariants in 10 ms
[2024-05-26 02:52:30] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:52:30] [INFO ] [Nat]Absence check using 57 positive place invariants in 7 ms returned sat
[2024-05-26 02:52:30] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:52:31] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2024-05-26 02:52:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-05-26 02:52:31] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-26 02:52:31] [INFO ] After 505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))&&p0))))'
Support contains 5 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 872 transition count 1360
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 872 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 871 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 871 transition count 1357
Applied a total of 16 rules in 33 ms. Remains 871 /879 variables (removed 8) and now considering 1357/1370 (removed 13) transitions.
// Phase 1: matrix 1357 rows 871 cols
[2024-05-26 02:52:31] [INFO ] Computed 66 invariants in 13 ms
[2024-05-26 02:52:31] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-26 02:52:31] [INFO ] Invariant cache hit.
[2024-05-26 02:52:32] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2024-05-26 02:52:32] [INFO ] Invariant cache hit.
[2024-05-26 02:52:33] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 871/879 places, 1357/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1532 ms. Remains : 871/879 places, 1357/1370 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 640 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-00 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:(OR (EQ s389 0) (EQ s491 0) (EQ s539 0)), p0:(AND (EQ s329 1) (EQ s395 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 896 steps with 1 reset in 12 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-00 finished in 2240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 878 transition count 1308
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 817 transition count 1308
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 122 place count 817 transition count 1273
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 192 place count 782 transition count 1273
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 222 place count 752 transition count 1173
Iterating global reduction 2 with 30 rules applied. Total rules applied 252 place count 752 transition count 1173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 252 place count 752 transition count 1171
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 256 place count 750 transition count 1171
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 260 place count 746 transition count 1157
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 746 transition count 1157
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 0 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 654 place count 551 transition count 962
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 658 place count 551 transition count 958
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 860 place count 450 transition count 985
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 874 place count 450 transition count 971
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 944 place count 415 transition count 979
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 4 with 60 rules applied. Total rules applied 1004 place count 415 transition count 919
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1013 place count 406 transition count 919
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1013 place count 406 transition count 914
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1023 place count 401 transition count 914
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1061 place count 382 transition count 895
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1062 place count 381 transition count 894
Applied a total of 1062 rules in 192 ms. Remains 381 /879 variables (removed 498) and now considering 894/1370 (removed 476) transitions.
// Phase 1: matrix 894 rows 381 cols
[2024-05-26 02:52:33] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 02:52:34] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-26 02:52:34] [INFO ] Invariant cache hit.
[2024-05-26 02:52:34] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:52:34] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-26 02:52:34] [INFO ] Redundant transitions in 131 ms returned []
[2024-05-26 02:52:34] [INFO ] Invariant cache hit.
[2024-05-26 02:52:34] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 381/879 places, 894/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1288 ms. Remains : 381/879 places, 894/1370 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 403 steps with 1 reset in 8 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-01 finished in 1356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 878 transition count 1308
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 817 transition count 1308
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 122 place count 817 transition count 1273
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 192 place count 782 transition count 1273
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 222 place count 752 transition count 1173
Iterating global reduction 2 with 30 rules applied. Total rules applied 252 place count 752 transition count 1173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 252 place count 752 transition count 1171
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 256 place count 750 transition count 1171
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 260 place count 746 transition count 1157
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 746 transition count 1157
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 2 with 386 rules applied. Total rules applied 650 place count 553 transition count 964
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 654 place count 553 transition count 960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 856 place count 452 transition count 988
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 870 place count 452 transition count 974
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 942 place count 416 transition count 982
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 1004 place count 416 transition count 920
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1013 place count 407 transition count 920
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1013 place count 407 transition count 915
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1023 place count 402 transition count 915
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1061 place count 383 transition count 896
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1062 place count 382 transition count 895
Applied a total of 1062 rules in 146 ms. Remains 382 /879 variables (removed 497) and now considering 895/1370 (removed 475) transitions.
// Phase 1: matrix 895 rows 382 cols
[2024-05-26 02:52:35] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 02:52:35] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-26 02:52:35] [INFO ] Invariant cache hit.
[2024-05-26 02:52:35] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:52:35] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-26 02:52:35] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-26 02:52:35] [INFO ] Invariant cache hit.
[2024-05-26 02:52:36] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 382/879 places, 895/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1092 ms. Remains : 382/879 places, 895/1370 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-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:(OR (NEQ s104 1) (NEQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 480 reset in 454 ms.
Stack based approach found an accepted trace after 16073 steps with 78 reset with depth 244 and stack size 244 in 77 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-03 finished in 1681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 2 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 878 transition count 1308
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 817 transition count 1308
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 122 place count 817 transition count 1273
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 192 place count 782 transition count 1273
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 220 place count 754 transition count 1175
Iterating global reduction 2 with 28 rules applied. Total rules applied 248 place count 754 transition count 1175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 248 place count 754 transition count 1174
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 250 place count 753 transition count 1174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 253 place count 750 transition count 1163
Iterating global reduction 2 with 3 rules applied. Total rules applied 256 place count 750 transition count 1163
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 196
Deduced a syphon composed of 196 places in 1 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 2 with 392 rules applied. Total rules applied 648 place count 554 transition count 967
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 652 place count 554 transition count 963
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 854 place count 453 transition count 992
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 868 place count 453 transition count 978
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 940 place count 417 transition count 986
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 1002 place count 417 transition count 924
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1011 place count 408 transition count 924
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1011 place count 408 transition count 919
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1021 place count 403 transition count 919
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1057 place count 385 transition count 901
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1059 place count 384 transition count 902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1060 place count 383 transition count 901
Applied a total of 1060 rules in 154 ms. Remains 383 /879 variables (removed 496) and now considering 901/1370 (removed 469) transitions.
// Phase 1: matrix 901 rows 383 cols
[2024-05-26 02:52:36] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 02:52:37] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-26 02:52:37] [INFO ] Invariant cache hit.
[2024-05-26 02:52:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:52:37] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2024-05-26 02:52:37] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-26 02:52:37] [INFO ] Invariant cache hit.
[2024-05-26 02:52:37] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/879 places, 901/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1092 ms. Remains : 383/879 places, 901/1370 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s161 1), p1:(NEQ s273 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 474 reset in 390 ms.
Product exploration explored 100000 steps with 490 reset in 449 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Support contains 1 out of 383 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 901/901 transitions.
Applied a total of 0 rules in 8 ms. Remains 383 /383 variables (removed 0) and now considering 901/901 (removed 0) transitions.
[2024-05-26 02:52:39] [INFO ] Invariant cache hit.
[2024-05-26 02:52:39] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-26 02:52:39] [INFO ] Invariant cache hit.
[2024-05-26 02:52:39] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:52:39] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2024-05-26 02:52:39] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-26 02:52:39] [INFO ] Invariant cache hit.
[2024-05-26 02:52:40] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 902 ms. Remains : 383/383 places, 901/901 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Finished random walk after 1833 steps, including 10 resets, run visited all 1 properties in 12 ms. (steps per millisecond=152 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 489 reset in 388 ms.
Stack based approach found an accepted trace after 66540 steps with 326 reset with depth 238 and stack size 238 in 285 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-04 finished in 4400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X((F(p1)||G(p0))))))))'
Support contains 3 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 869 transition count 1355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 869 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 867 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 867 transition count 1350
Applied a total of 24 rules in 40 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2024-05-26 02:52:41] [INFO ] Computed 66 invariants in 13 ms
[2024-05-26 02:52:41] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-26 02:52:41] [INFO ] Invariant cache hit.
[2024-05-26 02:52:42] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
[2024-05-26 02:52:42] [INFO ] Invariant cache hit.
[2024-05-26 02:52:42] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1541 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(AND (EQ s79 1) (EQ s314 1)), p0:(NEQ s213 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3408 steps with 4 reset in 20 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-05 finished in 1824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 3 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 870 transition count 1356
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 870 transition count 1356
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 868 transition count 1351
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 868 transition count 1351
Applied a total of 22 rules in 37 ms. Remains 868 /879 variables (removed 11) and now considering 1351/1370 (removed 19) transitions.
// Phase 1: matrix 1351 rows 868 cols
[2024-05-26 02:52:43] [INFO ] Computed 66 invariants in 9 ms
[2024-05-26 02:52:43] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-26 02:52:43] [INFO ] Invariant cache hit.
[2024-05-26 02:52:43] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
[2024-05-26 02:52:43] [INFO ] Invariant cache hit.
[2024-05-26 02:52:44] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 868/879 places, 1351/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1487 ms. Remains : 868/879 places, 1351/1370 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s403 1) (EQ s590 1)), p1:(NEQ s185 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 56967 steps with 88 reset in 191 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-07 finished in 1848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))&&(!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 869 transition count 1355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 869 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 867 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 867 transition count 1350
Applied a total of 24 rules in 44 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2024-05-26 02:52:44] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 02:52:45] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-26 02:52:45] [INFO ] Invariant cache hit.
[2024-05-26 02:52:45] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
[2024-05-26 02:52:45] [INFO ] Invariant cache hit.
[2024-05-26 02:52:46] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1491 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p2) p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(OR p2 (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=6 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}]], initial=0, aps=[p2:(AND (EQ s387 1) (EQ s514 1) (NOT (AND (EQ s80 1) (EQ s89 1)))), p1:(AND (EQ s80 1) (EQ s89 1)), p0:(AND (EQ s721 1) (EQ s770 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]]
Product exploration explored 100000 steps with 160 reset in 282 ms.
Product exploration explored 100000 steps with 157 reset in 320 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0)]
Finished random walk after 481 steps, including 0 resets, run visited all 6 properties in 18 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 632 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0)]
[2024-05-26 02:52:48] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 423 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-5B-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5B-LTLFireability-08 finished in 4847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 878 transition count 1309
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 121 place count 818 transition count 1308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 817 transition count 1308
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 122 place count 817 transition count 1273
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 192 place count 782 transition count 1273
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 222 place count 752 transition count 1173
Iterating global reduction 3 with 30 rules applied. Total rules applied 252 place count 752 transition count 1173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 252 place count 752 transition count 1171
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 750 transition count 1171
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 260 place count 746 transition count 1157
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 746 transition count 1157
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 1 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 3 with 386 rules applied. Total rules applied 650 place count 553 transition count 964
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 654 place count 553 transition count 960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 856 place count 452 transition count 988
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 870 place count 452 transition count 974
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 942 place count 416 transition count 982
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 5 with 59 rules applied. Total rules applied 1001 place count 416 transition count 923
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1009 place count 408 transition count 923
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 1009 place count 408 transition count 918
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1019 place count 403 transition count 918
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1051 place count 387 transition count 902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1052 place count 386 transition count 901
Applied a total of 1052 rules in 114 ms. Remains 386 /879 variables (removed 493) and now considering 901/1370 (removed 469) transitions.
// Phase 1: matrix 901 rows 386 cols
[2024-05-26 02:52:49] [INFO ] Computed 58 invariants in 4 ms
[2024-05-26 02:52:49] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-26 02:52:49] [INFO ] Invariant cache hit.
[2024-05-26 02:52:50] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:52:50] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-05-26 02:52:50] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-26 02:52:50] [INFO ] Invariant cache hit.
[2024-05-26 02:52:50] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 386/879 places, 901/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1059 ms. Remains : 386/879 places, 901/1370 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-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:(AND (EQ s116 1) (EQ s133 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 389 steps with 5 reset in 5 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-09 finished in 1156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 878 transition count 1310
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 819 transition count 1310
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 118 place count 819 transition count 1275
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 188 place count 784 transition count 1275
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 217 place count 755 transition count 1178
Iterating global reduction 2 with 29 rules applied. Total rules applied 246 place count 755 transition count 1178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 246 place count 755 transition count 1176
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 250 place count 753 transition count 1176
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 254 place count 749 transition count 1162
Iterating global reduction 2 with 4 rules applied. Total rules applied 258 place count 749 transition count 1162
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 1 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 648 place count 554 transition count 967
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 651 place count 554 transition count 964
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 853 place count 453 transition count 994
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 867 place count 453 transition count 980
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 939 place count 417 transition count 988
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 1001 place count 417 transition count 926
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1010 place count 408 transition count 926
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1010 place count 408 transition count 921
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1020 place count 403 transition count 921
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1058 place count 384 transition count 902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1059 place count 383 transition count 901
Applied a total of 1059 rules in 119 ms. Remains 383 /879 variables (removed 496) and now considering 901/1370 (removed 469) transitions.
// Phase 1: matrix 901 rows 383 cols
[2024-05-26 02:52:50] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 02:52:51] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-26 02:52:51] [INFO ] Invariant cache hit.
[2024-05-26 02:52:51] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:52:51] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-05-26 02:52:51] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-26 02:52:51] [INFO ] Invariant cache hit.
[2024-05-26 02:52:51] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/879 places, 901/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1028 ms. Remains : 383/879 places, 901/1370 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s248 1), p1:(AND (EQ s28 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-10 finished in 1271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 878 transition count 1308
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 817 transition count 1308
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 122 place count 817 transition count 1273
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 192 place count 782 transition count 1273
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 221 place count 753 transition count 1174
Iterating global reduction 2 with 29 rules applied. Total rules applied 250 place count 753 transition count 1174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 250 place count 753 transition count 1173
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 252 place count 752 transition count 1173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 749 transition count 1165
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 749 transition count 1165
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 0 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 648 place count 554 transition count 970
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 652 place count 554 transition count 966
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 854 place count 453 transition count 997
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 868 place count 453 transition count 983
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 940 place count 417 transition count 991
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 4 with 64 rules applied. Total rules applied 1004 place count 417 transition count 927
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1013 place count 408 transition count 927
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1013 place count 408 transition count 922
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1023 place count 403 transition count 922
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1059 place count 385 transition count 904
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1061 place count 384 transition count 906
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1062 place count 384 transition count 906
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1063 place count 383 transition count 905
Applied a total of 1063 rules in 126 ms. Remains 383 /879 variables (removed 496) and now considering 905/1370 (removed 465) transitions.
[2024-05-26 02:52:52] [INFO ] Flow matrix only has 902 transitions (discarded 3 similar events)
// Phase 1: matrix 902 rows 383 cols
[2024-05-26 02:52:52] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:52:52] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-26 02:52:52] [INFO ] Flow matrix only has 902 transitions (discarded 3 similar events)
[2024-05-26 02:52:52] [INFO ] Invariant cache hit.
[2024-05-26 02:52:52] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:52:52] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2024-05-26 02:52:52] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-26 02:52:52] [INFO ] Flow matrix only has 902 transitions (discarded 3 similar events)
[2024-05-26 02:52:52] [INFO ] Invariant cache hit.
[2024-05-26 02:52:53] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/879 places, 905/1370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1032 ms. Remains : 383/879 places, 905/1370 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s33 1) (EQ s51 1)), p0:(EQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 219 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-11 finished in 1113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G(p0)))))'
Support contains 1 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 869 transition count 1355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 869 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 867 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 867 transition count 1350
Applied a total of 24 rules in 38 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2024-05-26 02:52:53] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 02:52:53] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-26 02:52:53] [INFO ] Invariant cache hit.
[2024-05-26 02:52:54] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2024-05-26 02:52:54] [INFO ] Invariant cache hit.
[2024-05-26 02:52:54] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1549 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-12 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=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=3, aps=[p0:(EQ s113 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 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-12 finished in 1674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(X(G(p0))||p1))))))'
Support contains 2 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 869 transition count 1355
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 869 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 867 transition count 1350
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 867 transition count 1350
Applied a total of 24 rules in 41 ms. Remains 867 /879 variables (removed 12) and now considering 1350/1370 (removed 20) transitions.
[2024-05-26 02:52:54] [INFO ] Invariant cache hit.
[2024-05-26 02:52:55] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-26 02:52:55] [INFO ] Invariant cache hit.
[2024-05-26 02:52:55] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2024-05-26 02:52:55] [INFO ] Invariant cache hit.
[2024-05-26 02:52:56] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 867/879 places, 1350/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1533 ms. Remains : 867/879 places, 1350/1370 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s79 0) (EQ s89 0)), p1:(OR (EQ s79 0) (EQ s89 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 511 ms.
Product exploration explored 100000 steps with 33333 reset in 505 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-5B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5B-LTLFireability-14 finished in 2775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0&&X((!p0&&G((!p0||G(p1)))))))'
Support contains 3 out of 879 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1370/1370 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 870 transition count 1357
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 870 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 869 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 869 transition count 1355
Applied a total of 20 rules in 39 ms. Remains 869 /879 variables (removed 10) and now considering 1355/1370 (removed 15) transitions.
// Phase 1: matrix 1355 rows 869 cols
[2024-05-26 02:52:57] [INFO ] Computed 66 invariants in 9 ms
[2024-05-26 02:52:57] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-26 02:52:57] [INFO ] Invariant cache hit.
[2024-05-26 02:52:58] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2024-05-26 02:52:58] [INFO ] Invariant cache hit.
[2024-05-26 02:52:59] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 869/879 places, 1355/1370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1496 ms. Remains : 869/879 places, 1355/1370 transitions.
Stuttering acceptance computed with spot in 2253 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(NEQ s458 1), p0:(AND (EQ s145 1) (EQ s179 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 156 reset in 278 ms.
Product exploration explored 100000 steps with 158 reset in 317 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 76 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (AND (NOT p1) p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-26 02:53:02] [INFO ] Invariant cache hit.
[2024-05-26 02:53:02] [INFO ] [Real]Absence check using 66 positive place invariants in 24 ms returned sat
[2024-05-26 02:53:02] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 02:53:03] [INFO ] [Nat]Absence check using 66 positive place invariants in 25 ms returned sat
[2024-05-26 02:53:03] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-26 02:53:03] [INFO ] After 657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 122 ms.
[2024-05-26 02:53:03] [INFO ] After 956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 869 transition count 1296
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 810 transition count 1296
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 118 place count 810 transition count 1259
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 192 place count 773 transition count 1259
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 216 place count 749 transition count 1163
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 749 transition count 1163
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 0 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 630 place count 554 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 633 place count 554 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 835 place count 453 transition count 993
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 849 place count 453 transition count 979
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 921 place count 417 transition count 987
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 983 place count 417 transition count 925
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 992 place count 408 transition count 925
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 992 place count 408 transition count 920
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1002 place count 403 transition count 920
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1040 place count 384 transition count 901
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1041 place count 384 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1042 place count 383 transition count 900
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1043 place count 383 transition count 899
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1048 place count 383 transition count 899
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1049 place count 382 transition count 898
Applied a total of 1049 rules in 126 ms. Remains 382 /869 variables (removed 487) and now considering 898/1355 (removed 457) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 382/869 places, 898/1355 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 898 rows 382 cols
[2024-05-26 02:53:04] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 02:53:04] [INFO ] [Real]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:53:04] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:53:04] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:53:04] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:53:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-26 02:53:04] [INFO ] After 32ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:53:04] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-26 02:53:04] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 8 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 382/382 places, 898/898 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 452033 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 452033 steps, saw 107542 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:53:07] [INFO ] Invariant cache hit.
[2024-05-26 02:53:07] [INFO ] [Real]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:53:08] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:53:08] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:53:08] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:53:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-26 02:53:08] [INFO ] After 33ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:53:08] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-26 02:53:08] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 7 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 382/382 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 6 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2024-05-26 02:53:08] [INFO ] Invariant cache hit.
[2024-05-26 02:53:08] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-26 02:53:08] [INFO ] Invariant cache hit.
[2024-05-26 02:53:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-26 02:53:09] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-26 02:53:09] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-26 02:53:09] [INFO ] Invariant cache hit.
[2024-05-26 02:53:09] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 942 ms. Remains : 382/382 places, 898/898 transitions.
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 382 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 380 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 380 transition count 870
Applied a total of 26 rules in 16 ms. Remains 380 /382 variables (removed 2) and now considering 870/898 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 380 cols
[2024-05-26 02:53:09] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:53:09] [INFO ] [Real]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:53:09] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:53:09] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:53:10] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:53:10] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-26 02:53:10] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p1 p0)), (F p0)]
Knowledge based reduction with 6 factoid took 149 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 868 transition count 1295
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 809 transition count 1295
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 118 place count 809 transition count 1258
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 192 place count 772 transition count 1258
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 216 place count 748 transition count 1162
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 748 transition count 1162
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 2 with 388 rules applied. Total rules applied 628 place count 554 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 631 place count 554 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 833 place count 453 transition count 993
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 847 place count 453 transition count 979
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 919 place count 417 transition count 987
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 981 place count 417 transition count 925
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 990 place count 408 transition count 925
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 990 place count 408 transition count 920
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1000 place count 403 transition count 920
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1038 place count 384 transition count 901
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1039 place count 384 transition count 901
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1040 place count 383 transition count 900
Applied a total of 1040 rules in 106 ms. Remains 383 /869 variables (removed 486) and now considering 900/1355 (removed 455) transitions.
// Phase 1: matrix 900 rows 383 cols
[2024-05-26 02:53:10] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 02:53:10] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-26 02:53:10] [INFO ] Invariant cache hit.
[2024-05-26 02:53:10] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:53:11] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-26 02:53:11] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-26 02:53:11] [INFO ] Invariant cache hit.
[2024-05-26 02:53:11] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/869 places, 900/1355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1027 ms. Remains : 383/869 places, 900/1355 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 45 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:53:11] [INFO ] Invariant cache hit.
[2024-05-26 02:53:11] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 02:53:11] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:53:12] [INFO ] [Nat]Absence check using 57 positive place invariants in 7 ms returned sat
[2024-05-26 02:53:12] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:53:12] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:53:12] [INFO ] After 38ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:53:12] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-26 02:53:12] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 8 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 383/383 places, 900/900 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 423860 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423860 steps, saw 110738 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-26 02:53:15] [INFO ] Invariant cache hit.
[2024-05-26 02:53:15] [INFO ] [Real]Absence check using 57 positive place invariants in 13 ms returned sat
[2024-05-26 02:53:15] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:53:15] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:53:15] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:53:15] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:53:15] [INFO ] After 33ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:53:16] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-26 02:53:16] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 6 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 383/383 places, 900/900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 6 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2024-05-26 02:53:16] [INFO ] Invariant cache hit.
[2024-05-26 02:53:16] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-26 02:53:16] [INFO ] Invariant cache hit.
[2024-05-26 02:53:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:53:16] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2024-05-26 02:53:16] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-26 02:53:16] [INFO ] Invariant cache hit.
[2024-05-26 02:53:16] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 906 ms. Remains : 383/383 places, 900/900 transitions.
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 383 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 381 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 381 transition count 870
Applied a total of 28 rules in 16 ms. Remains 381 /383 variables (removed 2) and now considering 870/900 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 381 cols
[2024-05-26 02:53:17] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 02:53:17] [INFO ] [Real]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:53:17] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:53:17] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:53:17] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:53:17] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-26 02:53:17] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p1 p0))]
Knowledge based reduction with 10 factoid took 191 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Entered a terminal (fully accepting) state of product in 82841 steps with 406 reset in 337 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-15 finished in 20703 ms.
All properties solved by simple procedures.
Total runtime 61900 ms.

BK_STOP 1716692005008

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-5B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is NoC3x3-PT-5B, 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 r263-tall-171654372700393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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