Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K Feb 26 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:28 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 117K 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-03b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679542878292

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 03:41:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 03:41:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 03:41:21] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-23 03:41:21] [INFO ] Transformed 427 places.
[2023-03-23 03:41:21] [INFO ] Transformed 518 transitions.
[2023-03-23 03:41:21] [INFO ] Found NUPN structural information;
[2023-03-23 03:41:21] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA StigmergyElection-PT-03b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 378 transition count 469
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 378 transition count 469
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 121 place count 355 transition count 446
Iterating global reduction 0 with 23 rules applied. Total rules applied 144 place count 355 transition count 446
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 150 place count 349 transition count 440
Iterating global reduction 0 with 6 rules applied. Total rules applied 156 place count 349 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 347 transition count 438
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 347 transition count 438
Applied a total of 160 rules in 139 ms. Remains 347 /427 variables (removed 80) and now considering 438/518 (removed 80) transitions.
// Phase 1: matrix 438 rows 347 cols
[2023-03-23 03:41:21] [INFO ] Computed 4 place invariants in 30 ms
[2023-03-23 03:41:22] [INFO ] Implicit Places using invariants in 626 ms returned []
[2023-03-23 03:41:22] [INFO ] Invariant cache hit.
[2023-03-23 03:41:22] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2023-03-23 03:41:22] [INFO ] Invariant cache hit.
[2023-03-23 03:41:23] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/427 places, 438/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1728 ms. Remains : 347/427 places, 438/518 transitions.
Support contains 27 out of 347 places after structural reductions.
[2023-03-23 03:41:23] [INFO ] Flatten gal took : 109 ms
[2023-03-23 03:41:23] [INFO ] Flatten gal took : 36 ms
[2023-03-23 03:41:23] [INFO ] Input system was already deterministic with 438 transitions.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 20) seen :12
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-23 03:41:24] [INFO ] Invariant cache hit.
[2023-03-23 03:41:24] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-23 03:41:25] [INFO ] After 271ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-23 03:41:25] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 9 ms to minimize.
[2023-03-23 03:41:25] [INFO ] Deduced a trap composed of 165 places in 193 ms of which 1 ms to minimize.
[2023-03-23 03:41:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 491 ms
[2023-03-23 03:41:25] [INFO ] After 906ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 03:41:25] [INFO ] After 1096ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 03:41:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-23 03:41:26] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 03:41:26] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 2 ms to minimize.
[2023-03-23 03:41:26] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 0 ms to minimize.
[2023-03-23 03:41:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 397 ms
[2023-03-23 03:41:26] [INFO ] After 743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-23 03:41:26] [INFO ] After 957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 12 ms.
Support contains 1 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 438/438 transitions.
Graph (trivial) has 353 edges and 347 vertex of which 55 / 347 are part of one of the 9 SCC in 5 ms
Free SCC test removed 46 places
Drop transitions removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Graph (complete) has 507 edges and 301 vertex of which 298 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 213 rules applied. Total rules applied 215 place count 298 transition count 164
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 216 rules applied. Total rules applied 431 place count 88 transition count 158
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 435 place count 85 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 436 place count 84 transition count 157
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 436 place count 84 transition count 144
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 462 place count 71 transition count 144
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 466 place count 67 transition count 139
Iterating global reduction 4 with 4 rules applied. Total rules applied 470 place count 67 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 470 place count 67 transition count 137
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 474 place count 65 transition count 137
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 475 place count 65 transition count 136
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 477 place count 63 transition count 133
Iterating global reduction 5 with 2 rules applied. Total rules applied 479 place count 63 transition count 133
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 509 place count 48 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 514 place count 48 transition count 113
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 526 place count 36 transition count 65
Iterating global reduction 6 with 12 rules applied. Total rules applied 538 place count 36 transition count 65
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 545 place count 36 transition count 58
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 547 place count 34 transition count 56
Iterating global reduction 7 with 2 rules applied. Total rules applied 549 place count 34 transition count 56
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 555 place count 31 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 559 place count 29 transition count 55
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 563 place count 29 transition count 51
Free-agglomeration rule applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 579 place count 29 transition count 35
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 604 place count 13 transition count 26
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 607 place count 10 transition count 23
Iterating global reduction 8 with 3 rules applied. Total rules applied 610 place count 10 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 613 place count 10 transition count 20
Applied a total of 613 rules in 79 ms. Remains 10 /347 variables (removed 337) and now considering 20/438 (removed 418) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 10/347 places, 20/438 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
FORMULA StigmergyElection-PT-03b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 50 stabilizing places and 53 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' '!((X(p0)||(G(p1) U p2)))'
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 438/438 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 340 transition count 431
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 337 transition count 428
Applied a total of 20 rules in 43 ms. Remains 337 /347 variables (removed 10) and now considering 428/438 (removed 10) transitions.
// Phase 1: matrix 428 rows 337 cols
[2023-03-23 03:41:27] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-23 03:41:29] [INFO ] Implicit Places using invariants in 1893 ms returned []
[2023-03-23 03:41:29] [INFO ] Invariant cache hit.
[2023-03-23 03:41:29] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 2237 ms to find 0 implicit places.
[2023-03-23 03:41:29] [INFO ] Invariant cache hit.
[2023-03-23 03:41:30] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/347 places, 428/438 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2667 ms. Remains : 337/347 places, 428/438 transitions.
Stuttering acceptance computed with spot in 445 ms :[(NOT p1), true, (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=5 dest: 0}, { cond=(NOT p1), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s267 1), p2:(EQ s52 1), p0:(EQ s224 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 578 ms.
Product exploration explored 100000 steps with 50000 reset in 476 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 169 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-03b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03b-LTLFireability-00 finished in 4436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(F(p1)))))))'
Support contains 1 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 438/438 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 339 transition count 430
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 339 transition count 430
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 335 transition count 426
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 335 transition count 426
Applied a total of 24 rules in 26 ms. Remains 335 /347 variables (removed 12) and now considering 426/438 (removed 12) transitions.
// Phase 1: matrix 426 rows 335 cols
[2023-03-23 03:41:31] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-23 03:41:31] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-23 03:41:31] [INFO ] Invariant cache hit.
[2023-03-23 03:41:32] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-23 03:41:32] [INFO ] Invariant cache hit.
[2023-03-23 03:41:32] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/347 places, 426/438 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 789 ms. Remains : 335/347 places, 426/438 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s169 1), p1:(EQ s169 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1752 reset in 270 ms.
Product exploration explored 100000 steps with 55 reset in 152 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 169 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 03:41:33] [INFO ] Invariant cache hit.
[2023-03-23 03:41:33] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 03:41:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-23 03:41:33] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 1 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 426/426 transitions.
Applied a total of 0 rules in 7 ms. Remains 335 /335 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2023-03-23 03:41:34] [INFO ] Invariant cache hit.
[2023-03-23 03:41:34] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-23 03:41:34] [INFO ] Invariant cache hit.
[2023-03-23 03:41:35] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2023-03-23 03:41:35] [INFO ] Invariant cache hit.
[2023-03-23 03:41:35] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 997 ms. Remains : 335/335 places, 426/426 transitions.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 246 steps, including 3 resets, run visited all 2 properties in 4 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1441 reset in 95 ms.
Product exploration explored 100000 steps with 1745 reset in 121 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 1 out of 335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 335/335 places, 426/426 transitions.
Graph (trivial) has 341 edges and 335 vertex of which 51 / 335 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 293 transition count 378
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 203 place count 293 transition count 375
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 203 place count 293 transition count 378
Deduced a syphon composed of 205 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 293 transition count 378
Discarding 168 places :
Symmetric choice reduction at 2 with 168 rule applications. Total rules 377 place count 125 transition count 210
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 168 rules applied. Total rules applied 545 place count 125 transition count 210
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 570 place count 125 transition count 210
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 605 place count 90 transition count 135
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 640 place count 90 transition count 135
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 647 place count 90 transition count 128
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 660 place count 77 transition count 112
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 673 place count 77 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 676 place count 74 transition count 109
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 679 place count 74 transition count 109
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 688 place count 74 transition count 154
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 697 place count 65 transition count 136
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 706 place count 65 transition count 136
Deduced a syphon composed of 32 places in 0 ms
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 716 place count 65 transition count 126
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 716 rules in 83 ms. Remains 65 /335 variables (removed 270) and now considering 126/426 (removed 300) transitions.
[2023-03-23 03:41:37] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-23 03:41:37] [INFO ] Flow matrix only has 122 transitions (discarded 4 similar events)
// Phase 1: matrix 122 rows 65 cols
[2023-03-23 03:41:37] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-23 03:41:37] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/335 places, 126/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 65/335 places, 126/426 transitions.
Support contains 1 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 426/426 transitions.
Applied a total of 0 rules in 11 ms. Remains 335 /335 variables (removed 0) and now considering 426/426 (removed 0) transitions.
// Phase 1: matrix 426 rows 335 cols
[2023-03-23 03:41:37] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-23 03:41:37] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-23 03:41:37] [INFO ] Invariant cache hit.
[2023-03-23 03:41:38] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-23 03:41:38] [INFO ] Invariant cache hit.
[2023-03-23 03:41:38] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 768 ms. Remains : 335/335 places, 426/426 transitions.
Treatment of property StigmergyElection-PT-03b-LTLFireability-01 finished in 6940 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) U X(X(X(p1)))))'
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 438/438 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 339 transition count 430
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 339 transition count 430
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 335 transition count 426
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 335 transition count 426
Applied a total of 24 rules in 37 ms. Remains 335 /347 variables (removed 12) and now considering 426/438 (removed 12) transitions.
[2023-03-23 03:41:38] [INFO ] Invariant cache hit.
[2023-03-23 03:41:38] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-23 03:41:38] [INFO ] Invariant cache hit.
[2023-03-23 03:41:39] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-23 03:41:39] [INFO ] Invariant cache hit.
[2023-03-23 03:41:39] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/347 places, 426/438 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 776 ms. Remains : 335/347 places, 426/438 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(NEQ s207 1), p1:(NEQ s198 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, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 255 ms.
Product exploration explored 100000 steps with 25000 reset in 268 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Detected a total of 45/335 stabilizing places and 48/426 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 166 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 03:41:40] [INFO ] Invariant cache hit.
[2023-03-23 03:41:41] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-23 03:41:41] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 03:41:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-23 03:41:41] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-23 03:41:41] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 1 ms to minimize.
[2023-03-23 03:41:41] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 1 ms to minimize.
[2023-03-23 03:41:41] [INFO ] Deduced a trap composed of 165 places in 157 ms of which 1 ms to minimize.
[2023-03-23 03:41:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 524 ms
[2023-03-23 03:41:41] [INFO ] After 718ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-23 03:41:41] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 547 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 426/426 transitions.
Applied a total of 0 rules in 5 ms. Remains 335 /335 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2023-03-23 03:41:43] [INFO ] Invariant cache hit.
[2023-03-23 03:41:43] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-23 03:41:43] [INFO ] Invariant cache hit.
[2023-03-23 03:41:43] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-03-23 03:41:43] [INFO ] Invariant cache hit.
[2023-03-23 03:41:44] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1129 ms. Remains : 335/335 places, 426/426 transitions.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Detected a total of 45/335 stabilizing places and 48/426 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 171 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 03:41:44] [INFO ] Invariant cache hit.
[2023-03-23 03:41:44] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-23 03:41:45] [INFO ] After 288ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 03:41:45] [INFO ] Deduced a trap composed of 165 places in 269 ms of which 1 ms to minimize.
[2023-03-23 03:41:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-23 03:41:45] [INFO ] After 629ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 03:41:45] [INFO ] After 819ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 03:41:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-23 03:41:45] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 03:41:46] [INFO ] Deduced a trap composed of 168 places in 162 ms of which 1 ms to minimize.
[2023-03-23 03:41:46] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 1 ms to minimize.
[2023-03-23 03:41:46] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2023-03-23 03:41:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 521 ms
[2023-03-23 03:41:46] [INFO ] After 817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-23 03:41:46] [INFO ] After 1015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 243 ms.
Product exploration explored 100000 steps with 25000 reset in 252 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 335/335 places, 426/426 transitions.
Graph (trivial) has 339 edges and 335 vertex of which 51 / 335 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 293 transition count 378
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 203 place count 293 transition count 375
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 203 place count 293 transition count 378
Deduced a syphon composed of 205 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 293 transition count 378
Discarding 169 places :
Symmetric choice reduction at 2 with 169 rule applications. Total rules 378 place count 124 transition count 209
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 169 rules applied. Total rules applied 547 place count 124 transition count 209
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 572 place count 124 transition count 209
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 607 place count 89 transition count 134
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 642 place count 89 transition count 134
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 649 place count 89 transition count 127
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 662 place count 76 transition count 111
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 675 place count 76 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 678 place count 73 transition count 108
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 681 place count 73 transition count 108
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 688 place count 73 transition count 133
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 696 place count 65 transition count 117
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 704 place count 65 transition count 117
Deduced a syphon composed of 30 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 712 place count 65 transition count 109
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 712 rules in 46 ms. Remains 65 /335 variables (removed 270) and now considering 109/426 (removed 317) transitions.
[2023-03-23 03:41:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-23 03:41:48] [INFO ] Flow matrix only has 105 transitions (discarded 4 similar events)
// Phase 1: matrix 105 rows 65 cols
[2023-03-23 03:41:48] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 03:41:48] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/335 places, 109/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 65/335 places, 109/426 transitions.
Support contains 2 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 426/426 transitions.
Applied a total of 0 rules in 5 ms. Remains 335 /335 variables (removed 0) and now considering 426/426 (removed 0) transitions.
// Phase 1: matrix 426 rows 335 cols
[2023-03-23 03:41:48] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-23 03:41:48] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-23 03:41:48] [INFO ] Invariant cache hit.
[2023-03-23 03:41:48] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-23 03:41:48] [INFO ] Invariant cache hit.
[2023-03-23 03:41:49] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 777 ms. Remains : 335/335 places, 426/426 transitions.
Treatment of property StigmergyElection-PT-03b-LTLFireability-04 finished in 10399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 438/438 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 340 transition count 431
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 337 transition count 428
Applied a total of 20 rules in 15 ms. Remains 337 /347 variables (removed 10) and now considering 428/438 (removed 10) transitions.
// Phase 1: matrix 428 rows 337 cols
[2023-03-23 03:41:49] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-23 03:41:49] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-23 03:41:49] [INFO ] Invariant cache hit.
[2023-03-23 03:41:49] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-23 03:41:49] [INFO ] Invariant cache hit.
[2023-03-23 03:41:49] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/347 places, 428/438 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 337/347 places, 428/438 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s258 1), p0:(AND (EQ s20 1) (EQ s148 1) (EQ s254 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-06 finished in 847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 438/438 transitions.
Graph (trivial) has 351 edges and 347 vertex of which 55 / 347 are part of one of the 9 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 300 transition count 182
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 209 rules applied. Total rules applied 413 place count 97 transition count 176
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 416 place count 94 transition count 176
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 416 place count 94 transition count 165
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 438 place count 83 transition count 165
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 444 place count 77 transition count 158
Iterating global reduction 3 with 6 rules applied. Total rules applied 450 place count 77 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 450 place count 77 transition count 156
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 454 place count 75 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 455 place count 74 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 456 place count 74 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 457 place count 73 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 458 place count 73 transition count 152
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 486 place count 59 transition count 138
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 496 place count 49 transition count 93
Iterating global reduction 3 with 10 rules applied. Total rules applied 506 place count 49 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 512 place count 49 transition count 87
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 514 place count 47 transition count 83
Iterating global reduction 4 with 2 rules applied. Total rules applied 516 place count 47 transition count 83
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 518 place count 45 transition count 81
Iterating global reduction 4 with 2 rules applied. Total rules applied 520 place count 45 transition count 81
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 526 place count 42 transition count 78
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 536 place count 37 transition count 93
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 539 place count 37 transition count 90
Applied a total of 539 rules in 43 ms. Remains 37 /347 variables (removed 310) and now considering 90/438 (removed 348) transitions.
[2023-03-23 03:41:49] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
// Phase 1: matrix 86 rows 37 cols
[2023-03-23 03:41:49] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 03:41:50] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-23 03:41:50] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2023-03-23 03:41:50] [INFO ] Invariant cache hit.
[2023-03-23 03:41:50] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 03:41:50] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-23 03:41:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 03:41:50] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2023-03-23 03:41:50] [INFO ] Invariant cache hit.
[2023-03-23 03:41:50] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/347 places, 90/438 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 37/347 places, 90/438 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s6 1) (NEQ s18 1) (NEQ s30 1)), p1:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-10 finished in 381 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 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 438/438 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 339 transition count 430
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 339 transition count 430
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 335 transition count 426
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 335 transition count 426
Applied a total of 24 rules in 16 ms. Remains 335 /347 variables (removed 12) and now considering 426/438 (removed 12) transitions.
// Phase 1: matrix 426 rows 335 cols
[2023-03-23 03:41:50] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 03:41:50] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-23 03:41:50] [INFO ] Invariant cache hit.
[2023-03-23 03:41:50] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-23 03:41:50] [INFO ] Invariant cache hit.
[2023-03-23 03:41:51] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 335/347 places, 426/438 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 755 ms. Remains : 335/347 places, 426/438 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-11 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 s54 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-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-11 finished in 847 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(F((p0&&(p1||F(p2)))))))'
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 438/438 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 341 transition count 432
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 341 transition count 432
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 338 transition count 429
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 338 transition count 429
Applied a total of 18 rules in 17 ms. Remains 338 /347 variables (removed 9) and now considering 429/438 (removed 9) transitions.
// Phase 1: matrix 429 rows 338 cols
[2023-03-23 03:41:51] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 03:41:51] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-23 03:41:51] [INFO ] Invariant cache hit.
[2023-03-23 03:41:51] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-03-23 03:41:51] [INFO ] Invariant cache hit.
[2023-03-23 03:41:51] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 338/347 places, 429/438 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 338/347 places, 429/438 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(OR (EQ s259 1) (EQ s202 1)), p1:(EQ s214 1), p2:(AND (EQ s94 1) (EQ s201 1) (EQ s309 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-12 finished in 978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 438/438 transitions.
Graph (trivial) has 351 edges and 347 vertex of which 55 / 347 are part of one of the 9 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 203 place count 300 transition count 183
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 208 rules applied. Total rules applied 411 place count 98 transition count 177
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 415 place count 95 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 416 place count 94 transition count 176
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 416 place count 94 transition count 165
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 438 place count 83 transition count 165
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 443 place count 78 transition count 159
Iterating global reduction 4 with 5 rules applied. Total rules applied 448 place count 78 transition count 159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 448 place count 78 transition count 158
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 450 place count 77 transition count 158
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 452 place count 75 transition count 155
Iterating global reduction 4 with 2 rules applied. Total rules applied 454 place count 75 transition count 155
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 455 place count 74 transition count 153
Iterating global reduction 4 with 1 rules applied. Total rules applied 456 place count 74 transition count 153
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 486 place count 59 transition count 138
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 498 place count 47 transition count 88
Iterating global reduction 4 with 12 rules applied. Total rules applied 510 place count 47 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 516 place count 47 transition count 82
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 518 place count 45 transition count 78
Iterating global reduction 5 with 2 rules applied. Total rules applied 520 place count 45 transition count 78
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 522 place count 43 transition count 76
Iterating global reduction 5 with 2 rules applied. Total rules applied 524 place count 43 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 530 place count 40 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 540 place count 35 transition count 88
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 543 place count 35 transition count 85
Applied a total of 543 rules in 34 ms. Remains 35 /347 variables (removed 312) and now considering 85/438 (removed 353) transitions.
[2023-03-23 03:41:52] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
// Phase 1: matrix 81 rows 35 cols
[2023-03-23 03:41:52] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 03:41:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-23 03:41:52] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2023-03-23 03:41:52] [INFO ] Invariant cache hit.
[2023-03-23 03:41:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-23 03:41:52] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-23 03:41:52] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 03:41:52] [INFO ] Flow matrix only has 81 transitions (discarded 4 similar events)
[2023-03-23 03:41:52] [INFO ] Invariant cache hit.
[2023-03-23 03:41:52] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/347 places, 85/438 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 35/347 places, 85/438 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s31 1), p1:(NEQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 47 reset in 120 ms.
Stuttering criterion allowed to conclude after 699 steps with 71 reset in 6 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-13 finished in 528 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 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 438/438 transitions.
Graph (trivial) has 353 edges and 347 vertex of which 55 / 347 are part of one of the 9 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 300 transition count 182
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 209 rules applied. Total rules applied 413 place count 97 transition count 176
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 417 place count 94 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 93 transition count 175
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 418 place count 93 transition count 164
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 440 place count 82 transition count 164
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 446 place count 76 transition count 157
Iterating global reduction 4 with 6 rules applied. Total rules applied 452 place count 76 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 452 place count 76 transition count 155
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 456 place count 74 transition count 155
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 458 place count 72 transition count 152
Iterating global reduction 4 with 2 rules applied. Total rules applied 460 place count 72 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 461 place count 71 transition count 150
Iterating global reduction 4 with 1 rules applied. Total rules applied 462 place count 71 transition count 150
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 490 place count 57 transition count 136
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 502 place count 45 transition count 86
Iterating global reduction 4 with 12 rules applied. Total rules applied 514 place count 45 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 520 place count 45 transition count 80
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 522 place count 43 transition count 76
Iterating global reduction 5 with 2 rules applied. Total rules applied 524 place count 43 transition count 76
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 526 place count 41 transition count 74
Iterating global reduction 5 with 2 rules applied. Total rules applied 528 place count 41 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 534 place count 38 transition count 71
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 544 place count 33 transition count 86
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 547 place count 33 transition count 83
Applied a total of 547 rules in 30 ms. Remains 33 /347 variables (removed 314) and now considering 83/438 (removed 355) transitions.
[2023-03-23 03:41:52] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
// Phase 1: matrix 79 rows 33 cols
[2023-03-23 03:41:52] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 03:41:52] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-23 03:41:52] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2023-03-23 03:41:52] [INFO ] Invariant cache hit.
[2023-03-23 03:41:52] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 03:41:52] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-23 03:41:52] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 03:41:52] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2023-03-23 03:41:52] [INFO ] Invariant cache hit.
[2023-03-23 03:41:52] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/347 places, 83/438 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 33/347 places, 83/438 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-14 finished in 261 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 3 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 438/438 transitions.
Graph (trivial) has 349 edges and 347 vertex of which 48 / 347 are part of one of the 8 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 205 place count 306 transition count 188
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 213 rules applied. Total rules applied 418 place count 102 transition count 179
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 424 place count 97 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 425 place count 96 transition count 178
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 425 place count 96 transition count 166
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 449 place count 84 transition count 166
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 454 place count 79 transition count 161
Iterating global reduction 4 with 5 rules applied. Total rules applied 459 place count 79 transition count 161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 459 place count 79 transition count 159
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 463 place count 77 transition count 159
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 464 place count 76 transition count 158
Iterating global reduction 4 with 1 rules applied. Total rules applied 465 place count 76 transition count 158
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 493 place count 62 transition count 144
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 504 place count 51 transition count 95
Iterating global reduction 4 with 11 rules applied. Total rules applied 515 place count 51 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 521 place count 51 transition count 89
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 522 place count 50 transition count 87
Iterating global reduction 5 with 1 rules applied. Total rules applied 523 place count 50 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 524 place count 49 transition count 86
Iterating global reduction 5 with 1 rules applied. Total rules applied 525 place count 49 transition count 86
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 535 place count 44 transition count 81
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 547 place count 38 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 548 place count 38 transition count 95
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 551 place count 38 transition count 92
Applied a total of 551 rules in 29 ms. Remains 38 /347 variables (removed 309) and now considering 92/438 (removed 346) transitions.
[2023-03-23 03:41:52] [INFO ] Flow matrix only has 87 transitions (discarded 5 similar events)
// Phase 1: matrix 87 rows 38 cols
[2023-03-23 03:41:52] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 03:41:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-23 03:41:52] [INFO ] Flow matrix only has 87 transitions (discarded 5 similar events)
[2023-03-23 03:41:52] [INFO ] Invariant cache hit.
[2023-03-23 03:41:53] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 03:41:53] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-23 03:41:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 03:41:53] [INFO ] Flow matrix only has 87 transitions (discarded 5 similar events)
[2023-03-23 03:41:53] [INFO ] Invariant cache hit.
[2023-03-23 03:41:53] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/347 places, 92/438 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 38/347 places, 92/438 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s18 1) (EQ s29 1) (NEQ s6 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 34 reset in 78 ms.
Product exploration explored 100000 steps with 8 reset in 124 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 112 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 33 ms :[(NOT p0)]
Finished random walk after 23 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
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 129 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-23 03:41:53] [INFO ] Flow matrix only has 87 transitions (discarded 5 similar events)
[2023-03-23 03:41:53] [INFO ] Invariant cache hit.
[2023-03-23 03:41:53] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-23 03:41:53] [INFO ] Flow matrix only has 87 transitions (discarded 5 similar events)
[2023-03-23 03:41:53] [INFO ] Invariant cache hit.
[2023-03-23 03:41:53] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 03:41:53] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-23 03:41:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 03:41:53] [INFO ] Flow matrix only has 87 transitions (discarded 5 similar events)
[2023-03-23 03:41:53] [INFO ] Invariant cache hit.
[2023-03-23 03:41:53] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 38/38 places, 92/92 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 109 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)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
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 130 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40 reset in 78 ms.
Product exploration explored 100000 steps with 80 reset in 78 ms.
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2023-03-23 03:41:54] [INFO ] Flow matrix only has 87 transitions (discarded 5 similar events)
[2023-03-23 03:41:54] [INFO ] Invariant cache hit.
[2023-03-23 03:41:54] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-23 03:41:54] [INFO ] Flow matrix only has 87 transitions (discarded 5 similar events)
[2023-03-23 03:41:54] [INFO ] Invariant cache hit.
[2023-03-23 03:41:54] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 03:41:54] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-23 03:41:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 03:41:54] [INFO ] Flow matrix only has 87 transitions (discarded 5 similar events)
[2023-03-23 03:41:54] [INFO ] Invariant cache hit.
[2023-03-23 03:41:54] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 38/38 places, 92/92 transitions.
Treatment of property StigmergyElection-PT-03b-LTLFireability-15 finished in 1844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(F(p1)))))))'
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) U X(X(X(p1)))))'
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)))'
[2023-03-23 03:41:55] [INFO ] Flatten gal took : 27 ms
[2023-03-23 03:41:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-23 03:41:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 347 places, 438 transitions and 1163 arcs took 6 ms.
Total runtime 34008 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1499/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1499/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1499/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : StigmergyElection-PT-03b-LTLFireability-01
Could not compute solution for formula : StigmergyElection-PT-03b-LTLFireability-04
Could not compute solution for formula : StigmergyElection-PT-03b-LTLFireability-15

BK_STOP 1679542916898

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name StigmergyElection-PT-03b-LTLFireability-04
ltl formula formula --ltl=/tmp/1499/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 347 places, 438 transitions and 1163 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1499/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1499/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1499/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1499/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name StigmergyElection-PT-03b-LTLFireability-15
ltl formula formula --ltl=/tmp/1499/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 347 places, 438 transitions and 1163 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1499/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1499/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1499/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1499/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03b.tgz
mv StigmergyElection-PT-03b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;