About the Execution of ITS-Tools for StigmergyElection-PT-02b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 443.892 | 34727.00 | 62963.00 | 760.40 | TTTFFFFFFTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r453-smll-167912645600563.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is StigmergyElection-PT-02b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645600563
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 16:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 16:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 71K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679408879739
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-02b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-21 14:28:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 14:28:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 14:28:03] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-21 14:28:03] [INFO ] Transformed 291 places.
[2023-03-21 14:28:03] [INFO ] Transformed 332 transitions.
[2023-03-21 14:28:03] [INFO ] Found NUPN structural information;
[2023-03-21 14:28:03] [INFO ] Parsed PT model containing 291 places and 332 transitions and 734 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-02b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 259 transition count 300
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 259 transition count 300
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 78 place count 245 transition count 286
Iterating global reduction 0 with 14 rules applied. Total rules applied 92 place count 245 transition count 286
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 243 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 243 transition count 284
Applied a total of 96 rules in 120 ms. Remains 243 /291 variables (removed 48) and now considering 284/332 (removed 48) transitions.
// Phase 1: matrix 284 rows 243 cols
[2023-03-21 14:28:04] [INFO ] Computed 3 place invariants in 26 ms
[2023-03-21 14:28:04] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-21 14:28:04] [INFO ] Invariant cache hit.
[2023-03-21 14:28:04] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2023-03-21 14:28:04] [INFO ] Invariant cache hit.
[2023-03-21 14:28:05] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/291 places, 284/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1425 ms. Remains : 243/291 places, 284/332 transitions.
Support contains 29 out of 243 places after structural reductions.
[2023-03-21 14:28:05] [INFO ] Flatten gal took : 103 ms
[2023-03-21 14:28:05] [INFO ] Flatten gal took : 55 ms
[2023-03-21 14:28:05] [INFO ] Input system was already deterministic with 284 transitions.
Support contains 27 out of 243 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 46 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 20) seen :16
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 14:28:06] [INFO ] Invariant cache hit.
[2023-03-21 14:28:07] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 14:28:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-21 14:28:07] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 14:28:07] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-21 14:28:07] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 5 ms.
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 284/284 transitions.
Graph (trivial) has 246 edges and 243 vertex of which 34 / 243 are part of one of the 6 SCC in 4 ms
Free SCC test removed 28 places
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Graph (complete) has 309 edges and 215 vertex of which 213 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 155 rules applied. Total rules applied 157 place count 213 transition count 91
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 157 rules applied. Total rules applied 314 place count 60 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 316 place count 58 transition count 87
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 316 place count 58 transition count 77
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 336 place count 48 transition count 77
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 342 place count 42 transition count 70
Iterating global reduction 3 with 6 rules applied. Total rules applied 348 place count 42 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 348 place count 42 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 350 place count 41 transition count 69
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 352 place count 39 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 354 place count 39 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 355 place count 39 transition count 63
Performed 10 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 375 place count 29 transition count 50
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 376 place count 29 transition count 49
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 382 place count 23 transition count 37
Iterating global reduction 5 with 6 rules applied. Total rules applied 388 place count 23 transition count 37
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 392 place count 23 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 394 place count 22 transition count 33
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 396 place count 22 transition count 31
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 407 place count 22 transition count 20
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 423 place count 11 transition count 15
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 425 place count 9 transition count 13
Iterating global reduction 7 with 2 rules applied. Total rules applied 427 place count 9 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 428 place count 9 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 429 place count 9 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 430 place count 8 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 431 place count 7 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 431 place count 7 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 433 place count 6 transition count 9
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 438 place count 3 transition count 6
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 441 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 441 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 443 place count 2 transition count 2
Applied a total of 443 rules in 56 ms. Remains 2 /243 variables (removed 241) and now considering 2/284 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 2/243 places, 2/284 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Computed a total of 32 stabilizing places and 34 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F(!p1))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 284/284 transitions.
Graph (trivial) has 244 edges and 243 vertex of which 34 / 243 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 149 place count 214 transition count 103
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 152 rules applied. Total rules applied 301 place count 66 transition count 99
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 304 place count 64 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 305 place count 63 transition count 98
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 305 place count 63 transition count 91
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 319 place count 56 transition count 91
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 325 place count 50 transition count 84
Iterating global reduction 4 with 6 rules applied. Total rules applied 331 place count 50 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 331 place count 50 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 333 place count 49 transition count 83
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 335 place count 47 transition count 77
Iterating global reduction 4 with 2 rules applied. Total rules applied 337 place count 47 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 338 place count 47 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 339 place count 46 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 340 place count 46 transition count 75
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 358 place count 37 transition count 66
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 364 place count 31 transition count 54
Iterating global reduction 5 with 6 rules applied. Total rules applied 370 place count 31 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 372 place count 31 transition count 52
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 373 place count 30 transition count 50
Iterating global reduction 6 with 1 rules applied. Total rules applied 374 place count 30 transition count 50
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 380 place count 27 transition count 51
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 382 place count 27 transition count 49
Applied a total of 382 rules in 37 ms. Remains 27 /243 variables (removed 216) and now considering 49/284 (removed 235) transitions.
[2023-03-21 14:28:07] [INFO ] Flow matrix only has 46 transitions (discarded 3 similar events)
// Phase 1: matrix 46 rows 27 cols
[2023-03-21 14:28:07] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-21 14:28:07] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-21 14:28:07] [INFO ] Flow matrix only has 46 transitions (discarded 3 similar events)
[2023-03-21 14:28:07] [INFO ] Invariant cache hit.
[2023-03-21 14:28:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 14:28:08] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-21 14:28:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 14:28:08] [INFO ] Flow matrix only has 46 transitions (discarded 3 similar events)
[2023-03-21 14:28:08] [INFO ] Invariant cache hit.
[2023-03-21 14:28:08] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/243 places, 49/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 27/243 places, 49/284 transitions.
Stuttering acceptance computed with spot in 414 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s9 1), p1:(OR (EQ s26 0) (EQ s5 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][true, true, true, true]]
Product exploration explored 100000 steps with 26 reset in 310 ms.
Stuttering criterion allowed to conclude after 138 steps with 32 reset in 2 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-03 finished in 1033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 284/284 transitions.
Graph (trivial) has 246 edges and 243 vertex of which 34 / 243 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 150 place count 214 transition count 102
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 153 rules applied. Total rules applied 303 place count 65 transition count 98
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 306 place count 63 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 307 place count 62 transition count 97
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 307 place count 62 transition count 90
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 321 place count 55 transition count 90
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 328 place count 48 transition count 82
Iterating global reduction 4 with 7 rules applied. Total rules applied 335 place count 48 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 335 place count 48 transition count 81
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 337 place count 47 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 339 place count 45 transition count 75
Iterating global reduction 4 with 2 rules applied. Total rules applied 341 place count 45 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 342 place count 45 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 343 place count 44 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 344 place count 44 transition count 73
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 364 place count 34 transition count 63
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 371 place count 27 transition count 49
Iterating global reduction 5 with 7 rules applied. Total rules applied 378 place count 27 transition count 49
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 381 place count 27 transition count 46
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 382 place count 26 transition count 44
Iterating global reduction 6 with 1 rules applied. Total rules applied 383 place count 26 transition count 44
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 389 place count 23 transition count 45
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 391 place count 23 transition count 43
Applied a total of 391 rules in 34 ms. Remains 23 /243 variables (removed 220) and now considering 43/284 (removed 241) transitions.
[2023-03-21 14:28:08] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
// Phase 1: matrix 40 rows 23 cols
[2023-03-21 14:28:08] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 14:28:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-21 14:28:08] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2023-03-21 14:28:08] [INFO ] Invariant cache hit.
[2023-03-21 14:28:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 14:28:09] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-21 14:28:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 14:28:09] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2023-03-21 14:28:09] [INFO ] Invariant cache hit.
[2023-03-21 14:28:09] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/243 places, 43/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 23/243 places, 43/284 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 37 reset in 159 ms.
Product exploration explored 100000 steps with 6 reset in 152 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 8 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-21 14:28:09] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2023-03-21 14:28:09] [INFO ] Invariant cache hit.
[2023-03-21 14:28:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-21 14:28:09] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2023-03-21 14:28:09] [INFO ] Invariant cache hit.
[2023-03-21 14:28:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 14:28:09] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-21 14:28:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 14:28:09] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2023-03-21 14:28:09] [INFO ] Invariant cache hit.
[2023-03-21 14:28:09] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 23/23 places, 43/43 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 16 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 53 reset in 101 ms.
Product exploration explored 100000 steps with 4 reset in 401 ms.
Built C files in :
/tmp/ltsmin9501146404266870580
[2023-03-21 14:28:11] [INFO ] Computing symmetric may disable matrix : 43 transitions.
[2023-03-21 14:28:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 14:28:11] [INFO ] Computing symmetric may enable matrix : 43 transitions.
[2023-03-21 14:28:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 14:28:11] [INFO ] Computing Do-Not-Accords matrix : 43 transitions.
[2023-03-21 14:28:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 14:28:11] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9501146404266870580
Running compilation step : cd /tmp/ltsmin9501146404266870580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 454 ms.
Running link step : cd /tmp/ltsmin9501146404266870580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin9501146404266870580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7489078704048677005.hoa' '--buchi-type=spotba'
LTSmin run took 130 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-02b-LTLCardinality-04 finished in 2897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((G(!p1) U !p2)))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 284/284 transitions.
Graph (trivial) has 239 edges and 243 vertex of which 34 / 243 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 214 transition count 109
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 146 rules applied. Total rules applied 289 place count 72 transition count 105
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 294 place count 70 transition count 102
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 297 place count 67 transition count 102
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 297 place count 67 transition count 95
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 311 place count 60 transition count 95
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 317 place count 54 transition count 88
Iterating global reduction 4 with 6 rules applied. Total rules applied 323 place count 54 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 323 place count 54 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 53 transition count 87
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 327 place count 51 transition count 81
Iterating global reduction 4 with 2 rules applied. Total rules applied 329 place count 51 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 330 place count 51 transition count 80
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 331 place count 50 transition count 79
Iterating global reduction 5 with 1 rules applied. Total rules applied 332 place count 50 transition count 79
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 354 place count 39 transition count 68
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 360 place count 33 transition count 56
Iterating global reduction 5 with 6 rules applied. Total rules applied 366 place count 33 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 368 place count 33 transition count 54
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 369 place count 32 transition count 52
Iterating global reduction 6 with 1 rules applied. Total rules applied 370 place count 32 transition count 52
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 372 place count 32 transition count 50
Applied a total of 372 rules in 33 ms. Remains 32 /243 variables (removed 211) and now considering 50/284 (removed 234) transitions.
[2023-03-21 14:28:11] [INFO ] Flow matrix only has 47 transitions (discarded 3 similar events)
// Phase 1: matrix 47 rows 32 cols
[2023-03-21 14:28:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 14:28:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-21 14:28:11] [INFO ] Flow matrix only has 47 transitions (discarded 3 similar events)
[2023-03-21 14:28:11] [INFO ] Invariant cache hit.
[2023-03-21 14:28:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 14:28:11] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-21 14:28:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 14:28:11] [INFO ] Flow matrix only has 47 transitions (discarded 3 similar events)
[2023-03-21 14:28:11] [INFO ] Invariant cache hit.
[2023-03-21 14:28:11] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/243 places, 50/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 32/243 places, 50/284 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) p2), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), p2, (AND p1 p2)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND p2 p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=0 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND p2 p1), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) p1) (AND p2 p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p1))), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p1), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p2 p1), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s14 1), p2:(OR (EQ s5 0) (EQ s27 1)), p1:(OR (EQ s10 0) (EQ s18 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-05 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G((p1 U p2)))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 284/284 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 235 transition count 276
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 235 transition count 276
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 231 transition count 272
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 229 transition count 270
Applied a total of 28 rules in 29 ms. Remains 229 /243 variables (removed 14) and now considering 270/284 (removed 14) transitions.
// Phase 1: matrix 270 rows 229 cols
[2023-03-21 14:28:12] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-21 14:28:12] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-21 14:28:12] [INFO ] Invariant cache hit.
[2023-03-21 14:28:12] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-21 14:28:12] [INFO ] Invariant cache hit.
[2023-03-21 14:28:13] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/243 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 710 ms. Remains : 229/243 places, 270/284 transitions.
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (OR (EQ s79 0) (EQ s205 1)) (OR (EQ s4 0) (EQ s31 1))), p1:(OR (EQ s4 0) (EQ s31 1)), p0:(AND (EQ s31 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25084 reset in 481 ms.
Product exploration explored 100000 steps with 25005 reset in 396 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 803 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), true, (NOT p2), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 102 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 14:28:16] [INFO ] Invariant cache hit.
[2023-03-21 14:28:16] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-21 14:28:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-21 14:28:16] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p0)), (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (G (OR p0 p1 p2)), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (OR (AND p0 p1) (AND p0 p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 15 factoid took 1001 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 270/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-21 14:28:17] [INFO ] Invariant cache hit.
[2023-03-21 14:28:17] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-21 14:28:17] [INFO ] Invariant cache hit.
[2023-03-21 14:28:18] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-21 14:28:18] [INFO ] Invariant cache hit.
[2023-03-21 14:28:18] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 229/229 places, 270/270 transitions.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 558 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Finished random walk after 5416 steps, including 123 resets, run visited all 5 properties in 137 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F p0), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 638 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33194 reset in 357 ms.
Product exploration explored 100000 steps with 33122 reset in 386 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 270/270 transitions.
Graph (trivial) has 227 edges and 229 vertex of which 34 / 229 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 201 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 135 place count 201 transition count 236
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 135 place count 201 transition count 238
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 201 transition count 238
Discarding 111 places :
Symmetric choice reduction at 2 with 111 rule applications. Total rules 250 place count 90 transition count 127
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 2 with 111 rules applied. Total rules applied 361 place count 90 transition count 127
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 378 place count 90 transition count 127
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 401 place count 67 transition count 94
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 424 place count 67 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 427 place count 67 transition count 91
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 433 place count 61 transition count 84
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 439 place count 61 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 440 place count 60 transition count 83
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 441 place count 60 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 442 place count 60 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 443 place count 59 transition count 82
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 444 place count 59 transition count 82
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 449 place count 59 transition count 97
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 453 place count 55 transition count 89
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 457 place count 55 transition count 89
Deduced a syphon composed of 24 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 463 place count 55 transition count 83
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 463 rules in 68 ms. Remains 55 /229 variables (removed 174) and now considering 83/270 (removed 187) transitions.
[2023-03-21 14:28:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 14:28:22] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 55 cols
[2023-03-21 14:28:22] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-21 14:28:22] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/229 places, 83/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 55/229 places, 83/270 transitions.
Built C files in :
/tmp/ltsmin4759132756781074353
[2023-03-21 14:28:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4759132756781074353
Running compilation step : cd /tmp/ltsmin4759132756781074353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 702 ms.
Running link step : cd /tmp/ltsmin4759132756781074353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4759132756781074353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11455872891267632732.hoa' '--buchi-type=spotba'
LTSmin run took 271 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-02b-LTLCardinality-06 finished in 10927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 284/284 transitions.
Graph (trivial) has 244 edges and 243 vertex of which 27 / 243 are part of one of the 5 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 152 place count 220 transition count 107
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 158 rules applied. Total rules applied 310 place count 69 transition count 100
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 314 place count 65 transition count 100
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 314 place count 65 transition count 92
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 330 place count 57 transition count 92
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 335 place count 52 transition count 87
Iterating global reduction 3 with 5 rules applied. Total rules applied 340 place count 52 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 341 place count 51 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 342 place count 51 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 343 place count 51 transition count 82
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 4 with 24 rules applied. Total rules applied 367 place count 39 transition count 70
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 374 place count 32 transition count 56
Iterating global reduction 4 with 7 rules applied. Total rules applied 381 place count 32 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 385 place count 32 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 386 place count 31 transition count 50
Iterating global reduction 5 with 1 rules applied. Total rules applied 387 place count 31 transition count 50
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 395 place count 27 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 396 place count 27 transition count 50
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 398 place count 27 transition count 48
Applied a total of 398 rules in 30 ms. Remains 27 /243 variables (removed 216) and now considering 48/284 (removed 236) transitions.
[2023-03-21 14:28:23] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 27 cols
[2023-03-21 14:28:23] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 14:28:23] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-21 14:28:23] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
[2023-03-21 14:28:23] [INFO ] Invariant cache hit.
[2023-03-21 14:28:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-21 14:28:23] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-21 14:28:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 14:28:23] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
[2023-03-21 14:28:23] [INFO ] Invariant cache hit.
[2023-03-21 14:28:23] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/243 places, 48/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 27/243 places, 48/284 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s17 0) (NEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-07 finished in 321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&F((p1||G(p2))))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 234 transition count 275
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 234 transition count 275
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 230 transition count 271
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 228 transition count 269
Applied a total of 30 rules in 39 ms. Remains 228 /243 variables (removed 15) and now considering 269/284 (removed 15) transitions.
// Phase 1: matrix 269 rows 228 cols
[2023-03-21 14:28:23] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-21 14:28:23] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-21 14:28:23] [INFO ] Invariant cache hit.
[2023-03-21 14:28:24] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-21 14:28:24] [INFO ] Invariant cache hit.
[2023-03-21 14:28:24] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/243 places, 269/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 228/243 places, 269/284 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s202 0), p0:(EQ s202 1), p2:(EQ s57 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-08 finished in 947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||((p1&&F(p2)) U p2)) U X(p1)))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 284/284 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 235 transition count 276
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 235 transition count 276
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 231 transition count 272
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 229 transition count 270
Applied a total of 28 rules in 26 ms. Remains 229 /243 variables (removed 14) and now considering 270/284 (removed 14) transitions.
// Phase 1: matrix 270 rows 229 cols
[2023-03-21 14:28:24] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-21 14:28:24] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-21 14:28:24] [INFO ] Invariant cache hit.
[2023-03-21 14:28:24] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-21 14:28:24] [INFO ] Invariant cache hit.
[2023-03-21 14:28:25] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/243 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 682 ms. Remains : 229/243 places, 270/284 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p2 p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s189 1), p2:(OR (EQ s64 0) (EQ s148 1)), p1:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-11 finished in 971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 234 transition count 275
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 234 transition count 275
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 230 transition count 271
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 228 transition count 269
Applied a total of 30 rules in 24 ms. Remains 228 /243 variables (removed 15) and now considering 269/284 (removed 15) transitions.
// Phase 1: matrix 269 rows 228 cols
[2023-03-21 14:28:25] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-21 14:28:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-21 14:28:25] [INFO ] Invariant cache hit.
[2023-03-21 14:28:25] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-21 14:28:25] [INFO ] Invariant cache hit.
[2023-03-21 14:28:26] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/243 places, 269/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 228/243 places, 269/284 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-13 finished in 758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 284/284 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 236 transition count 277
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 236 transition count 277
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 234 transition count 275
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 234 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 233 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 233 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 232 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 232 transition count 273
Applied a total of 22 rules in 24 ms. Remains 232 /243 variables (removed 11) and now considering 273/284 (removed 11) transitions.
// Phase 1: matrix 273 rows 232 cols
[2023-03-21 14:28:26] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-21 14:28:26] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-21 14:28:26] [INFO ] Invariant cache hit.
[2023-03-21 14:28:26] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2023-03-21 14:28:26] [INFO ] Invariant cache hit.
[2023-03-21 14:28:26] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/243 places, 273/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 677 ms. Remains : 232/243 places, 273/284 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s224 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28 reset in 117 ms.
Entered a terminal (fully accepting) state of product in 251 steps with 5 reset in 2 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-14 finished in 929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 284/284 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 235 transition count 276
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 235 transition count 276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 232 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 232 transition count 273
Applied a total of 22 rules in 15 ms. Remains 232 /243 variables (removed 11) and now considering 273/284 (removed 11) transitions.
// Phase 1: matrix 273 rows 232 cols
[2023-03-21 14:28:27] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-21 14:28:27] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-21 14:28:27] [INFO ] Invariant cache hit.
[2023-03-21 14:28:27] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-21 14:28:27] [INFO ] Invariant cache hit.
[2023-03-21 14:28:27] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/243 places, 273/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 779 ms. Remains : 232/243 places, 273/284 transitions.
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (EQ s143 0) (EQ s83 1)), p0:(OR (EQ s73 0) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32 reset in 182 ms.
Product exploration explored 100000 steps with 13 reset in 477 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 378 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Finished Best-First random walk after 2822 steps, including 20 resets, run visited all 3 properties in 4 ms. (steps per millisecond=705 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 560 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 273/273 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2023-03-21 14:28:30] [INFO ] Invariant cache hit.
[2023-03-21 14:28:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-21 14:28:30] [INFO ] Invariant cache hit.
[2023-03-21 14:28:30] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-21 14:28:30] [INFO ] Invariant cache hit.
[2023-03-21 14:28:31] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 566 ms. Remains : 232/232 places, 273/273 transitions.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 188 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 14:28:31] [INFO ] Invariant cache hit.
[2023-03-21 14:28:31] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 14:28:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-21 14:28:32] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 14:28:32] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-21 14:28:32] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 451 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Entered a terminal (fully accepting) state of product in 1652 steps with 38 reset in 5 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-15 finished in 6051 ms.
All properties solved by simple procedures.
Total runtime 29898 ms.
BK_STOP 1679408914466
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-02b"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-02b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645600563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-02b.tgz
mv StigmergyElection-PT-02b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;