About the Execution of 2023-gold for NoC3x3-PT-3A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
415.140 | 13433.00 | 25336.00 | 345.10 | FFTFFFFTFFFFTFFF | normal |
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-171654372600368.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-3A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372600368
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 07:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 07:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 07:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 07:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 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 133K 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-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 1716689880864
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-3A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 02:18:02] [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:18:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:18:02] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-26 02:18:02] [INFO ] Transformed 370 places.
[2024-05-26 02:18:02] [INFO ] Transformed 450 transitions.
[2024-05-26 02:18:02] [INFO ] Found NUPN structural information;
[2024-05-26 02:18:02] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 144 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 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA NoC3x3-PT-3A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 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 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 355 transition count 449
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 114 place count 256 transition count 330
Ensure Unique test removed 36 places
Iterating global reduction 1 with 135 rules applied. Total rules applied 249 place count 220 transition count 330
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 310 place count 220 transition count 269
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 334 place count 220 transition count 245
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 341 place count 213 transition count 245
Applied a total of 341 rules in 48 ms. Remains 213 /370 variables (removed 157) and now considering 245/449 (removed 204) transitions.
[2024-05-26 02:18:02] [INFO ] Flow matrix only has 233 transitions (discarded 12 similar events)
// Phase 1: matrix 233 rows 213 cols
[2024-05-26 02:18:02] [INFO ] Computed 69 invariants in 16 ms
[2024-05-26 02:18:03] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-26 02:18:03] [INFO ] Flow matrix only has 233 transitions (discarded 12 similar events)
[2024-05-26 02:18:03] [INFO ] Invariant cache hit.
[2024-05-26 02:18:03] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-26 02:18:03] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-26 02:18:03] [INFO ] Flow matrix only has 233 transitions (discarded 12 similar events)
[2024-05-26 02:18:03] [INFO ] Invariant cache hit.
[2024-05-26 02:18:03] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 213/370 places, 245/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 813 ms. Remains : 213/370 places, 245/449 transitions.
Support contains 52 out of 213 places after structural reductions.
[2024-05-26 02:18:03] [INFO ] Flatten gal took : 49 ms
[2024-05-26 02:18:03] [INFO ] Flatten gal took : 19 ms
[2024-05-26 02:18:03] [INFO ] Input system was already deterministic with 245 transitions.
Support contains 51 out of 213 places (down from 52) after GAL structural reductions.
Finished random walk after 7087 steps, including 2 resets, run visited all 30 properties in 284 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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(!p0)) U p1))'
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 194 transition count 226
Ensure Unique test removed 7 places
Iterating global reduction 1 with 21 rules applied. Total rules applied 40 place count 187 transition count 226
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 49 place count 187 transition count 217
Applied a total of 49 rules in 10 ms. Remains 187 /213 variables (removed 26) and now considering 217/245 (removed 28) transitions.
[2024-05-26 02:18:04] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 187 cols
[2024-05-26 02:18:04] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:18:04] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-26 02:18:04] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
[2024-05-26 02:18:04] [INFO ] Invariant cache hit.
[2024-05-26 02:18:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:18:04] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-26 02:18:04] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
[2024-05-26 02:18:04] [INFO ] Invariant cache hit.
[2024-05-26 02:18:04] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/213 places, 217/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 187/213 places, 217/245 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 236 ms :[(NOT p1), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s135 1) (EQ s142 1) (EQ s41 1) (EQ s46 1)), p0:(AND (EQ s61 1) (EQ s149 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-00 finished in 614 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(p0)) U G((p1||G(p2)))))'
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
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 48 rules applied. Total rules applied 49 place count 210 transition count 197
Reduce places removed 48 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 53 rules applied. Total rules applied 102 place count 162 transition count 192
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 107 place count 157 transition count 192
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 122 place count 142 transition count 172
Ensure Unique test removed 7 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 144 place count 135 transition count 172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 16 rules applied. Total rules applied 160 place count 135 transition count 156
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 167 place count 128 transition count 156
Applied a total of 167 rules in 28 ms. Remains 128 /213 variables (removed 85) and now considering 156/245 (removed 89) transitions.
[2024-05-26 02:18:05] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
// Phase 1: matrix 148 rows 128 cols
[2024-05-26 02:18:05] [INFO ] Computed 59 invariants in 1 ms
[2024-05-26 02:18:05] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-26 02:18:05] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
[2024-05-26 02:18:05] [INFO ] Invariant cache hit.
[2024-05-26 02:18:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-26 02:18:05] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-26 02:18:05] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-26 02:18:05] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
[2024-05-26 02:18:05] [INFO ] Invariant cache hit.
[2024-05-26 02:18:05] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/213 places, 156/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 128/213 places, 156/245 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s14 1)), p2:(AND (EQ s37 1) (EQ s42 1)), p0:(AND (EQ s61 1) (EQ s74 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 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 536 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(p0)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 194 transition count 226
Ensure Unique test removed 6 places
Iterating global reduction 1 with 20 rules applied. Total rules applied 39 place count 188 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 47 place count 188 transition count 218
Applied a total of 47 rules in 7 ms. Remains 188 /213 variables (removed 25) and now considering 218/245 (removed 27) transitions.
[2024-05-26 02:18:05] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2024-05-26 02:18:05] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 02:18:05] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-26 02:18:05] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 02:18:05] [INFO ] Invariant cache hit.
[2024-05-26 02:18:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:18:05] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-26 02:18:05] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 02:18:05] [INFO ] Invariant cache hit.
[2024-05-26 02:18:06] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/213 places, 218/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 188/213 places, 218/245 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s61 1) (NEQ s68 1) (AND (EQ s59 1) (EQ s64 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]]
Product exploration explored 100000 steps with 50000 reset in 489 ms.
Product exploration explored 100000 steps with 50000 reset in 410 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 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 1371 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 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
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 208 transition count 190
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 120 place count 148 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 120 place count 148 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 146 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 123 place count 146 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 144 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 144 transition count 180
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 144 place count 129 transition count 160
Ensure Unique test removed 7 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 166 place count 122 transition count 160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 16 rules applied. Total rules applied 182 place count 122 transition count 144
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 193 place count 113 transition count 142
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 113 transition count 141
Applied a total of 194 rules in 26 ms. Remains 113 /213 variables (removed 100) and now considering 141/245 (removed 104) transitions.
// Phase 1: matrix 141 rows 113 cols
[2024-05-26 02:18:07] [INFO ] Computed 48 invariants in 2 ms
[2024-05-26 02:18:07] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-26 02:18:07] [INFO ] Invariant cache hit.
[2024-05-26 02:18:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 02:18:07] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-26 02:18:07] [INFO ] Redundant transitions in 67 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 65, 66, 80, 93, 94, 96, 103, 104, 105, 111, 112, 113, 115, 119, 122, 123, 125, 128, 129, 130, 131, 137]
Found 32 redundant transitions using SMT.
Drop transitions removed 32 transitions
Redundant transitions reduction (with SMT) removed 32 transitions.
// Phase 1: matrix 109 rows 113 cols
[2024-05-26 02:18:07] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 02:18:07] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/213 places, 109/245 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 113 transition count 98
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 91 transition count 98
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 36 place count 91 transition count 95
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 46 edges and 85 vertex of which 16 / 85 are part of one of the 8 SCC in 2 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 46 place count 77 transition count 92
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 56 place count 76 transition count 83
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 83 place count 58 transition count 74
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 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 56 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 38 edges and 56 vertex of which 16 / 56 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 48 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 96 place count 48 transition count 64
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 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 99 place count 46 transition count 63
Graph (trivial) has 30 edges and 46 vertex of which 2 / 46 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 45 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 45 transition count 62
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 118 place count 45 transition count 45
Applied a total of 118 rules in 14 ms. Remains 45 /113 variables (removed 68) and now considering 45/109 (removed 64) transitions.
// Phase 1: matrix 45 rows 45 cols
[2024-05-26 02:18:07] [INFO ] Computed 22 invariants in 1 ms
[2024-05-26 02:18:07] [INFO ] Implicit Places using invariants in 28 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/213 places, 45/245 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 405 ms. Remains : 44/213 places, 45/245 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-03 finished in 451 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(G(p0)) U (X(G(p0))&&p1))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 20 place count 193 transition count 225
Ensure Unique test removed 7 places
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 186 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 51 place count 186 transition count 216
Applied a total of 51 rules in 6 ms. Remains 186 /213 variables (removed 27) and now considering 216/245 (removed 29) transitions.
[2024-05-26 02:18:07] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2024-05-26 02:18:07] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 02:18:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-26 02:18:07] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2024-05-26 02:18:07] [INFO ] Invariant cache hit.
[2024-05-26 02:18:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:18:07] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-26 02:18:07] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2024-05-26 02:18:07] [INFO ] Invariant cache hit.
[2024-05-26 02:18:07] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/213 places, 216/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 186/213 places, 216/245 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s79 1) (EQ s100 1)), p0:(AND (EQ s149 1) (EQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-04 finished in 442 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(G(p0))))||(F(p0)&&F(p1))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 195 transition count 228
Ensure Unique test removed 6 places
Iterating global reduction 1 with 19 rules applied. Total rules applied 37 place count 189 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 43 place count 189 transition count 222
Applied a total of 43 rules in 12 ms. Remains 189 /213 variables (removed 24) and now considering 222/245 (removed 23) transitions.
[2024-05-26 02:18:07] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
// Phase 1: matrix 214 rows 189 cols
[2024-05-26 02:18:07] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 02:18:08] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-26 02:18:08] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2024-05-26 02:18:08] [INFO ] Invariant cache hit.
[2024-05-26 02:18:08] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-26 02:18:08] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-26 02:18:08] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2024-05-26 02:18:08] [INFO ] Invariant cache hit.
[2024-05-26 02:18:08] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/213 places, 222/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 189/213 places, 222/245 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s86 1) (EQ s99 1)), p0:(AND (EQ s115 1) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-05 finished in 589 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(G(p0)))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 194 transition count 226
Ensure Unique test removed 6 places
Iterating global reduction 1 with 20 rules applied. Total rules applied 39 place count 188 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 47 place count 188 transition count 218
Applied a total of 47 rules in 5 ms. Remains 188 /213 variables (removed 25) and now considering 218/245 (removed 27) transitions.
[2024-05-26 02:18:08] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2024-05-26 02:18:08] [INFO ] Computed 58 invariants in 1 ms
[2024-05-26 02:18:08] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-26 02:18:08] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 02:18:08] [INFO ] Invariant cache hit.
[2024-05-26 02:18:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:18:08] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-26 02:18:08] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 02:18:08] [INFO ] Invariant cache hit.
[2024-05-26 02:18:08] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/213 places, 218/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 188/213 places, 218/245 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s156 1) (EQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-06 finished in 398 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 p1)||X(p2)))'
Support contains 5 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 210 transition count 245
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 195 transition count 225
Ensure Unique test removed 7 places
Iterating global reduction 1 with 22 rules applied. Total rules applied 40 place count 188 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 49 place count 188 transition count 216
Applied a total of 49 rules in 3 ms. Remains 188 /213 variables (removed 25) and now considering 216/245 (removed 29) transitions.
[2024-05-26 02:18:08] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 188 cols
[2024-05-26 02:18:08] [INFO ] Computed 59 invariants in 1 ms
[2024-05-26 02:18:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-26 02:18:09] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2024-05-26 02:18:09] [INFO ] Invariant cache hit.
[2024-05-26 02:18:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:18:09] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-26 02:18:09] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2024-05-26 02:18:09] [INFO ] Invariant cache hit.
[2024-05-26 02:18:09] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/213 places, 216/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 188/213 places, 216/245 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (EQ s88 0) (EQ s97 0)), p1:(EQ s54 1), p0:(AND (EQ s7 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Product exploration explored 100000 steps with 50000 reset in 411 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 533 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3A-LTLFireability-07 finished in 1355 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((G(F(p0))||G(p1)))))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 194 transition count 226
Ensure Unique test removed 6 places
Iterating global reduction 1 with 20 rules applied. Total rules applied 39 place count 188 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 47 place count 188 transition count 218
Applied a total of 47 rules in 4 ms. Remains 188 /213 variables (removed 25) and now considering 218/245 (removed 27) transitions.
[2024-05-26 02:18:10] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2024-05-26 02:18:10] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 02:18:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-26 02:18:10] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 02:18:10] [INFO ] Invariant cache hit.
[2024-05-26 02:18:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:18:10] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-05-26 02:18:10] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 02:18:10] [INFO ] Invariant cache hit.
[2024-05-26 02:18:10] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/213 places, 218/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 188/213 places, 218/245 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s175 1) (EQ s181 1)), p0:(EQ s53 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-09 finished in 520 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)) U G(!p1)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 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 208 transition count 193
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 156 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 154 transition count 191
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 123 place count 140 transition count 172
Ensure Unique test removed 7 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 144 place count 133 transition count 172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 16 rules applied. Total rules applied 160 place count 133 transition count 156
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 167 place count 126 transition count 156
Applied a total of 167 rules in 19 ms. Remains 126 /213 variables (removed 87) and now considering 156/245 (removed 89) transitions.
[2024-05-26 02:18:10] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
// Phase 1: matrix 148 rows 126 cols
[2024-05-26 02:18:10] [INFO ] Computed 57 invariants in 0 ms
[2024-05-26 02:18:10] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-26 02:18:10] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
[2024-05-26 02:18:10] [INFO ] Invariant cache hit.
[2024-05-26 02:18:10] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-26 02:18:11] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-26 02:18:11] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-26 02:18:11] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
[2024-05-26 02:18:11] [INFO ] Invariant cache hit.
[2024-05-26 02:18:11] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/213 places, 156/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 126/213 places, 156/245 transitions.
Stuttering acceptance computed with spot in 106 ms :[p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s31 1) (EQ s35 1)), p0:(OR (AND (EQ s12 1) (EQ s42 1)) (AND (EQ s31 1) (EQ s35 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 126 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-10 finished in 416 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(p0) U !p1)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 195 transition count 229
Ensure Unique test removed 7 places
Iterating global reduction 1 with 20 rules applied. Total rules applied 38 place count 188 transition count 229
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 47 place count 188 transition count 220
Applied a total of 47 rules in 6 ms. Remains 188 /213 variables (removed 25) and now considering 220/245 (removed 25) transitions.
[2024-05-26 02:18:11] [INFO ] Flow matrix only has 210 transitions (discarded 10 similar events)
// Phase 1: matrix 210 rows 188 cols
[2024-05-26 02:18:11] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:18:11] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-26 02:18:11] [INFO ] Flow matrix only has 210 transitions (discarded 10 similar events)
[2024-05-26 02:18:11] [INFO ] Invariant cache hit.
[2024-05-26 02:18:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:18:11] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-26 02:18:11] [INFO ] Flow matrix only has 210 transitions (discarded 10 similar events)
[2024-05-26 02:18:11] [INFO ] Invariant cache hit.
[2024-05-26 02:18:11] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/213 places, 220/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 188/213 places, 220/245 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) p0), p0]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s157 1) (EQ s181 1)), p0:(AND (EQ s84 1) (EQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-11 finished in 653 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||(!p1&&X(F(!p0)))) U (G((!p0||(!p1&&X(F(!p0)))))||((!p0||(!p1&&X(F(!p0))))&&p2))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 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 208 transition count 191
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 154 transition count 191
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 122 place count 141 transition count 174
Ensure Unique test removed 6 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 141 place count 135 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 14 rules applied. Total rules applied 155 place count 135 transition count 160
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 161 place count 129 transition count 160
Applied a total of 161 rules in 17 ms. Remains 129 /213 variables (removed 84) and now considering 160/245 (removed 85) transitions.
[2024-05-26 02:18:11] [INFO ] Flow matrix only has 151 transitions (discarded 9 similar events)
// Phase 1: matrix 151 rows 129 cols
[2024-05-26 02:18:11] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 02:18:11] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-26 02:18:11] [INFO ] Flow matrix only has 151 transitions (discarded 9 similar events)
[2024-05-26 02:18:11] [INFO ] Invariant cache hit.
[2024-05-26 02:18:12] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 02:18:12] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-26 02:18:12] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-26 02:18:12] [INFO ] Flow matrix only has 151 transitions (discarded 9 similar events)
[2024-05-26 02:18:12] [INFO ] Invariant cache hit.
[2024-05-26 02:18:12] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/213 places, 160/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 295 ms. Remains : 129/213 places, 160/245 transitions.
Stuttering acceptance computed with spot in 79 ms :[p0, true, p0]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s108 1) (EQ s125 1)), p0:(AND (EQ s108 1) (EQ s125 1)), p1:(OR (AND (EQ s65 1) (EQ s68 1)) (AND (EQ s108 1) (EQ s125 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]]
Entered a terminal (fully accepting) state of product in 1463 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-13 finished in 404 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 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 207 transition count 189
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 124 place count 145 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 124 place count 145 transition count 182
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 127 place count 143 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 127 place count 143 transition count 181
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 130 place count 141 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 141 transition count 178
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 147 place count 127 transition count 160
Ensure Unique test removed 7 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 168 place count 120 transition count 160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 16 rules applied. Total rules applied 184 place count 120 transition count 144
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 195 place count 111 transition count 142
Applied a total of 195 rules in 15 ms. Remains 111 /213 variables (removed 102) and now considering 142/245 (removed 103) transitions.
[2024-05-26 02:18:12] [INFO ] Flow matrix only has 141 transitions (discarded 1 similar events)
// Phase 1: matrix 141 rows 111 cols
[2024-05-26 02:18:12] [INFO ] Computed 46 invariants in 1 ms
[2024-05-26 02:18:12] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-26 02:18:12] [INFO ] Flow matrix only has 141 transitions (discarded 1 similar events)
[2024-05-26 02:18:12] [INFO ] Invariant cache hit.
[2024-05-26 02:18:12] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 02:18:12] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-26 02:18:12] [INFO ] Redundant transitions in 79 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 65, 66, 69, 79, 94, 95, 97, 101, 104, 105, 106, 112, 113, 114, 116, 120, 123, 124, 126, 129, 130, 131, 132, 138]
Found 34 redundant transitions using SMT.
Drop transitions removed 34 transitions
Redundant transitions reduction (with SMT) removed 34 transitions.
[2024-05-26 02:18:12] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
// Phase 1: matrix 107 rows 111 cols
[2024-05-26 02:18:12] [INFO ] Computed 46 invariants in 1 ms
[2024-05-26 02:18:12] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/213 places, 108/245 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 111 transition count 95
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 85 transition count 95
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 85 transition count 90
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 42 edges and 75 vertex of which 14 / 75 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 68 transition count 85
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 67 place count 68 transition count 78
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 94 place count 50 transition count 69
Graph (trivial) has 35 edges and 50 vertex of which 18 / 50 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 95 place count 41 transition count 69
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 104 place count 41 transition count 60
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 120 place count 41 transition count 44
Applied a total of 120 rules in 12 ms. Remains 41 /111 variables (removed 70) and now considering 44/108 (removed 64) transitions.
[2024-05-26 02:18:12] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 41 cols
[2024-05-26 02:18:12] [INFO ] Computed 19 invariants in 2 ms
[2024-05-26 02:18:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-26 02:18:12] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
[2024-05-26 02:18:12] [INFO ] Invariant cache hit.
[2024-05-26 02:18:12] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/213 places, 44/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 487 ms. Remains : 41/213 places, 44/245 transitions.
Stuttering acceptance computed with spot in 35 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:(AND (EQ s0 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-14 finished in 537 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)&&F((X(X(p1))||G(p2))))))'
Support contains 5 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 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 208 transition count 193
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 156 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 155 transition count 192
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 120 place count 142 transition count 174
Ensure Unique test removed 6 places
Iterating global reduction 3 with 19 rules applied. Total rules applied 139 place count 136 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 13 rules applied. Total rules applied 152 place count 136 transition count 161
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 157 place count 131 transition count 161
Applied a total of 157 rules in 14 ms. Remains 131 /213 variables (removed 82) and now considering 161/245 (removed 84) transitions.
[2024-05-26 02:18:12] [INFO ] Flow matrix only has 153 transitions (discarded 8 similar events)
// Phase 1: matrix 153 rows 131 cols
[2024-05-26 02:18:12] [INFO ] Computed 58 invariants in 0 ms
[2024-05-26 02:18:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-26 02:18:12] [INFO ] Flow matrix only has 153 transitions (discarded 8 similar events)
[2024-05-26 02:18:12] [INFO ] Invariant cache hit.
[2024-05-26 02:18:12] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-26 02:18:13] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-26 02:18:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 02:18:13] [INFO ] Flow matrix only has 153 transitions (discarded 8 similar events)
[2024-05-26 02:18:13] [INFO ] Invariant cache hit.
[2024-05-26 02:18:13] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/213 places, 161/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 131/213 places, 161/245 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s45 0) (EQ s58 0)), p2:(OR (EQ s53 0) (EQ s64 0)), p1:(EQ s77 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 75 steps with 18 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-15 finished in 442 ms.
All properties solved by simple procedures.
Total runtime 10883 ms.
BK_STOP 1716689894297
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-3A"
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-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 r263-tall-171654372600368"
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 '
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 ;