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.r457-smll-167912649500564.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 StigmergyElection-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649500564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 16:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 16:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 71K 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 StigmergyElection-PT-02b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679540730230

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=StigmergyElection-PT-02b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 03:05:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 03:05:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 03:05:33] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-23 03:05:33] [INFO ] Transformed 291 places.
[2023-03-23 03:05:33] [INFO ] Transformed 332 transitions.
[2023-03-23 03:05:33] [INFO ] Found NUPN structural information;
[2023-03-23 03:05:33] [INFO ] Parsed PT model containing 291 places and 332 transitions and 734 arcs in 188 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 4 formulas.
FORMULA StigmergyElection-PT-02b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 259 transition count 300
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 259 transition count 300
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 243 transition count 284
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 243 transition count 284
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 240 transition count 281
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 240 transition count 281
Applied a total of 102 rules in 95 ms. Remains 240 /291 variables (removed 51) and now considering 281/332 (removed 51) transitions.
// Phase 1: matrix 281 rows 240 cols
[2023-03-23 03:05:33] [INFO ] Computed 3 place invariants in 26 ms
[2023-03-23 03:05:33] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-23 03:05:33] [INFO ] Invariant cache hit.
[2023-03-23 03:05:34] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2023-03-23 03:05:34] [INFO ] Invariant cache hit.
[2023-03-23 03:05:34] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/291 places, 281/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1021 ms. Remains : 240/291 places, 281/332 transitions.
Support contains 30 out of 240 places after structural reductions.
[2023-03-23 03:05:34] [INFO ] Flatten gal took : 67 ms
[2023-03-23 03:05:34] [INFO ] Flatten gal took : 29 ms
[2023-03-23 03:05:34] [INFO ] Input system was already deterministic with 281 transitions.
Support contains 29 out of 240 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 700 ms. (steps per millisecond=14 ) properties (out of 26) seen :13
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 03:05:35] [INFO ] Invariant cache hit.
[2023-03-23 03:05:36] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-23 03:05:36] [INFO ] After 161ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-23 03:05:36] [INFO ] After 209ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 03:05:36] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 03:05:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 03:05:36] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-23 03:05:36] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-23 03:05:36] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 281/281 transitions.
Graph (trivial) has 242 edges and 240 vertex of which 34 / 240 are part of one of the 6 SCC in 9 ms
Free SCC test removed 28 places
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 306 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 210 transition count 92
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 155 rules applied. Total rules applied 308 place count 61 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 311 place count 58 transition count 86
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 311 place count 58 transition count 77
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 329 place count 49 transition count 77
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 334 place count 44 transition count 71
Iterating global reduction 3 with 5 rules applied. Total rules applied 339 place count 44 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 339 place count 44 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 341 place count 43 transition count 70
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 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 359 place count 34 transition count 61
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 362 place count 34 transition count 58
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 367 place count 29 transition count 47
Iterating global reduction 4 with 5 rules applied. Total rules applied 372 place count 29 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 376 place count 29 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 380 place count 27 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 381 place count 26 transition count 39
Iterating global reduction 5 with 1 rules applied. Total rules applied 382 place count 26 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 384 place count 25 transition count 39
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 386 place count 25 transition count 37
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 398 place count 25 transition count 25
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 413 place count 13 transition count 22
Applied a total of 413 rules in 76 ms. Remains 13 /240 variables (removed 227) and now considering 22/281 (removed 259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 13/240 places, 22/281 transitions.
Finished random walk after 17 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 31 stabilizing places and 33 stable transitions
FORMULA StigmergyElection-PT-02b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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||G((p1&&F(p2)))))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 281/281 transitions.
Graph (trivial) has 240 edges and 240 vertex of which 34 / 240 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 211 transition count 106
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 146 rules applied. Total rules applied 289 place count 69 transition count 102
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 293 place count 67 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 295 place count 65 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 295 place count 65 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 309 place count 58 transition count 93
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 314 place count 53 transition count 87
Iterating global reduction 4 with 5 rules applied. Total rules applied 319 place count 53 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 319 place count 53 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 321 place count 52 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 322 place count 51 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 323 place count 51 transition count 84
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 339 place count 43 transition count 76
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 346 place count 36 transition count 62
Iterating global reduction 4 with 7 rules applied. Total rules applied 353 place count 36 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 357 place count 36 transition count 58
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 358 place count 35 transition count 56
Iterating global reduction 5 with 1 rules applied. Total rules applied 359 place count 35 transition count 56
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 360 place count 34 transition count 54
Iterating global reduction 5 with 1 rules applied. Total rules applied 361 place count 34 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 371 place count 29 transition count 55
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 377 place count 29 transition count 49
Applied a total of 377 rules in 31 ms. Remains 29 /240 variables (removed 211) and now considering 49/281 (removed 232) transitions.
[2023-03-23 03:05:37] [INFO ] Flow matrix only has 46 transitions (discarded 3 similar events)
// Phase 1: matrix 46 rows 29 cols
[2023-03-23 03:05:37] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 03:05:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-23 03:05:37] [INFO ] Flow matrix only has 46 transitions (discarded 3 similar events)
[2023-03-23 03:05:37] [INFO ] Invariant cache hit.
[2023-03-23 03:05:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 03:05:37] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-23 03:05:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 03:05:37] [INFO ] Flow matrix only has 46 transitions (discarded 3 similar events)
[2023-03-23 03:05:37] [INFO ] Invariant cache hit.
[2023-03-23 03:05:37] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/240 places, 49/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 29/240 places, 49/281 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s11 1), p0:(EQ s17 1), p2:(OR (EQ s11 1) (AND (EQ s6 1) (EQ s26 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 4 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-00 finished in 786 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)))'
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 281/281 transitions.
Graph (trivial) has 243 edges and 240 vertex of which 34 / 240 are part of one of the 6 SCC in 0 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 211 transition count 101
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 149 rules applied. Total rules applied 297 place count 64 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 298 place count 63 transition count 99
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 298 place count 63 transition count 92
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 312 place count 56 transition count 92
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 317 place count 51 transition count 86
Iterating global reduction 3 with 5 rules applied. Total rules applied 322 place count 51 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 51 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 50 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 325 place count 49 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 49 transition count 83
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 342 place count 41 transition count 75
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 349 place count 34 transition count 61
Iterating global reduction 3 with 7 rules applied. Total rules applied 356 place count 34 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 360 place count 34 transition count 57
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 361 place count 33 transition count 55
Iterating global reduction 4 with 1 rules applied. Total rules applied 362 place count 33 transition count 55
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 363 place count 32 transition count 53
Iterating global reduction 4 with 1 rules applied. Total rules applied 364 place count 32 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 376 place count 26 transition count 55
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 377 place count 25 transition count 50
Iterating global reduction 4 with 1 rules applied. Total rules applied 378 place count 25 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 379 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 383 place count 25 transition count 45
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 384 place count 25 transition count 45
Applied a total of 384 rules in 28 ms. Remains 25 /240 variables (removed 215) and now considering 45/281 (removed 236) transitions.
[2023-03-23 03:05:38] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
// Phase 1: matrix 42 rows 25 cols
[2023-03-23 03:05:38] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 03:05:38] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-23 03:05:38] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2023-03-23 03:05:38] [INFO ] Invariant cache hit.
[2023-03-23 03:05:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-23 03:05:38] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-23 03:05:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 03:05:38] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2023-03-23 03:05:38] [INFO ] Invariant cache hit.
[2023-03-23 03:05:38] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/240 places, 45/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 25/240 places, 45/281 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15 reset in 320 ms.
Product exploration explored 100000 steps with 67 reset in 143 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-23 03:05:39] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2023-03-23 03:05:39] [INFO ] Invariant cache hit.
[2023-03-23 03:05:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-23 03:05:39] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2023-03-23 03:05:39] [INFO ] Invariant cache hit.
[2023-03-23 03:05:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-23 03:05:39] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-23 03:05:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 03:05:39] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2023-03-23 03:05:39] [INFO ] Invariant cache hit.
[2023-03-23 03:05:39] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 25/25 places, 45/45 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 404 steps, including 61 resets, run visited all 1 properties in 5 ms. (steps per millisecond=80 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14 reset in 109 ms.
Product exploration explored 100000 steps with 2 reset in 102 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-23 03:05:40] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2023-03-23 03:05:40] [INFO ] Invariant cache hit.
[2023-03-23 03:05:40] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-23 03:05:40] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2023-03-23 03:05:40] [INFO ] Invariant cache hit.
[2023-03-23 03:05:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-23 03:05:40] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-23 03:05:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 03:05:40] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2023-03-23 03:05:40] [INFO ] Invariant cache hit.
[2023-03-23 03:05:40] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 25/25 places, 45/45 transitions.
Treatment of property StigmergyElection-PT-02b-LTLFireability-01 finished in 2761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U X(p2))))'
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 232 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 229 transition count 270
Applied a total of 22 rules in 16 ms. Remains 229 /240 variables (removed 11) and now considering 270/281 (removed 11) transitions.
// Phase 1: matrix 270 rows 229 cols
[2023-03-23 03:05:40] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-23 03:05:41] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-23 03:05:41] [INFO ] Invariant cache hit.
[2023-03-23 03:05:41] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-23 03:05:41] [INFO ] Invariant cache hit.
[2023-03-23 03:05:41] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/240 places, 270/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1131 ms. Remains : 229/240 places, 270/281 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p1:(EQ s95 1), p2:(NEQ s168 1), p0:(EQ s100 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 307 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 31 stabilizing places and 33 stable transitions
Computed a total of 31 stabilizing places and 33 stable transitions
Detected a total of 31/229 stabilizing places and 33/270 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 10 factoid took 220 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLFireability-02 finished in 2264 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(p0))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 281/281 transitions.
Graph (trivial) has 243 edges and 240 vertex of which 34 / 240 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 149 place count 211 transition count 100
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 152 rules applied. Total rules applied 301 place count 63 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 303 place count 61 transition count 96
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 303 place count 61 transition count 89
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 317 place count 54 transition count 89
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 322 place count 49 transition count 83
Iterating global reduction 3 with 5 rules applied. Total rules applied 327 place count 49 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 327 place count 49 transition count 82
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 48 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 330 place count 47 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 47 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 332 place count 46 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 333 place count 46 transition count 78
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 349 place count 38 transition count 70
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 356 place count 31 transition count 56
Iterating global reduction 3 with 7 rules applied. Total rules applied 363 place count 31 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 367 place count 31 transition count 52
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 368 place count 30 transition count 50
Iterating global reduction 4 with 1 rules applied. Total rules applied 369 place count 30 transition count 50
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 370 place count 29 transition count 48
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 29 transition count 48
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 383 place count 23 transition count 48
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 384 place count 22 transition count 44
Iterating global reduction 4 with 1 rules applied. Total rules applied 385 place count 22 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 386 place count 22 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 388 place count 22 transition count 41
Applied a total of 388 rules in 24 ms. Remains 22 /240 variables (removed 218) and now considering 41/281 (removed 240) transitions.
[2023-03-23 03:05:43] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
// Phase 1: matrix 38 rows 22 cols
[2023-03-23 03:05:43] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-23 03:05:43] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-23 03:05:43] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2023-03-23 03:05:43] [INFO ] Invariant cache hit.
[2023-03-23 03:05:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-23 03:05:43] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-23 03:05:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 03:05:43] [INFO ] Flow matrix only has 38 transitions (discarded 3 similar events)
[2023-03-23 03:05:43] [INFO ] Invariant cache hit.
[2023-03-23 03:05:43] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/240 places, 41/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 22/240 places, 41/281 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-05 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 281/281 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 231 transition count 272
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 228 transition count 269
Applied a total of 24 rules in 12 ms. Remains 228 /240 variables (removed 12) and now considering 269/281 (removed 12) transitions.
// Phase 1: matrix 269 rows 228 cols
[2023-03-23 03:05:43] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-23 03:05:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-23 03:05:43] [INFO ] Invariant cache hit.
[2023-03-23 03:05:43] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-23 03:05:43] [INFO ] Invariant cache hit.
[2023-03-23 03:05:43] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/240 places, 269/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 228/240 places, 269/281 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-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:(NEQ s71 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 81 steps with 1 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-06 finished in 604 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(p1)||F((p2 U (p3||G(p2)))))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 232 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 229 transition count 270
Applied a total of 22 rules in 12 ms. Remains 229 /240 variables (removed 11) and now considering 270/281 (removed 11) transitions.
// Phase 1: matrix 270 rows 229 cols
[2023-03-23 03:05:43] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 03:05:44] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-23 03:05:44] [INFO ] Invariant cache hit.
[2023-03-23 03:05:44] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-23 03:05:44] [INFO ] Invariant cache hit.
[2023-03-23 03:05:44] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/240 places, 270/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 229/240 places, 270/281 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s212 0), p3:(AND (NEQ s201 1) (NEQ s110 1)), p1:(EQ s94 0), p2:(NEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 85 reset in 86 ms.
Product exploration explored 100000 steps with 66 reset in 147 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Detected a total of 30/229 stabilizing places and 32/270 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 166 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 03:05:45] [INFO ] Invariant cache hit.
[2023-03-23 03:05:45] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 03:05:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 03:05:45] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p3) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p3) (NOT p2))), (F (AND (NOT p3) p2)), (F (AND (NOT p3) (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p3) (NOT p0))))
Knowledge based reduction with 6 factoid took 263 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLFireability-08 finished in 1890 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((F(G(p0))&&G(p1))))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 281/281 transitions.
Graph (trivial) has 241 edges and 240 vertex of which 34 / 240 are part of one of the 6 SCC in 0 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 211 transition count 106
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 146 rules applied. Total rules applied 289 place count 69 transition count 102
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 293 place count 67 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 295 place count 65 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 295 place count 65 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 309 place count 58 transition count 93
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 314 place count 53 transition count 87
Iterating global reduction 4 with 5 rules applied. Total rules applied 319 place count 53 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 319 place count 53 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 321 place count 52 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 322 place count 51 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 323 place count 51 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 324 place count 50 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 325 place count 50 transition count 82
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 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 343 place count 41 transition count 73
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 350 place count 34 transition count 59
Iterating global reduction 4 with 7 rules applied. Total rules applied 357 place count 34 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 360 place count 34 transition count 56
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 361 place count 33 transition count 54
Iterating global reduction 5 with 1 rules applied. Total rules applied 362 place count 33 transition count 54
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 363 place count 32 transition count 52
Iterating global reduction 5 with 1 rules applied. Total rules applied 364 place count 32 transition count 52
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 374 place count 27 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 375 place count 26 transition count 48
Iterating global reduction 5 with 1 rules applied. Total rules applied 376 place count 26 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 377 place count 26 transition count 47
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 379 place count 26 transition count 45
Applied a total of 379 rules in 21 ms. Remains 26 /240 variables (removed 214) and now considering 45/281 (removed 236) transitions.
[2023-03-23 03:05:45] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
// Phase 1: matrix 42 rows 26 cols
[2023-03-23 03:05:45] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 03:05:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-23 03:05:45] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2023-03-23 03:05:45] [INFO ] Invariant cache hit.
[2023-03-23 03:05:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-23 03:05:45] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-23 03:05:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 03:05:45] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2023-03-23 03:05:45] [INFO ] Invariant cache hit.
[2023-03-23 03:05:45] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/240 places, 45/281 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 26/240 places, 45/281 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s14 1), p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-09 finished in 249 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(p1))))))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 281/281 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 231 transition count 272
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 228 transition count 269
Applied a total of 24 rules in 14 ms. Remains 228 /240 variables (removed 12) and now considering 269/281 (removed 12) transitions.
// Phase 1: matrix 269 rows 228 cols
[2023-03-23 03:05:46] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 03:05:46] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-23 03:05:46] [INFO ] Invariant cache hit.
[2023-03-23 03:05:46] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-23 03:05:46] [INFO ] Invariant cache hit.
[2023-03-23 03:05:46] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/240 places, 269/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 490 ms. Remains : 228/240 places, 269/281 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s211 1), p1:(EQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-10 finished in 624 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((G(p0)||(X(F(p2))&&p1)))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 281/281 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 233 transition count 274
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 233 transition count 274
Applied a total of 14 rules in 7 ms. Remains 233 /240 variables (removed 7) and now considering 274/281 (removed 7) transitions.
// Phase 1: matrix 274 rows 233 cols
[2023-03-23 03:05:46] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-23 03:05:46] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-23 03:05:46] [INFO ] Invariant cache hit.
[2023-03-23 03:05:46] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-23 03:05:46] [INFO ] Invariant cache hit.
[2023-03-23 03:05:47] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/240 places, 274/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 233/240 places, 274/281 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s52 1), p1:(AND (EQ s41 1) (EQ s138 1)), p2:(EQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-11 finished in 622 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(p0)||X(X(G(p1)))))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 281/281 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 232 transition count 273
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 229 transition count 270
Applied a total of 22 rules in 13 ms. Remains 229 /240 variables (removed 11) and now considering 270/281 (removed 11) transitions.
// Phase 1: matrix 270 rows 229 cols
[2023-03-23 03:05:47] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 03:05:47] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-23 03:05:47] [INFO ] Invariant cache hit.
[2023-03-23 03:05:47] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-23 03:05:47] [INFO ] Invariant cache hit.
[2023-03-23 03:05:47] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/240 places, 270/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 229/240 places, 270/281 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s120 1), p1:(NEQ s165 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][false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 97 ms.
Stuttering criterion allowed to conclude after 317 steps with 5 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-13 finished in 763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 281/281 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 231 transition count 272
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 228 transition count 269
Applied a total of 24 rules in 12 ms. Remains 228 /240 variables (removed 12) and now considering 269/281 (removed 12) transitions.
// Phase 1: matrix 269 rows 228 cols
[2023-03-23 03:05:48] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 03:05:48] [INFO ] Implicit Places using invariants in 680 ms returned []
[2023-03-23 03:05:48] [INFO ] Invariant cache hit.
[2023-03-23 03:05:48] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-03-23 03:05:48] [INFO ] Invariant cache hit.
[2023-03-23 03:05:49] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/240 places, 269/281 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1095 ms. Remains : 228/240 places, 269/281 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLFireability-15 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 s124 1) (EQ s216 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 StigmergyElection-PT-02b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLFireability-15 finished in 1211 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)))'
[2023-03-23 03:05:49] [INFO ] Flatten gal took : 20 ms
[2023-03-23 03:05:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2023-03-23 03:05:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 240 places, 281 transitions and 632 arcs took 42 ms.
Total runtime 16639 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/975/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : StigmergyElection-PT-02b-LTLFireability-01

BK_STOP 1679540750973

--------------------
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 StigmergyElection-PT-02b-LTLFireability-01
ltl formula formula --ltl=/tmp/975/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 240 places, 281 transitions and 632 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/975/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/975/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/975/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/975/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55b07e6423f4]
1: pnml2lts-mc(+0xa2496) [0x55b07e642496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f2fdaae6140]
3: pnml2lts-mc(+0x405be5) [0x55b07e9a5be5]
4: pnml2lts-mc(+0x16b3f9) [0x55b07e70b3f9]
5: pnml2lts-mc(+0x164ac4) [0x55b07e704ac4]
6: pnml2lts-mc(+0x272e0a) [0x55b07e812e0a]
7: pnml2lts-mc(+0xb61f0) [0x55b07e6561f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f2fda9394d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f2fda93967a]
10: pnml2lts-mc(+0xa1581) [0x55b07e641581]
11: pnml2lts-mc(+0xa1910) [0x55b07e641910]
12: pnml2lts-mc(+0xa32a2) [0x55b07e6432a2]
13: pnml2lts-mc(+0xa50f4) [0x55b07e6450f4]
14: pnml2lts-mc(+0xa516b) [0x55b07e64516b]
15: pnml2lts-mc(+0x3f34b3) [0x55b07e9934b3]
16: pnml2lts-mc(+0x7c63d) [0x55b07e61c63d]
17: pnml2lts-mc(+0x67d86) [0x55b07e607d86]
18: pnml2lts-mc(+0x60a8a) [0x55b07e600a8a]
19: pnml2lts-mc(+0x5eb15) [0x55b07e5feb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f2fda921d0a]
21: pnml2lts-mc(+0x6075e) [0x55b07e60075e]

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="StigmergyElection-PT-02b"
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 StigmergyElection-PT-02b, 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 r457-smll-167912649500564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-02b.tgz
mv StigmergyElection-PT-02b 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 ;