Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r265-smll-167863539800260.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is NoC3x3-PT-3A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539800260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 10:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 10:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 133K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678881199608

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 11:53:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 11:53:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 11:53:22] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-15 11:53:22] [INFO ] Transformed 370 places.
[2023-03-15 11:53:22] [INFO ] Transformed 450 transitions.
[2023-03-15 11:53:22] [INFO ] Found NUPN structural information;
[2023-03-15 11:53:22] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA NoC3x3-PT-3A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 17 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 353 transition count 449
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 122 place count 248 transition count 324
Ensure Unique test removed 38 places
Iterating global reduction 1 with 143 rules applied. Total rules applied 265 place count 210 transition count 324
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 329 place count 210 transition count 260
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 353 place count 210 transition count 236
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 361 place count 202 transition count 236
Applied a total of 361 rules in 77 ms. Remains 202 /370 variables (removed 168) and now considering 236/449 (removed 213) transitions.
[2023-03-15 11:53:22] [INFO ] Flow matrix only has 225 transitions (discarded 11 similar events)
// Phase 1: matrix 225 rows 202 cols
[2023-03-15 11:53:22] [INFO ] Computed 64 place invariants in 21 ms
[2023-03-15 11:53:23] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-15 11:53:23] [INFO ] Flow matrix only has 225 transitions (discarded 11 similar events)
[2023-03-15 11:53:23] [INFO ] Invariant cache hit.
[2023-03-15 11:53:23] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 11:53:23] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2023-03-15 11:53:23] [INFO ] Flow matrix only has 225 transitions (discarded 11 similar events)
[2023-03-15 11:53:23] [INFO ] Invariant cache hit.
[2023-03-15 11:53:23] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/370 places, 236/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1251 ms. Remains : 202/370 places, 236/449 transitions.
Support contains 38 out of 202 places after structural reductions.
[2023-03-15 11:53:24] [INFO ] Flatten gal took : 73 ms
[2023-03-15 11:53:24] [INFO ] Flatten gal took : 32 ms
[2023-03-15 11:53:24] [INFO ] Input system was already deterministic with 236 transitions.
Support contains 34 out of 202 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 749 ms. (steps per millisecond=13 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 11:53:25] [INFO ] Flow matrix only has 225 transitions (discarded 11 similar events)
[2023-03-15 11:53:25] [INFO ] Invariant cache hit.
[2023-03-15 11:53:25] [INFO ] [Real]Absence check using 58 positive place invariants in 19 ms returned sat
[2023-03-15 11:53:25] [INFO ] [Real]Absence check using 58 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 11:53:25] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 11:53:25] [INFO ] [Nat]Absence check using 58 positive place invariants in 30 ms returned sat
[2023-03-15 11:53:25] [INFO ] [Nat]Absence check using 58 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 11:53:25] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 11:53:25] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 11:53:25] [INFO ] After 43ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 11:53:25] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-15 11:53:25] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 8 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 236/236 transitions.
Graph (complete) has 563 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 200 transition count 179
Reduce places removed 48 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 52 rules applied. Total rules applied 111 place count 152 transition count 175
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 115 place count 148 transition count 175
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 121 place count 142 transition count 168
Ensure Unique test removed 5 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 132 place count 137 transition count 168
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 11 rules applied. Total rules applied 143 place count 137 transition count 157
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 148 place count 133 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 149 place count 132 transition count 156
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 154 place count 132 transition count 151
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 159 place count 127 transition count 151
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 7 with 27 rules applied. Total rules applied 186 place count 127 transition count 151
Applied a total of 186 rules in 62 ms. Remains 127 /202 variables (removed 75) and now considering 151/236 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 127/202 places, 151/236 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 271123 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271123 steps, saw 216238 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 11:53:29] [INFO ] Flow matrix only has 148 transitions (discarded 3 similar events)
// Phase 1: matrix 148 rows 127 cols
[2023-03-15 11:53:29] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 11:53:29] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-15 11:53:29] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 11:53:29] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-15 11:53:29] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 11:53:29] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 11:53:29] [INFO ] After 36ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 11:53:29] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 11:53:29] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 8 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 151/151 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 127/127 places, 151/151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 151/151 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2023-03-15 11:53:29] [INFO ] Flow matrix only has 148 transitions (discarded 3 similar events)
[2023-03-15 11:53:29] [INFO ] Invariant cache hit.
[2023-03-15 11:53:29] [INFO ] Implicit Places using invariants in 138 ms returned [13, 31, 40, 55, 77, 90, 97, 117, 126]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 142 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 118/127 places, 151/151 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 118 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 150
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 117 transition count 149
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 117 transition count 149
Applied a total of 4 rules in 16 ms. Remains 117 /118 variables (removed 1) and now considering 149/151 (removed 2) transitions.
[2023-03-15 11:53:29] [INFO ] Flow matrix only has 146 transitions (discarded 3 similar events)
// Phase 1: matrix 146 rows 117 cols
[2023-03-15 11:53:29] [INFO ] Computed 48 place invariants in 2 ms
[2023-03-15 11:53:29] [INFO ] Implicit Places using invariants in 102 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 116/127 places, 149/151 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 116 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 148
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 114 transition count 146
Applied a total of 5 rules in 15 ms. Remains 114 /116 variables (removed 2) and now considering 146/149 (removed 3) transitions.
[2023-03-15 11:53:29] [INFO ] Flow matrix only has 143 transitions (discarded 3 similar events)
// Phase 1: matrix 143 rows 114 cols
[2023-03-15 11:53:29] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-15 11:53:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-15 11:53:30] [INFO ] Flow matrix only has 143 transitions (discarded 3 similar events)
[2023-03-15 11:53:30] [INFO ] Invariant cache hit.
[2023-03-15 11:53:30] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-15 11:53:30] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 114/127 places, 146/151 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 565 ms. Remains : 114/127 places, 146/151 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 267844 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267844 steps, saw 215585 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 11:53:33] [INFO ] Flow matrix only has 143 transitions (discarded 3 similar events)
[2023-03-15 11:53:33] [INFO ] Invariant cache hit.
[2023-03-15 11:53:33] [INFO ] [Real]Absence check using 46 positive place invariants in 12 ms returned sat
[2023-03-15 11:53:33] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 11:53:33] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2023-03-15 11:53:33] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 11:53:33] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-15 11:53:33] [INFO ] After 28ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 11:53:33] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-15 11:53:33] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 146/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 114/114 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 146/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2023-03-15 11:53:33] [INFO ] Flow matrix only has 143 transitions (discarded 3 similar events)
[2023-03-15 11:53:33] [INFO ] Invariant cache hit.
[2023-03-15 11:53:33] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-15 11:53:33] [INFO ] Flow matrix only has 143 transitions (discarded 3 similar events)
[2023-03-15 11:53:33] [INFO ] Invariant cache hit.
[2023-03-15 11:53:34] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-15 11:53:34] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-15 11:53:34] [INFO ] Redundant transitions in 29 ms returned [12, 13, 110, 113, 115, 116, 117, 118]
Found 8 redundant transitions using SMT.
Drop transitions removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
[2023-03-15 11:53:34] [INFO ] Flow matrix only has 135 transitions (discarded 3 similar events)
// Phase 1: matrix 135 rows 114 cols
[2023-03-15 11:53:34] [INFO ] Computed 46 place invariants in 3 ms
[2023-03-15 11:53:34] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 114/114 places, 138/146 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 137
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 137
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 113 transition count 136
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 1 with 2 rules applied. Total rules applied 5 place count 112 transition count 135
Applied a total of 5 rules in 23 ms. Remains 112 /114 variables (removed 2) and now considering 135/138 (removed 3) transitions.
[2023-03-15 11:53:34] [INFO ] Flow matrix only has 132 transitions (discarded 3 similar events)
// Phase 1: matrix 132 rows 112 cols
[2023-03-15 11:53:34] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-15 11:53:34] [INFO ] Implicit Places using invariants in 89 ms returned [73, 102]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 92 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 110/114 places, 135/146 transitions.
Graph (trivial) has 22 edges and 110 vertex of which 2 / 110 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 109 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 108 transition count 132
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 108 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 107 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 107 transition count 130
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 106 transition count 130
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 106 transition count 129
Applied a total of 8 rules in 23 ms. Remains 106 /110 variables (removed 4) and now considering 129/135 (removed 6) transitions.
[2023-03-15 11:53:34] [INFO ] Flow matrix only has 126 transitions (discarded 3 similar events)
// Phase 1: matrix 126 rows 106 cols
[2023-03-15 11:53:34] [INFO ] Computed 43 place invariants in 6 ms
[2023-03-15 11:53:34] [INFO ] Implicit Places using invariants in 111 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 105/114 places, 129/146 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 128
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 104 transition count 127
Applied a total of 3 rules in 12 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
[2023-03-15 11:53:34] [INFO ] Flow matrix only has 124 transitions (discarded 3 similar events)
// Phase 1: matrix 124 rows 104 cols
[2023-03-15 11:53:34] [INFO ] Computed 42 place invariants in 3 ms
[2023-03-15 11:53:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-15 11:53:34] [INFO ] Flow matrix only has 124 transitions (discarded 3 similar events)
[2023-03-15 11:53:34] [INFO ] Invariant cache hit.
[2023-03-15 11:53:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 11:53:34] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 104/114 places, 127/146 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1033 ms. Remains : 104/114 places, 127/146 transitions.
Finished random walk after 3556 steps, including 1 resets, run visited all 2 properties in 53 ms. (steps per millisecond=67 )
FORMULA NoC3x3-PT-3A-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 596 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 236
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 191 transition count 223
Ensure Unique test removed 5 places
Iterating global reduction 1 with 14 rules applied. Total rules applied 25 place count 186 transition count 223
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 32 place count 186 transition count 216
Applied a total of 32 rules in 10 ms. Remains 186 /202 variables (removed 16) and now considering 216/236 (removed 20) transitions.
[2023-03-15 11:53:35] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2023-03-15 11:53:35] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 11:53:35] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-15 11:53:35] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-15 11:53:35] [INFO ] Invariant cache hit.
[2023-03-15 11:53:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-15 11:53:35] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-15 11:53:35] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-15 11:53:35] [INFO ] Invariant cache hit.
[2023-03-15 11:53:35] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/202 places, 216/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 589 ms. Remains : 186/202 places, 216/236 transitions.
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s20 0) (EQ s35 0))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 864 ms.
Product exploration explored 100000 steps with 25000 reset in 752 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 186 /186 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-15 11:53:38] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-15 11:53:38] [INFO ] Invariant cache hit.
[2023-03-15 11:53:38] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-15 11:53:38] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-15 11:53:38] [INFO ] Invariant cache hit.
[2023-03-15 11:53:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-15 11:53:38] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-15 11:53:38] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-15 11:53:38] [INFO ] Invariant cache hit.
[2023-03-15 11:53:38] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 186/186 places, 216/216 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 274 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=137 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 657 ms.
Product exploration explored 100000 steps with 25000 reset in 711 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 216/216 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 186 transition count 216
Deduced a syphon composed of 62 places in 1 ms
Applied a total of 62 rules in 19 ms. Remains 186 /186 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-15 11:53:41] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-15 11:53:41] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2023-03-15 11:53:41] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 11:53:41] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/186 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 186/186 places, 216/216 transitions.
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-15 11:53:41] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2023-03-15 11:53:41] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-15 11:53:41] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-15 11:53:41] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-15 11:53:41] [INFO ] Invariant cache hit.
[2023-03-15 11:53:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-15 11:53:42] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-15 11:53:42] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-15 11:53:42] [INFO ] Invariant cache hit.
[2023-03-15 11:53:42] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 186/186 places, 216/216 transitions.
Treatment of property NoC3x3-PT-3A-LTLFireability-00 finished in 7245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (!p1&&X(p0)))&&F(p2)))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 236
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 193 transition count 225
Ensure Unique test removed 3 places
Iterating global reduction 1 with 10 rules applied. Total rules applied 19 place count 190 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 24 place count 190 transition count 220
Applied a total of 24 rules in 7 ms. Remains 190 /202 variables (removed 12) and now considering 220/236 (removed 16) transitions.
[2023-03-15 11:53:42] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 190 cols
[2023-03-15 11:53:42] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-15 11:53:42] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-15 11:53:42] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2023-03-15 11:53:42] [INFO ] Invariant cache hit.
[2023-03-15 11:53:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-15 11:53:42] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-15 11:53:42] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2023-03-15 11:53:42] [INFO ] Invariant cache hit.
[2023-03-15 11:53:42] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/202 places, 220/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 190/202 places, 220/236 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p2) p1), true, (NOT p0), (OR (NOT p0) p1), (NOT p2), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}]], initial=0, aps=[p1:(AND (EQ s141 1) (EQ s144 1)), p0:(AND (EQ s79 1) (EQ s101 1)), p2:(OR (NEQ s84 1) (NEQ s105 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-01 finished in 852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(!p1)) U (G((p0||F(!p1)))||X(!p1))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 236
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 192 transition count 225
Ensure Unique test removed 5 places
Iterating global reduction 1 with 13 rules applied. Total rules applied 23 place count 187 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 28 place count 187 transition count 220
Applied a total of 28 rules in 7 ms. Remains 187 /202 variables (removed 15) and now considering 220/236 (removed 16) transitions.
[2023-03-15 11:53:43] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 187 cols
[2023-03-15 11:53:43] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-15 11:53:43] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-15 11:53:43] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2023-03-15 11:53:43] [INFO ] Invariant cache hit.
[2023-03-15 11:53:43] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-15 11:53:43] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-15 11:53:43] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2023-03-15 11:53:43] [INFO ] Invariant cache hit.
[2023-03-15 11:53:43] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 220/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 187/202 places, 220/236 transitions.
Stuttering acceptance computed with spot in 110 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s115 1) (EQ s129 1)), p0:(NEQ s99 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]]
Product exploration explored 100000 steps with 50000 reset in 876 ms.
Product exploration explored 100000 steps with 50000 reset in 890 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 7 factoid took 127 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3A-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3A-LTLFireability-02 finished in 2563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 201 transition count 182
Reduce places removed 54 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 147 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 144 transition count 179
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 122 place count 136 transition count 167
Ensure Unique test removed 4 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 134 place count 132 transition count 167
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 143 place count 132 transition count 158
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 147 place count 129 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 148 place count 128 transition count 157
Applied a total of 148 rules in 23 ms. Remains 128 /202 variables (removed 74) and now considering 157/236 (removed 79) transitions.
[2023-03-15 11:53:45] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 128 cols
[2023-03-15 11:53:45] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-15 11:53:45] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-15 11:53:45] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
[2023-03-15 11:53:45] [INFO ] Invariant cache hit.
[2023-03-15 11:53:46] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-15 11:53:46] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-15 11:53:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 11:53:46] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
[2023-03-15 11:53:46] [INFO ] Invariant cache hit.
[2023-03-15 11:53:46] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/202 places, 157/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 128/202 places, 157/236 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s86 1), p1:(AND (EQ s104 1) (EQ s114 1) (EQ s108 1) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-03 finished in 609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((X(F(p2))&&p1))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 236
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 192 transition count 225
Ensure Unique test removed 5 places
Iterating global reduction 1 with 13 rules applied. Total rules applied 23 place count 187 transition count 225
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 30 place count 187 transition count 218
Applied a total of 30 rules in 8 ms. Remains 187 /202 variables (removed 15) and now considering 218/236 (removed 18) transitions.
[2023-03-15 11:53:46] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
// Phase 1: matrix 209 rows 187 cols
[2023-03-15 11:53:46] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-15 11:53:46] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-15 11:53:46] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
[2023-03-15 11:53:46] [INFO ] Invariant cache hit.
[2023-03-15 11:53:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-15 11:53:46] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-15 11:53:46] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
[2023-03-15 11:53:46] [INFO ] Invariant cache hit.
[2023-03-15 11:53:46] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 218/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 187/202 places, 218/236 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=5, aps=[p2:(OR (EQ s137 0) (EQ s148 0)), p0:(AND (EQ s77 1) (EQ s100 1)), p1:(AND (EQ s137 1) (EQ s148 1) (EQ s77 1) (EQ s100 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-06 finished in 808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)||p0))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Graph (complete) has 596 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 201 transition count 187
Reduce places removed 49 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 56 rules applied. Total rules applied 106 place count 152 transition count 180
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 113 place count 145 transition count 180
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 122 place count 136 transition count 167
Ensure Unique test removed 5 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 136 place count 131 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 12 rules applied. Total rules applied 148 place count 131 transition count 155
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 153 place count 126 transition count 155
Applied a total of 153 rules in 20 ms. Remains 126 /202 variables (removed 76) and now considering 155/236 (removed 81) transitions.
[2023-03-15 11:53:47] [INFO ] Flow matrix only has 147 transitions (discarded 8 similar events)
// Phase 1: matrix 147 rows 126 cols
[2023-03-15 11:53:47] [INFO ] Computed 58 place invariants in 0 ms
[2023-03-15 11:53:47] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-15 11:53:47] [INFO ] Flow matrix only has 147 transitions (discarded 8 similar events)
[2023-03-15 11:53:47] [INFO ] Invariant cache hit.
[2023-03-15 11:53:47] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-15 11:53:47] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-15 11:53:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 11:53:47] [INFO ] Flow matrix only has 147 transitions (discarded 8 similar events)
[2023-03-15 11:53:47] [INFO ] Invariant cache hit.
[2023-03-15 11:53:47] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/202 places, 155/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 126/202 places, 155/236 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s22 1) (EQ s23 1)) (AND (EQ s59 1) (EQ s75 1))), p2:(AND (EQ s59 1) (EQ s75 1)), p1:(AND (EQ s19 1) (EQ s24 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 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-10 finished in 569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Graph (complete) has 596 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 200 transition count 184
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 148 transition count 184
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 112 place count 141 transition count 175
Ensure Unique test removed 5 places
Iterating global reduction 2 with 12 rules applied. Total rules applied 124 place count 136 transition count 175
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 12 rules applied. Total rules applied 136 place count 136 transition count 163
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 141 place count 131 transition count 163
Applied a total of 141 rules in 20 ms. Remains 131 /202 variables (removed 71) and now considering 163/236 (removed 73) transitions.
[2023-03-15 11:53:47] [INFO ] Flow matrix only has 153 transitions (discarded 10 similar events)
// Phase 1: matrix 153 rows 131 cols
[2023-03-15 11:53:47] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-15 11:53:47] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-15 11:53:47] [INFO ] Flow matrix only has 153 transitions (discarded 10 similar events)
[2023-03-15 11:53:47] [INFO ] Invariant cache hit.
[2023-03-15 11:53:48] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-15 11:53:48] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-15 11:53:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 11:53:48] [INFO ] Flow matrix only has 153 transitions (discarded 10 similar events)
[2023-03-15 11:53:48] [INFO ] Invariant cache hit.
[2023-03-15 11:53:48] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/202 places, 163/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 131/202 places, 163/236 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s71 1)), p1:(AND (EQ s63 1) (EQ s92 1) (EQ s15 1) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-11 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Graph (complete) has 596 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 199 transition count 178
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 128 place count 135 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 128 place count 135 transition count 171
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 133 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 131 place count 133 transition count 170
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 133 place count 132 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 142 place count 123 transition count 157
Ensure Unique test removed 5 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 156 place count 118 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 12 rules applied. Total rules applied 168 place count 118 transition count 145
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 181 place count 110 transition count 140
Applied a total of 181 rules in 19 ms. Remains 110 /202 variables (removed 92) and now considering 140/236 (removed 96) transitions.
// Phase 1: matrix 140 rows 110 cols
[2023-03-15 11:53:48] [INFO ] Computed 46 place invariants in 0 ms
[2023-03-15 11:53:48] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-15 11:53:48] [INFO ] Invariant cache hit.
[2023-03-15 11:53:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-15 11:53:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-15 11:53:48] [INFO ] Redundant transitions in 79 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 65, 66, 69, 79, 92, 93, 95, 99, 102, 103, 104, 110, 111, 112, 114, 118, 121, 122, 124, 127, 128, 129, 130, 136]
Found 34 redundant transitions using SMT.
Drop transitions removed 34 transitions
Redundant transitions reduction (with SMT) removed 34 transitions.
// Phase 1: matrix 106 rows 110 cols
[2023-03-15 11:53:48] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-15 11:53:48] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/202 places, 106/236 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 110 transition count 93
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 84 transition count 93
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 84 transition count 88
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 43 edges and 74 vertex of which 16 / 74 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 66 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 66 transition count 75
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 95 place count 48 transition count 66
Graph (trivial) has 35 edges and 48 vertex of which 18 / 48 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 39 transition count 66
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 105 place count 39 transition count 57
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 122 place count 39 transition count 40
Applied a total of 122 rules in 14 ms. Remains 39 /110 variables (removed 71) and now considering 40/106 (removed 66) transitions.
// Phase 1: matrix 40 rows 39 cols
[2023-03-15 11:53:48] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-15 11:53:48] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-15 11:53:48] [INFO ] Invariant cache hit.
[2023-03-15 11:53:48] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/202 places, 40/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 530 ms. Remains : 39/202 places, 40/236 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s18 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-14 finished in 579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 236
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 192 transition count 224
Ensure Unique test removed 4 places
Iterating global reduction 1 with 12 rules applied. Total rules applied 22 place count 188 transition count 224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 28 place count 188 transition count 218
Applied a total of 28 rules in 5 ms. Remains 188 /202 variables (removed 14) and now considering 218/236 (removed 18) transitions.
[2023-03-15 11:53:48] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2023-03-15 11:53:48] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-15 11:53:49] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-15 11:53:49] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-15 11:53:49] [INFO ] Invariant cache hit.
[2023-03-15 11:53:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-15 11:53:49] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-15 11:53:49] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-15 11:53:49] [INFO ] Invariant cache hit.
[2023-03-15 11:53:49] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 218/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 188/202 places, 218/236 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s114 1) (EQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-15 finished in 645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : NoC3x3-PT-3A-LTLFireability-00
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Graph (complete) has 596 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 200 transition count 182
Reduce places removed 54 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 146 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 143 transition count 179
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 124 place count 134 transition count 166
Ensure Unique test removed 5 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 138 place count 129 transition count 166
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 12 rules applied. Total rules applied 150 place count 129 transition count 154
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 155 place count 124 transition count 154
Applied a total of 155 rules in 20 ms. Remains 124 /202 variables (removed 78) and now considering 154/236 (removed 82) transitions.
[2023-03-15 11:53:49] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
// Phase 1: matrix 146 rows 124 cols
[2023-03-15 11:53:49] [INFO ] Computed 57 place invariants in 0 ms
[2023-03-15 11:53:49] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-15 11:53:49] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
[2023-03-15 11:53:49] [INFO ] Invariant cache hit.
[2023-03-15 11:53:50] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-15 11:53:50] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-15 11:53:50] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
[2023-03-15 11:53:50] [INFO ] Invariant cache hit.
[2023-03-15 11:53:50] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/202 places, 154/236 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 455 ms. Remains : 124/202 places, 154/236 transitions.
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s17 0) (EQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1267 steps with 316 reset in 13 ms.
Treatment of property NoC3x3-PT-3A-LTLFireability-00 finished in 713 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-15 11:53:50] [INFO ] Flatten gal took : 21 ms
[2023-03-15 11:53:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-15 11:53:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 202 places, 236 transitions and 803 arcs took 4 ms.
Total runtime 28318 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1045/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : NoC3x3-PT-3A-LTLFireability-00

BK_STOP 1678881231651

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name NoC3x3-PT-3A-LTLFireability-00
ltl formula formula --ltl=/tmp/1045/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 202 places, 236 transitions and 803 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1045/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1045/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1045/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1045/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-3A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is NoC3x3-PT-3A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863539800260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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