Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872400108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyCommit-PT-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872400108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.8K May 30 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 30 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 30 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 30 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 25 13:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 25 13:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 9.1K May 30 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 30 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 30 15:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 30 15:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 98K May 29 12:20 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 StigmergyCommit-PT-03a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654768141882

Running Version 202205111006
[2022-06-09 09:49:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 09:49:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 09:49:04] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2022-06-09 09:49:04] [INFO ] Transformed 148 places.
[2022-06-09 09:49:04] [INFO ] Transformed 332 transitions.
[2022-06-09 09:49:04] [INFO ] Found NUPN structural information;
[2022-06-09 09:49:04] [INFO ] Parsed PT model containing 148 places and 332 transitions in 486 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 110 transitions
Reduce redundant transitions removed 110 transitions.
FORMULA StigmergyCommit-PT-03a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 222/222 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 125 transition count 196
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 125 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 125 transition count 194
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 58 place count 115 transition count 181
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 115 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 115 transition count 180
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 113 transition count 178
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 113 transition count 178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 75 place count 111 transition count 176
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 111 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 110 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 110 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 109 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 109 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 109 transition count 173
Applied a total of 82 rules in 106 ms. Remains 109 /148 variables (removed 39) and now considering 173/222 (removed 49) transitions.
[2022-06-09 09:49:05] [INFO ] Flow matrix only has 166 transitions (discarded 7 similar events)
// Phase 1: matrix 166 rows 109 cols
[2022-06-09 09:49:05] [INFO ] Computed 3 place invariants in 20 ms
[2022-06-09 09:49:05] [INFO ] Implicit Places using invariants in 479 ms returned []
[2022-06-09 09:49:05] [INFO ] Flow matrix only has 166 transitions (discarded 7 similar events)
// Phase 1: matrix 166 rows 109 cols
[2022-06-09 09:49:05] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 09:49:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 09:49:06] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
[2022-06-09 09:49:06] [INFO ] Flow matrix only has 166 transitions (discarded 7 similar events)
// Phase 1: matrix 166 rows 109 cols
[2022-06-09 09:49:06] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 09:49:06] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/148 places, 173/222 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/148 places, 173/222 transitions.
Support contains 29 out of 109 places after structural reductions.
[2022-06-09 09:49:06] [INFO ] Flatten gal took : 91 ms
[2022-06-09 09:49:06] [INFO ] Flatten gal took : 36 ms
[2022-06-09 09:49:06] [INFO ] Input system was already deterministic with 173 transitions.
Support contains 28 out of 109 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-09 09:49:07] [INFO ] Flow matrix only has 166 transitions (discarded 7 similar events)
// Phase 1: matrix 166 rows 109 cols
[2022-06-09 09:49:07] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 09:49:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 09:49:07] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 09:49:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 09:49:07] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 09:49:07] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 09:49:07] [INFO ] After 38ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 09:49:08] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 4 ms to minimize.
[2022-06-09 09:49:08] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 3 ms to minimize.
[2022-06-09 09:49:08] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2022-06-09 09:49:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 369 ms
[2022-06-09 09:49:08] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-09 09:49:08] [INFO ] After 606ms 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 1 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 27 stabilizing places and 26 stable transitions
FORMULA StigmergyCommit-PT-03a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!(!(p0 U p1) U p2))&&p3)))'
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 173/173 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 162
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 98 transition count 160
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 92 transition count 154
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 92 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 92 transition count 150
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 90 transition count 148
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 90 transition count 148
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 88 transition count 146
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 88 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 87 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 87 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 87 transition count 144
Applied a total of 51 rules in 45 ms. Remains 87 /109 variables (removed 22) and now considering 144/173 (removed 29) transitions.
[2022-06-09 09:49:09] [INFO ] Flow matrix only has 138 transitions (discarded 6 similar events)
// Phase 1: matrix 138 rows 87 cols
[2022-06-09 09:49:09] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 09:49:09] [INFO ] Implicit Places using invariants in 103 ms returned []
[2022-06-09 09:49:09] [INFO ] Flow matrix only has 138 transitions (discarded 6 similar events)
// Phase 1: matrix 138 rows 87 cols
[2022-06-09 09:49:09] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 09:49:09] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-09 09:49:09] [INFO ] Implicit Places using invariants and state equation in 282 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 408 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/109 places, 144/173 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 76 transition count 134
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 76 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 76 transition count 130
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 72 transition count 126
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 72 transition count 126
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 68 transition count 122
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 68 transition count 122
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 64 transition count 118
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 64 transition count 118
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 60 transition count 114
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 60 transition count 114
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 57 transition count 111
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 57 transition count 111
Applied a total of 62 rules in 19 ms. Remains 57 /86 variables (removed 29) and now considering 111/144 (removed 33) transitions.
[2022-06-09 09:49:09] [INFO ] Flow matrix only has 105 transitions (discarded 6 similar events)
// Phase 1: matrix 105 rows 57 cols
[2022-06-09 09:49:09] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 09:49:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-06-09 09:49:09] [INFO ] Flow matrix only has 105 transitions (discarded 6 similar events)
// Phase 1: matrix 105 rows 57 cols
[2022-06-09 09:49:09] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 09:49:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 09:49:09] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/109 places, 111/173 transitions.
Finished structural reductions, in 2 iterations. Remains : 57/109 places, 111/173 transitions.
Stuttering acceptance computed with spot in 636 ms :[(OR (NOT p3) p2), p2, (AND (NOT p1) p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2))]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p3 (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(OR (EQ s13 0) (EQ s25 0) (EQ s37 0) (EQ s54 0)), p2:(AND (EQ s13 1) (EQ s25 1) (EQ s37 1) (EQ s54 1)), p1:(EQ s51 1), p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-01 finished in 1394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((p0 U p1) U p2)||(G(p3)&&F(p4))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 173/173 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 107 transition count 114
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 67 rules applied. Total rules applied 126 place count 49 transition count 105
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 8 rules applied. Total rules applied 134 place count 46 transition count 100
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 5 rules applied. Total rules applied 139 place count 44 transition count 97
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 4 with 6 rules applied. Total rules applied 145 place count 43 transition count 92
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 153 place count 39 transition count 88
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 156 place count 38 transition count 86
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 158 place count 37 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 158 place count 37 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 162 place count 35 transition count 83
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 166 place count 31 transition count 79
Iterating global reduction 8 with 4 rules applied. Total rules applied 170 place count 31 transition count 79
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 177 place count 31 transition count 72
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 177 place count 31 transition count 69
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 183 place count 28 transition count 69
Performed 4 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 191 place count 24 transition count 64
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 194 place count 24 transition count 61
Performed 2 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 198 place count 22 transition count 73
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 214 place count 22 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 216 place count 21 transition count 67
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 228 place count 21 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 230 place count 20 transition count 65
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 242 place count 20 transition count 53
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 13 with 12 rules applied. Total rules applied 254 place count 20 transition count 41
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 258 place count 16 transition count 37
Applied a total of 258 rules in 51 ms. Remains 16 /109 variables (removed 93) and now considering 37/173 (removed 136) transitions.
[2022-06-09 09:49:10] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 16 cols
[2022-06-09 09:49:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 09:49:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-06-09 09:49:10] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 16 cols
[2022-06-09 09:49:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 09:49:10] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-06-09 09:49:10] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 09:49:10] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 16 cols
[2022-06-09 09:49:10] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 09:49:10] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/109 places, 37/173 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/109 places, 37/173 transitions.
Stuttering acceptance computed with spot in 807 ms :[true, (OR (NOT p3) (NOT p4)), (NOT p3), (AND p2 (NOT p3)), (OR (AND p1 p2 (NOT p3)) (AND p1 p2 (NOT p4))), (AND p1 p2 (NOT p3)), (OR (AND p1 (NOT p3)) (AND p1 (NOT p4))), (AND p1 (NOT p3)), (OR (AND p2 (NOT p4)) (AND p2 (NOT p3))), p2, (AND p1 p2), p1]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 0}, { cond=(AND p3 (NOT p4)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p4), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=p3, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p3), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 10}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2 p3 (NOT p4)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 p3 p4), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) p3 p4), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) p3 (NOT p4)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2) p3 p4), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3 (NOT p4)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) p2 p3 p4), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p2) p3 (NOT p4)), acceptance={} source=4 dest: 8}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 10}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 11}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p1 p2 p3), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 10}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 11}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND p1 p3 (NOT p4)), acceptance={} source=6 dest: 1}, { cond=(AND p1 p3 p4), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1) p3 (NOT p4)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p3 p4), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 11}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND p1 p3), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=7 dest: 11}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=8 dest: 0}, { cond=(AND p2 p3 (NOT p4)), acceptance={} source=8 dest: 1}, { cond=(AND p2 p3 p4), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p2) p3 p4), acceptance={} source=8 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) p3 (NOT p4)), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2) p3 p4), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p2) p3 (NOT p4)), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=8 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 10}], [{ cond=p2, acceptance={} source=9 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND p1 p2), acceptance={} source=10 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 10}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=10 dest: 11}], [{ cond=p1, acceptance={} source=11 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 11}]], initial=8, aps=[p3:(EQ s2 0), p4:(EQ s10 0), p2:(EQ s8 1), p1:(EQ s13 1), p0:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 754 ms.
Product exploration explored 100000 steps with 0 reset in 259 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p4 (NOT p2) (NOT p1) p0), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X (NOT (AND p2 p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p2 p3 (NOT p4)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 p3 p4))), (X (NOT (AND p1 p2 (NOT p3)))), (X p3), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p1 p2 p3 p4))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3 p4))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND p1 (NOT p2) p3 p4))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (AND p0 (NOT p1) (NOT p2) p3)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (NOT (AND p2 p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2 p3 (NOT p4))))), true, (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p3 p4)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2 p3 p4)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3 p4)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (AND p3 (NOT p4))), (X (NOT (AND p3 (NOT p4)))), (X (AND p0 (NOT p1) (NOT p2) p3 p4)), (X (NOT (AND p0 (NOT p1) (NOT p2) p3 p4))), (X (AND p0 (NOT p1) (NOT p2) p3 (NOT p4))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3 (NOT p4)))), (X (AND p3 p4)), (X (NOT (AND p3 p4))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p0 (NOT p1) p3 p4))), (X (X (NOT (AND p0 (NOT p1) p3 p4)))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND p0 (NOT p1) (NOT p2) p3 p4))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3 p4)))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 p3 p4))), (X (X (NOT (AND p1 p3 p4)))), (X (X (AND p0 (NOT p1) (NOT p2) p3 (NOT p4)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p0 (NOT p1) p3 (NOT p4)))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p4))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p3 p4))), (X (X (NOT (AND p3 p4)))), (X (X (AND p1 (NOT p2) p3 p4))), (X (X (NOT (AND p1 (NOT p2) p3 p4)))), (X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND p0 (NOT p1) (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 47 factoid took 3934 ms. Reduced automaton from 12 states, 60 edges and 5 AP to 9 states, 31 edges and 4 AP.
Stuttering acceptance computed with spot in 369 ms :[true, (AND p1 p2 (NOT p3)), (NOT p3), p2, (AND p2 (NOT p3)), p1, (AND p1 p2), (AND p1 (NOT p3)), (AND p1 p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 631 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 22) seen :13
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-06-09 09:49:17] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 16 cols
[2022-06-09 09:49:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 09:49:17] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-09 09:49:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 09:49:17] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2022-06-09 09:49:17] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2022-06-09 09:49:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-06-09 09:49:18] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 20 ms to minimize.
[2022-06-09 09:49:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 312 ms
[2022-06-09 09:49:18] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
[2022-06-09 09:49:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-06-09 09:49:18] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :0
[2022-06-09 09:49:18] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 9 invariant AP formulas.
Knowledge obtained : [(AND p3 p4 (NOT p2) (NOT p1) p0), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p1 p2 p3 (NOT p4)))), (X (NOT (AND p2 p3 (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p2 p3 (NOT p4)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 p3 p4))), (X (NOT (AND p1 p2 (NOT p3)))), (X p3), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p1 p2 p3 p4))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3 p4))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND p1 (NOT p2) p3 p4))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (AND p0 (NOT p1) (NOT p2) p3)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 p3 (NOT p4))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p3 (NOT p4))))), (X (X (NOT (AND p2 p3 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2 p3 (NOT p4))))), true, (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 p3 p4)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2 p3 p4)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3 p4)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND p2 (NOT p3)))), (G (NOT (AND p1 (NOT p3)))), (G (NOT (AND p1 (NOT p2) (NOT p3)))), (G (NOT (AND p1 p2))), (G (NOT (AND p1 p2 p3))), (G (NOT (AND p1 p2 (NOT p3)))), (G (NOT (AND p0 (NOT p1) (NOT p3)))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(X (AND p3 (NOT p4))), (X (NOT (AND p3 (NOT p4)))), (X (AND p0 (NOT p1) (NOT p2) p3 p4)), (X (NOT (AND p0 (NOT p1) (NOT p2) p3 p4))), (X (AND p0 (NOT p1) (NOT p2) p3 (NOT p4))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3 (NOT p4)))), (X (AND p3 p4)), (X (NOT (AND p3 p4))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p0 (NOT p1) p3 p4))), (X (X (NOT (AND p0 (NOT p1) p3 p4)))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (AND p0 (NOT p1) (NOT p2) p3 p4))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3 p4)))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND p1 p3 p4))), (X (X (NOT (AND p1 p3 p4)))), (X (X (AND p0 (NOT p1) (NOT p2) p3 (NOT p4)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p0 (NOT p1) p3 (NOT p4)))), (X (X (NOT (AND p0 (NOT p1) p3 (NOT p4))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p3 p4))), (X (X (NOT (AND p3 p4)))), (X (X (AND p1 (NOT p2) p3 p4))), (X (X (NOT (AND p1 (NOT p2) p3 p4)))), (X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND p0 (NOT p1) (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X p1)), (X (X (NOT p1))), (F (AND p1 (NOT p2) p3)), (F (NOT (AND p0 (NOT p1) (NOT p2) p3))), (F (AND p1 p3)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) p2)), (F (AND p2 p3)), (F (NOT p3)), (F (NOT (AND p0 (NOT p1) p3))), (F (AND p1 (NOT p2))), (F p2), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND p0 (NOT p1) p2 p3))]
Knowledge based reduction with 56 factoid took 5140 ms. Reduced automaton from 9 states, 31 edges and 4 AP to 6 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 320 ms :[true, (AND p1 p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3)), (AND p1 (NOT p3)), (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 322 ms :[true, (AND p1 p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3)), (AND p1 (NOT p3)), (AND p1 p2 (NOT p3))]
Support contains 3 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2022-06-09 09:49:23] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 16 cols
[2022-06-09 09:49:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 09:49:23] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-06-09 09:49:23] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 16 cols
[2022-06-09 09:49:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 09:49:24] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2022-06-09 09:49:24] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 16 cols
[2022-06-09 09:49:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 09:49:24] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 37/37 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) p0), (X (NOT (AND p0 p2))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 729 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 6 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 253 ms :[true, (AND p1 p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3)), (AND p1 (NOT p3)), (AND p1 p2 (NOT p3))]
Finished random walk after 31 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) p0), (X (NOT (AND p0 p2))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (AND p0 p2)), (F (NOT (AND (NOT p1) p0))), (F (NOT p3)), (F (AND p1 (NOT p2))), (F p2)]
Knowledge based reduction with 6 factoid took 975 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 6 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 326 ms :[true, (AND p1 p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3)), (AND p1 (NOT p3)), (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 312 ms :[true, (AND p1 p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3)), (AND p1 (NOT p3)), (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 307 ms :[true, (AND p1 p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3)), (AND p1 (NOT p3)), (AND p1 p2 (NOT p3))]
Product exploration explored 100000 steps with 1 reset in 179 ms.
Product exploration explored 100000 steps with 0 reset in 194 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 255 ms :[true, (AND p1 p2 (NOT p3)), (NOT p3), (AND p2 (NOT p3)), (AND p1 (NOT p3)), (AND p1 p2 (NOT p3))]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 37/37 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 16 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 7 ms. Remains 16 /16 variables (removed 0) and now considering 38/37 (removed -1) transitions.
[2022-06-09 09:49:28] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 09:49:28] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
// Phase 1: matrix 32 rows 16 cols
[2022-06-09 09:49:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 09:49:28] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/16 places, 38/37 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 38/37 transitions.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Product exploration explored 100000 steps with 2 reset in 76 ms.
Built C files in :
/tmp/ltsmin14577237651682045297
[2022-06-09 09:49:28] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14577237651682045297
Running compilation step : cd /tmp/ltsmin14577237651682045297;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 339 ms.
Running link step : cd /tmp/ltsmin14577237651682045297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14577237651682045297;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2871847946965466272.hoa' '--buchi-type=spotba'
LTSmin run took 144 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-03a-LTLFireability-04 finished in 18624 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X(X(((p0 U p0) U p1))))&&p2))))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 173/173 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 160
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 97 transition count 158
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 90 transition count 150
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 90 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 44 place count 90 transition count 146
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 88 transition count 144
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 88 transition count 144
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 86 transition count 142
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 86 transition count 142
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 84 transition count 140
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 84 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 84 transition count 139
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 83 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 83 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 83 transition count 137
Applied a total of 60 rules in 13 ms. Remains 83 /109 variables (removed 26) and now considering 137/173 (removed 36) transitions.
[2022-06-09 09:49:28] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 83 cols
[2022-06-09 09:49:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:28] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-06-09 09:49:28] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 83 cols
[2022-06-09 09:49:28] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 09:49:29] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-09 09:49:29] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 216 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 137/173 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 126
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 71 transition count 122
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 67 transition count 118
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 67 transition count 118
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 63 transition count 114
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 63 transition count 114
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 59 transition count 110
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 59 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 55 transition count 106
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 55 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 52 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 52 transition count 103
Applied a total of 64 rules in 7 ms. Remains 52 /82 variables (removed 30) and now considering 103/137 (removed 34) transitions.
[2022-06-09 09:49:29] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
// Phase 1: matrix 98 rows 52 cols
[2022-06-09 09:49:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:29] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-06-09 09:49:29] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
// Phase 1: matrix 98 rows 52 cols
[2022-06-09 09:49:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:29] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 09:49:29] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/109 places, 103/173 transitions.
Finished structural reductions, in 2 iterations. Remains : 52/109 places, 103/173 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(EQ s48 1), p2:(OR (EQ s13 0) (EQ s25 0) (EQ s37 0) (EQ s49 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]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-05 finished in 649 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 173/173 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 109 transition count 169
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 105 transition count 166
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 11 place count 105 transition count 146
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 51 place count 85 transition count 146
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 62 place count 74 transition count 134
Iterating global reduction 2 with 11 rules applied. Total rules applied 73 place count 74 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 74 transition count 131
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 68 transition count 124
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 68 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 92 place count 68 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 67 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 67 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 67 transition count 118
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 119 place count 55 transition count 106
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 125 place count 49 transition count 100
Iterating global reduction 5 with 6 rules applied. Total rules applied 131 place count 49 transition count 100
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 145 place count 49 transition count 86
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 148 place count 46 transition count 83
Iterating global reduction 6 with 3 rules applied. Total rules applied 151 place count 46 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 153 place count 46 transition count 81
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 154 place count 45 transition count 80
Iterating global reduction 7 with 1 rules applied. Total rules applied 155 place count 45 transition count 80
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 159 place count 45 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 167 place count 41 transition count 72
Applied a total of 167 rules in 90 ms. Remains 41 /109 variables (removed 68) and now considering 72/173 (removed 101) transitions.
[2022-06-09 09:49:29] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
// Phase 1: matrix 67 rows 41 cols
[2022-06-09 09:49:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:29] [INFO ] Implicit Places using invariants in 56 ms returned []
[2022-06-09 09:49:29] [INFO ] Flow matrix only has 67 transitions (discarded 5 similar events)
// Phase 1: matrix 67 rows 41 cols
[2022-06-09 09:49:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-09 09:49:29] [INFO ] Implicit Places using invariants and state equation in 168 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 233 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/109 places, 72/173 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 0 with 7 rules applied. Total rules applied 7 place count 40 transition count 65
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 33 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 32 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 32 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 30 transition count 62
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 27 transition count 59
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 27 transition count 59
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 50 place count 15 transition count 47
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 58 place count 15 transition count 39
Applied a total of 58 rules in 19 ms. Remains 15 /40 variables (removed 25) and now considering 39/72 (removed 33) transitions.
[2022-06-09 09:49:29] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
// Phase 1: matrix 34 rows 15 cols
[2022-06-09 09:49:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 09:49:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-06-09 09:49:29] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
// Phase 1: matrix 34 rows 15 cols
[2022-06-09 09:49:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:29] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 09:49:29] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/109 places, 39/173 transitions.
Finished structural reductions, in 2 iterations. Remains : 15/109 places, 39/173 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s7 1) (EQ s10 1) (EQ s14 1)), p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-06 finished in 541 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U G(p1))||X(p2)))&&X(p3)))'
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 173/173 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 98 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 91 transition count 151
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 91 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 91 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 89 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 89 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 87 transition count 143
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 87 transition count 143
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 85 transition count 141
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 85 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 85 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 84 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 84 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 84 transition count 138
Applied a total of 58 rules in 27 ms. Remains 84 /109 variables (removed 25) and now considering 138/173 (removed 35) transitions.
[2022-06-09 09:49:30] [INFO ] Flow matrix only has 133 transitions (discarded 5 similar events)
// Phase 1: matrix 133 rows 84 cols
[2022-06-09 09:49:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2022-06-09 09:49:30] [INFO ] Flow matrix only has 133 transitions (discarded 5 similar events)
// Phase 1: matrix 133 rows 84 cols
[2022-06-09 09:49:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:30] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-09 09:49:30] [INFO ] Implicit Places using invariants and state equation in 301 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 393 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/109 places, 138/173 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 73 transition count 128
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 73 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 73 transition count 124
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 70 transition count 121
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 70 transition count 121
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 67 transition count 118
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 67 transition count 118
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 64 transition count 115
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 64 transition count 115
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 61 transition count 112
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 61 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 58 transition count 109
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 58 transition count 109
Applied a total of 54 rules in 15 ms. Remains 58 /83 variables (removed 25) and now considering 109/138 (removed 29) transitions.
[2022-06-09 09:49:30] [INFO ] Flow matrix only has 104 transitions (discarded 5 similar events)
// Phase 1: matrix 104 rows 58 cols
[2022-06-09 09:49:30] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-06-09 09:49:30] [INFO ] Flow matrix only has 104 transitions (discarded 5 similar events)
// Phase 1: matrix 104 rows 58 cols
[2022-06-09 09:49:30] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 09:49:30] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 09:49:30] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/109 places, 109/173 transitions.
Finished structural reductions, in 2 iterations. Remains : 58/109 places, 109/173 transitions.
Stuttering acceptance computed with spot in 519 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p3 p0), acceptance={} source=1 dest: 4}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(AND (EQ s13 1) (EQ s26 1) (EQ s38 1) (EQ s50 1)), p1:(NEQ s51 1), p0:(NEQ s12 1), p2:(OR (EQ s16 1) (AND (EQ s13 1) (EQ s26 1) (EQ s38 1) (EQ s50 1)))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-07 finished in 1124 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (X(!p0)&&p1)))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 173/173 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 160
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 97 transition count 158
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 90 transition count 150
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 90 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 44 place count 90 transition count 146
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 88 transition count 144
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 88 transition count 144
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 86 transition count 142
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 86 transition count 142
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 84 transition count 140
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 84 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 84 transition count 139
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 83 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 83 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 83 transition count 137
Applied a total of 60 rules in 17 ms. Remains 83 /109 variables (removed 26) and now considering 137/173 (removed 36) transitions.
[2022-06-09 09:49:31] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 83 cols
[2022-06-09 09:49:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:31] [INFO ] Implicit Places using invariants in 83 ms returned []
[2022-06-09 09:49:31] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 83 cols
[2022-06-09 09:49:31] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 09:49:31] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-09 09:49:31] [INFO ] Implicit Places using invariants and state equation in 281 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 366 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 137/173 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 126
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 71 transition count 122
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 67 transition count 118
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 67 transition count 118
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 63 transition count 114
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 63 transition count 114
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 59 transition count 110
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 59 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 56 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 56 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 53 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 53 transition count 104
Applied a total of 62 rules in 11 ms. Remains 53 /82 variables (removed 29) and now considering 104/137 (removed 33) transitions.
[2022-06-09 09:49:31] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 53 cols
[2022-06-09 09:49:31] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:31] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-06-09 09:49:31] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 53 cols
[2022-06-09 09:49:31] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:31] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 09:49:31] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 53/109 places, 104/173 transitions.
Finished structural reductions, in 2 iterations. Remains : 53/109 places, 104/173 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s50 1), p1:(AND (EQ s13 1) (EQ s25 1) (EQ s37 1) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10261 reset in 129 ms.
Product exploration explored 100000 steps with 10191 reset in 121 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/53 stabilizing places and 4/104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), true, (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) p1), (NOT p0), true]
Finished random walk after 27 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), true, (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 386 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) p1), (NOT p0), true]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (NOT p0), true]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 104/104 transitions.
Applied a total of 0 rules in 0 ms. Remains 53 /53 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2022-06-09 09:49:33] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 53 cols
[2022-06-09 09:49:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-06-09 09:49:33] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 53 cols
[2022-06-09 09:49:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:33] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 09:49:33] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2022-06-09 09:49:33] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 53 cols
[2022-06-09 09:49:33] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 09:49:33] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 104/104 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/53 stabilizing places and 4/104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), true, (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) p1), (NOT p0), true]
Finished random walk after 27 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), true, (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 331 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (NOT p0), true]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) p1), (NOT p0), true]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1), (NOT p0), true]
Product exploration explored 100000 steps with 10244 reset in 136 ms.
Product exploration explored 100000 steps with 10207 reset in 114 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (NOT p0), true]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 104/104 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 53 transition count 104
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 12 place count 53 transition count 108
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 53 transition count 108
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 46 transition count 101
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 46 transition count 101
Performed 16 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 47 place count 46 transition count 105
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 70 place count 46 transition count 82
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 37 transition count 73
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 37 transition count 73
Deduced a syphon composed of 17 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 96 place count 37 transition count 65
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 37 transition count 65
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 108 place count 29 transition count 57
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 116 place count 29 transition count 57
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 116 rules in 27 ms. Remains 29 /53 variables (removed 24) and now considering 57/104 (removed 47) transitions.
[2022-06-09 09:49:34] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-09 09:49:34] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
// Phase 1: matrix 52 rows 29 cols
[2022-06-09 09:49:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-06-09 09:49:34] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/53 places, 57/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/53 places, 57/104 transitions.
Product exploration explored 100000 steps with 10239 reset in 173 ms.
Product exploration explored 100000 steps with 10235 reset in 136 ms.
Built C files in :
/tmp/ltsmin8904498980325075152
[2022-06-09 09:49:35] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8904498980325075152
Running compilation step : cd /tmp/ltsmin8904498980325075152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 253 ms.
Running link step : cd /tmp/ltsmin8904498980325075152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8904498980325075152;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13232384555725038936.hoa' '--buchi-type=spotba'
LTSmin run took 491 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-03a-LTLFireability-09 finished in 4865 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(!(X(p1) U p2)))))'
Support contains 3 out of 109 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 173/173 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 99 transition count 161
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 93 transition count 154
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 93 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 93 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 92 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 92 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 91 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 91 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 90 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 90 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 89 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 89 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 89 transition count 145
Applied a total of 46 rules in 9 ms. Remains 89 /109 variables (removed 20) and now considering 145/173 (removed 28) transitions.
[2022-06-09 09:49:36] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
// Phase 1: matrix 140 rows 89 cols
[2022-06-09 09:49:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:36] [INFO ] Implicit Places using invariants in 88 ms returned []
[2022-06-09 09:49:36] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
// Phase 1: matrix 140 rows 89 cols
[2022-06-09 09:49:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-09 09:49:36] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2022-06-09 09:49:36] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
// Phase 1: matrix 140 rows 89 cols
[2022-06-09 09:49:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:36] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/109 places, 145/173 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/109 places, 145/173 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p2), p2]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s59 0), p2:(AND (EQ s50 1) (EQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 108 ms.
Computed a total of 26 stabilizing places and 25 stable transitions
Computed a total of 26 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), true, (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 403 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[true, p2, p2]
Finished random walk after 174 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), true, (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 8 factoid took 423 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[true, p2, p2]
Stuttering acceptance computed with spot in 112 ms :[true, p2, p2]
Support contains 2 out of 89 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 145/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2022-06-09 09:49:38] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
// Phase 1: matrix 140 rows 89 cols
[2022-06-09 09:49:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:38] [INFO ] Implicit Places using invariants in 107 ms returned []
[2022-06-09 09:49:38] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
// Phase 1: matrix 140 rows 89 cols
[2022-06-09 09:49:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-09 09:49:38] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2022-06-09 09:49:38] [INFO ] Flow matrix only has 140 transitions (discarded 5 similar events)
// Phase 1: matrix 140 rows 89 cols
[2022-06-09 09:49:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:38] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/89 places, 145/145 transitions.
Computed a total of 26 stabilizing places and 25 stable transitions
Computed a total of 26 stabilizing places and 25 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[true, p2, p2]
Finished random walk after 322 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=107 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), true]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 110 ms :[true, p2, p2]
Stuttering acceptance computed with spot in 110 ms :[true, p2, p2]
Stuttering acceptance computed with spot in 110 ms :[true, p2, p2]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 109 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 110 ms :[true, p2, p2]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 145/145 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 89 transition count 142
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 7 place count 89 transition count 142
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 24 place count 89 transition count 142
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 41 place count 89 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 47 place count 89 transition count 149
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 60 place count 76 transition count 136
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 73 place count 76 transition count 136
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 88 place count 76 transition count 121
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 96 place count 68 transition count 113
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 104 place count 68 transition count 113
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 108 place count 64 transition count 109
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 112 place count 64 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 116 place count 64 transition count 117
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 120 place count 60 transition count 109
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 124 place count 60 transition count 109
Deduced a syphon composed of 29 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 132 place count 60 transition count 101
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 132 rules in 61 ms. Remains 60 /89 variables (removed 29) and now considering 101/145 (removed 44) transitions.
[2022-06-09 09:49:40] [INFO ] Redundant transitions in 4 ms returned []
[2022-06-09 09:49:40] [INFO ] Flow matrix only has 96 transitions (discarded 5 similar events)
// Phase 1: matrix 96 rows 60 cols
[2022-06-09 09:49:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:40] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/89 places, 101/145 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/89 places, 101/145 transitions.
Product exploration explored 100000 steps with 0 reset in 174 ms.
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-10 finished in 4382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F((X(p0)||p1)))&&F(X(p2))) U (p1 U p2)))'
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 173/173 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 107 transition count 119
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 63 rules applied. Total rules applied 117 place count 54 transition count 109
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 123 place count 51 transition count 106
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 123 place count 51 transition count 101
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 133 place count 46 transition count 101
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 148 place count 31 transition count 85
Iterating global reduction 3 with 15 rules applied. Total rules applied 163 place count 31 transition count 85
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 177 place count 31 transition count 71
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 177 place count 31 transition count 68
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 183 place count 28 transition count 68
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
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 195 place count 22 transition count 60
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 199 place count 22 transition count 56
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 207 place count 18 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 208 place count 17 transition count 51
Applied a total of 208 rules in 38 ms. Remains 17 /109 variables (removed 92) and now considering 51/173 (removed 122) transitions.
[2022-06-09 09:49:40] [INFO ] Flow matrix only has 46 transitions (discarded 5 similar events)
// Phase 1: matrix 46 rows 17 cols
[2022-06-09 09:49:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-06-09 09:49:40] [INFO ] Flow matrix only has 46 transitions (discarded 5 similar events)
// Phase 1: matrix 46 rows 17 cols
[2022-06-09 09:49:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:40] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 09:49:40] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-06-09 09:49:40] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 09:49:40] [INFO ] Flow matrix only has 46 transitions (discarded 5 similar events)
// Phase 1: matrix 46 rows 17 cols
[2022-06-09 09:49:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:40] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/109 places, 51/173 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/109 places, 51/173 transitions.
Stuttering acceptance computed with spot in 419 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s5 1) (EQ s8 1) (EQ s11 1) (EQ s16 1)), p1:(EQ s13 1), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 1 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-12 finished in 670 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))||X(G(F(X(G(p1))))))))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 173/173 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 98 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 92 transition count 152
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 92 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 92 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 91 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 91 transition count 147
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 90 transition count 146
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 90 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 89 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 89 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 89 transition count 144
Applied a total of 47 rules in 14 ms. Remains 89 /109 variables (removed 20) and now considering 144/173 (removed 29) transitions.
[2022-06-09 09:49:41] [INFO ] Flow matrix only has 139 transitions (discarded 5 similar events)
// Phase 1: matrix 139 rows 89 cols
[2022-06-09 09:49:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:41] [INFO ] Implicit Places using invariants in 84 ms returned []
[2022-06-09 09:49:41] [INFO ] Flow matrix only has 139 transitions (discarded 5 similar events)
// Phase 1: matrix 139 rows 89 cols
[2022-06-09 09:49:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-09 09:49:41] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 332 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/109 places, 144/173 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 77 transition count 133
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 77 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 77 transition count 129
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 73 transition count 125
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 73 transition count 125
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 69 transition count 121
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 69 transition count 121
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 65 transition count 117
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 65 transition count 117
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 61 transition count 113
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 61 transition count 113
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 58 transition count 110
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 58 transition count 110
Applied a total of 64 rules in 6 ms. Remains 58 /88 variables (removed 30) and now considering 110/144 (removed 34) transitions.
[2022-06-09 09:49:41] [INFO ] Flow matrix only has 105 transitions (discarded 5 similar events)
// Phase 1: matrix 105 rows 58 cols
[2022-06-09 09:49:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-06-09 09:49:41] [INFO ] Flow matrix only has 105 transitions (discarded 5 similar events)
// Phase 1: matrix 105 rows 58 cols
[2022-06-09 09:49:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 09:49:41] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/109 places, 110/173 transitions.
Finished structural reductions, in 2 iterations. Remains : 58/109 places, 110/173 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s44 1), p1:(OR (EQ s13 0) (EQ s25 0) (EQ s37 0) (EQ s55 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-13 finished in 697 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 173/173 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 160
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 97 transition count 158
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 90 transition count 150
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 90 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 44 place count 90 transition count 146
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 88 transition count 144
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 88 transition count 144
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 86 transition count 142
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 86 transition count 142
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 84 transition count 140
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 84 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 84 transition count 139
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 83 transition count 138
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 83 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 83 transition count 137
Applied a total of 60 rules in 13 ms. Remains 83 /109 variables (removed 26) and now considering 137/173 (removed 36) transitions.
[2022-06-09 09:49:41] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 83 cols
[2022-06-09 09:49:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:49:41] [INFO ] Implicit Places using invariants in 92 ms returned []
[2022-06-09 09:49:41] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 83 cols
[2022-06-09 09:49:41] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 09:49:42] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-09 09:49:42] [INFO ] Implicit Places using invariants and state equation in 274 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 368 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 137/173 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 126
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 71 transition count 122
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 67 transition count 118
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 67 transition count 118
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 63 transition count 114
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 63 transition count 114
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 59 transition count 110
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 59 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 55 transition count 106
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 55 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 52 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 52 transition count 103
Applied a total of 64 rules in 11 ms. Remains 52 /82 variables (removed 30) and now considering 103/137 (removed 34) transitions.
[2022-06-09 09:49:42] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
// Phase 1: matrix 98 rows 52 cols
[2022-06-09 09:49:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:42] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-06-09 09:49:42] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
// Phase 1: matrix 98 rows 52 cols
[2022-06-09 09:49:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 09:49:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 09:49:42] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/109 places, 103/173 transitions.
Finished structural reductions, in 2 iterations. Remains : 52/109 places, 103/173 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s13 0) (EQ s25 0) (EQ s37 0) (EQ s49 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyCommit-PT-03a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-03a-LTLFireability-14 finished in 1090 ms.
All properties solved by simple procedures.
Total runtime 38712 ms.

BK_STOP 1654768183155

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="StigmergyCommit-PT-03a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-03a, 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 r294-smll-165463872400108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-03a.tgz
mv StigmergyCommit-PT-03a 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 ;