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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 125M
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 16:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 16:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 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 124M 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-10b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679593660179

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-10b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 17:47:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 17:47:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 17:47:49] [INFO ] Load time of PNML (sax parser for PT used): 5806 ms
[2023-03-23 17:47:49] [INFO ] Transformed 1379 places.
[2023-03-23 17:47:50] [INFO ] Transformed 120600 transitions.
[2023-03-23 17:47:50] [INFO ] Found NUPN structural information;
[2023-03-23 17:47:50] [INFO ] Parsed PT model containing 1379 places and 120600 transitions and 2385526 arcs in 6981 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA StigmergyElection-PT-10b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 120600/120600 transitions.
Discarding 173 places :
Symmetric choice reduction at 0 with 173 rule applications. Total rules 173 place count 1206 transition count 120427
Iterating global reduction 0 with 173 rules applied. Total rules applied 346 place count 1206 transition count 120427
Discarding 92 places :
Symmetric choice reduction at 0 with 92 rule applications. Total rules 438 place count 1114 transition count 120335
Iterating global reduction 0 with 92 rules applied. Total rules applied 530 place count 1114 transition count 120335
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 550 place count 1094 transition count 120315
Iterating global reduction 0 with 20 rules applied. Total rules applied 570 place count 1094 transition count 120315
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 580 place count 1084 transition count 120305
Iterating global reduction 0 with 10 rules applied. Total rules applied 590 place count 1084 transition count 120305
Applied a total of 590 rules in 4723 ms. Remains 1084 /1379 variables (removed 295) and now considering 120305/120600 (removed 295) transitions.
// Phase 1: matrix 120305 rows 1084 cols
[2023-03-23 17:48:00] [INFO ] Computed 11 place invariants in 4472 ms
[2023-03-23 17:48:01] [INFO ] Implicit Places using invariants in 5635 ms returned []
Implicit Place search using SMT only with invariants took 5689 ms to find 0 implicit places.
[2023-03-23 17:48:02] [INFO ] Invariant cache hit.
[2023-03-23 17:48:32] [INFO ] Performed 34955/120305 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 17:49:02] [INFO ] Dead Transitions using invariants and state equation in 60192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1084/1379 places, 120305/120600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70625 ms. Remains : 1084/1379 places, 120305/120600 transitions.
Support contains 60 out of 1084 places after structural reductions.
[2023-03-23 17:49:20] [INFO ] Flatten gal took : 16318 ms
[2023-03-23 17:49:35] [INFO ] Flatten gal took : 14547 ms
[2023-03-23 17:49:59] [INFO ] Input system was already deterministic with 120305 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1326 ms. (steps per millisecond=7 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Interrupted probabilistic random walk after 5984 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5984 steps, saw 4293 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 34 properties.
[2023-03-23 17:50:06] [INFO ] Invariant cache hit.
[2023-03-23 17:50:07] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2023-03-23 17:50:31] [INFO ] After 23473ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:31
[2023-03-23 17:50:31] [INFO ] After 23676ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:31
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-23 17:50:31] [INFO ] After 25262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:31
[2023-03-23 17:50:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2023-03-23 17:50:56] [INFO ] After 23272ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :32
[2023-03-23 17:50:56] [INFO ] After 23272ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :32
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-23 17:50:56] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :32
Fused 34 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 60 out of 1084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Graph (trivial) has 1053 edges and 1084 vertex of which 170 / 1084 are part of one of the 30 SCC in 32 ms
Free SCC test removed 140 places
Drop transitions removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Graph (complete) has 3166 edges and 944 vertex of which 934 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.571 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 609 transitions
Trivial Post-agglo rules discarded 609 transitions
Performed 609 trivial Post agglomeration. Transition count delta: 609
Iterating post reduction 0 with 619 rules applied. Total rules applied 621 place count 934 transition count 119496
Reduce places removed 609 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 629 rules applied. Total rules applied 1250 place count 325 transition count 119476
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1260 place count 315 transition count 119476
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1260 place count 315 transition count 119425
Deduced a syphon composed of 51 places in 132 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1362 place count 264 transition count 119425
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1363 place count 264 transition count 119424
Performed 27 Post agglomeration using F-continuation condition.
Performed 43 Post agglomeration using F-continuation condition.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 44 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1465 place count 213 transition count 119373
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1485 place count 213 transition count 119353
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1506 place count 192 transition count 119313
Iterating global reduction 5 with 21 rules applied. Total rules applied 1527 place count 192 transition count 119313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1528 place count 192 transition count 119312
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1538 place count 182 transition count 119302
Iterating global reduction 6 with 10 rules applied. Total rules applied 1548 place count 182 transition count 119302
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 43 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1568 place count 172 transition count 119292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 33 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1574 place count 169 transition count 119300
Free-agglomeration rule applied 71 times.
Iterating global reduction 6 with 71 rules applied. Total rules applied 1645 place count 169 transition count 119229
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 6 with 71 rules applied. Total rules applied 1716 place count 98 transition count 119229
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1726 place count 88 transition count 119219
Iterating global reduction 7 with 10 rules applied. Total rules applied 1736 place count 88 transition count 119219
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 1742 place count 88 transition count 119219
Applied a total of 1742 rules in 99191 ms. Remains 88 /1084 variables (removed 996) and now considering 119219/120305 (removed 1086) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99196 ms. Remains : 88/1084 places, 119219/120305 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA StigmergyElection-PT-10b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 150 stabilizing places and 160 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' '!(((p0 U p1)||X(G(p2))))'
Support contains 20 out of 1084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Applied a total of 0 rules in 1505 ms. Remains 1084 /1084 variables (removed 0) and now considering 120305/120305 (removed 0) transitions.
[2023-03-23 17:52:39] [INFO ] Invariant cache hit.
[2023-03-23 17:53:10] [INFO ] Performed 1039/1084 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-23 17:53:10] [INFO ] Implicit Places using invariants in 31039 ms returned []
Implicit Place search using SMT only with invariants took 31043 ms to find 0 implicit places.
[2023-03-23 17:53:10] [INFO ] Invariant cache hit.
[2023-03-23 17:53:41] [INFO ] Performed 34359/120305 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 17:54:10] [INFO ] Dead Transitions using invariants and state equation in 60182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92744 ms. Remains : 1084/1084 places, 120305/120305 transitions.
Stuttering acceptance computed with spot in 527 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s85 1) (EQ s191 1) (EQ s297 1) (EQ s403 1) (EQ s487 1) (EQ s604 1) (EQ s699 1) (EQ s816 1) (EQ s933 1) (EQ s1017 1)), p0:(AND (EQ s27 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 590 reset in 7313 ms.
Product exploration explored 100000 steps with 588 reset in 6753 ms.
Computed a total of 150 stabilizing places and 160 stable transitions
Computed a total of 150 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) p0 p2))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 555 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 59 resets, run finished after 728 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7626 steps, run timeout after 3002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 7626 steps, saw 4632 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 17:54:34] [INFO ] Invariant cache hit.
[2023-03-23 17:54:34] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 17:54:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2023-03-23 17:54:59] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 1084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Graph (trivial) has 1103 edges and 1084 vertex of which 170 / 1084 are part of one of the 30 SCC in 12 ms
Free SCC test removed 140 places
Drop transitions removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Graph (complete) has 3166 edges and 944 vertex of which 934 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.611 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 659 transitions
Trivial Post-agglo rules discarded 659 transitions
Performed 659 trivial Post agglomeration. Transition count delta: 659
Iterating post reduction 0 with 669 rules applied. Total rules applied 671 place count 934 transition count 119446
Reduce places removed 659 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 679 rules applied. Total rules applied 1350 place count 275 transition count 119426
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1360 place count 265 transition count 119426
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1360 place count 265 transition count 119375
Deduced a syphon composed of 51 places in 123 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1462 place count 214 transition count 119375
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1463 place count 214 transition count 119374
Performed 27 Post agglomeration using F-continuation condition.
Performed 43 Post agglomeration using F-continuation condition.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 43 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1565 place count 163 transition count 119323
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1585 place count 163 transition count 119303
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 1618 place count 130 transition count 28433
Iterating global reduction 5 with 33 rules applied. Total rules applied 1651 place count 130 transition count 28433
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1664 place count 130 transition count 28420
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1674 place count 120 transition count 28410
Iterating global reduction 6 with 10 rules applied. Total rules applied 1684 place count 120 transition count 28410
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 9 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1704 place count 110 transition count 28400
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1710 place count 107 transition count 28408
Free-agglomeration rule applied 59 times.
Iterating global reduction 6 with 59 rules applied. Total rules applied 1769 place count 107 transition count 28349
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 6 with 316 rules applied. Total rules applied 2085 place count 48 transition count 28092
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 2095 place count 38 transition count 28082
Iterating global reduction 7 with 10 rules applied. Total rules applied 2105 place count 38 transition count 28082
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 7 with 1023 rules applied. Total rules applied 3128 place count 38 transition count 27059
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 3134 place count 38 transition count 27059
Applied a total of 3134 rules in 127700 ms. Remains 38 /1084 variables (removed 1046) and now considering 27059/120305 (removed 93246) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127705 ms. Remains : 38/1084 places, 27059/120305 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) p0 p2))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 640 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p2), (NOT p2)]
Support contains 10 out of 1084 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Applied a total of 0 rules in 1717 ms. Remains 1084 /1084 variables (removed 0) and now considering 120305/120305 (removed 0) transitions.
[2023-03-23 17:57:10] [INFO ] Invariant cache hit.
[2023-03-23 17:57:36] [INFO ] Implicit Places using invariants in 26442 ms returned []
Implicit Place search using SMT only with invariants took 26445 ms to find 0 implicit places.
[2023-03-23 17:57:36] [INFO ] Invariant cache hit.
[2023-03-23 17:58:07] [INFO ] Performed 31419/120305 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 17:58:36] [INFO ] Dead Transitions using invariants and state equation in 60191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88360 ms. Remains : 1084/1084 places, 120305/120305 transitions.
Computed a total of 150 stabilizing places and 160 stable transitions
Computed a total of 150 stabilizing places and 160 stable transitions
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 59 resets, run finished after 858 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6014 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6014 steps, saw 4300 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 17:58:45] [INFO ] Invariant cache hit.
[2023-03-23 17:58:45] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 17:58:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2023-03-23 17:59:10] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 1084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Graph (trivial) has 1103 edges and 1084 vertex of which 170 / 1084 are part of one of the 30 SCC in 5 ms
Free SCC test removed 140 places
Drop transitions removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Graph (complete) has 3166 edges and 944 vertex of which 934 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.532 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 659 transitions
Trivial Post-agglo rules discarded 659 transitions
Performed 659 trivial Post agglomeration. Transition count delta: 659
Iterating post reduction 0 with 669 rules applied. Total rules applied 671 place count 934 transition count 119446
Reduce places removed 659 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 679 rules applied. Total rules applied 1350 place count 275 transition count 119426
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1360 place count 265 transition count 119426
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1360 place count 265 transition count 119375
Deduced a syphon composed of 51 places in 112 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1462 place count 214 transition count 119375
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1463 place count 214 transition count 119374
Performed 27 Post agglomeration using F-continuation condition.
Performed 43 Post agglomeration using F-continuation condition.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 44 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1565 place count 163 transition count 119323
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1585 place count 163 transition count 119303
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 1618 place count 130 transition count 28433
Iterating global reduction 5 with 33 rules applied. Total rules applied 1651 place count 130 transition count 28433
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1664 place count 130 transition count 28420
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1674 place count 120 transition count 28410
Iterating global reduction 6 with 10 rules applied. Total rules applied 1684 place count 120 transition count 28410
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 8 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1704 place count 110 transition count 28400
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1710 place count 107 transition count 28408
Free-agglomeration rule applied 59 times.
Iterating global reduction 6 with 59 rules applied. Total rules applied 1769 place count 107 transition count 28349
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 6 with 316 rules applied. Total rules applied 2085 place count 48 transition count 28092
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 2095 place count 38 transition count 28082
Iterating global reduction 7 with 10 rules applied. Total rules applied 2105 place count 38 transition count 28082
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 7 with 1023 rules applied. Total rules applied 3128 place count 38 transition count 27059
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 3134 place count 38 transition count 27059
Applied a total of 3134 rules in 126242 ms. Remains 38 /1084 variables (removed 1046) and now considering 27059/120305 (removed 93246) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126245 ms. Remains : 38/1084 places, 27059/120305 transitions.
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 590 reset in 6174 ms.
Product exploration explored 100000 steps with 587 reset in 6202 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p2), (NOT p2)]
Support contains 10 out of 1084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Graph (trivial) has 1103 edges and 1084 vertex of which 170 / 1084 are part of one of the 30 SCC in 5 ms
Free SCC test removed 140 places
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Performed 639 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 639 rules applied. Total rules applied 640 place count 944 transition count 120145
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 650 place count 944 transition count 120135
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 650 place count 944 transition count 120145
Deduced a syphon composed of 659 places in 101 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 670 place count 944 transition count 120145
Discarding 546 places :
Symmetric choice reduction at 2 with 546 rule applications. Total rules 1216 place count 398 transition count 119599
Deduced a syphon composed of 122 places in 100 ms
Iterating global reduction 2 with 546 rules applied. Total rules applied 1762 place count 398 transition count 119599
Performed 19 Post agglomeration using F-continuation condition.
Performed 33 Post agglomeration using F-continuation condition.
Performed 47 Post agglomeration using F-continuation condition.
Performed 61 Post agglomeration using F-continuation condition.
Performed 74 Post agglomeration using F-continuation condition.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 203 places in 51 ms
Iterating global reduction 2 with 81 rules applied. Total rules applied 1843 place count 398 transition count 119599
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 1947 place count 294 transition count 28648
Deduced a syphon composed of 132 places in 11 ms
Iterating global reduction 2 with 104 rules applied. Total rules applied 2051 place count 294 transition count 28648
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 2064 place count 294 transition count 28635
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 2097 place count 261 transition count 28592
Deduced a syphon composed of 109 places in 11 ms
Iterating global reduction 3 with 33 rules applied. Total rules applied 2130 place count 261 transition count 28592
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2140 place count 251 transition count 28582
Deduced a syphon composed of 109 places in 11 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 2150 place count 251 transition count 28582
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 122 places in 11 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 2163 place count 251 transition count 28641
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 2186 place count 228 transition count 28595
Deduced a syphon composed of 99 places in 11 ms
Iterating global reduction 3 with 23 rules applied. Total rules applied 2209 place count 228 transition count 28595
Deduced a syphon composed of 99 places in 21 ms
Applied a total of 2209 rules in 231106 ms. Remains 228 /1084 variables (removed 856) and now considering 28595/120305 (removed 91710) transitions.
[2023-03-23 18:05:21] [INFO ] Flow matrix only has 28584 transitions (discarded 11 similar events)
// Phase 1: matrix 28584 rows 228 cols
[2023-03-23 18:05:21] [INFO ] Computed 2 place invariants in 477 ms
[2023-03-23 18:05:40] [INFO ] Dead Transitions using invariants and state equation in 19416 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/1084 places, 28595/120305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250529 ms. Remains : 228/1084 places, 28595/120305 transitions.
Support contains 10 out of 1084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Applied a total of 0 rules in 1933 ms. Remains 1084 /1084 variables (removed 0) and now considering 120305/120305 (removed 0) transitions.
// Phase 1: matrix 120305 rows 1084 cols
[2023-03-23 18:05:46] [INFO ] Computed 11 place invariants in 4046 ms
[2023-03-23 18:06:17] [INFO ] Performed 981/1084 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-23 18:06:19] [INFO ] Implicit Places using invariants in 36733 ms returned []
Implicit Place search using SMT only with invariants took 36738 ms to find 0 implicit places.
[2023-03-23 18:06:19] [INFO ] Invariant cache hit.
[2023-03-23 18:06:49] [INFO ] Performed 29251/120305 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 18:07:19] [INFO ] Dead Transitions using invariants and state equation in 60129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98805 ms. Remains : 1084/1084 places, 120305/120305 transitions.
Treatment of property StigmergyElection-PT-10b-LTLFireability-00 finished in 908430 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((G(p1)||(X(X(p3))&&p2)))&&p0)))'
Support contains 41 out of 1084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Applied a total of 0 rules in 1344 ms. Remains 1084 /1084 variables (removed 0) and now considering 120305/120305 (removed 0) transitions.
[2023-03-23 18:07:48] [INFO ] Invariant cache hit.
[2023-03-23 18:08:04] [INFO ] Implicit Places using invariants in 16116 ms returned []
Implicit Place search using SMT only with invariants took 16129 ms to find 0 implicit places.
[2023-03-23 18:08:04] [INFO ] Invariant cache hit.
[2023-03-23 18:08:34] [INFO ] Performed 34103/120305 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 18:09:04] [INFO ] Dead Transitions using invariants and state equation in 60234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77716 ms. Remains : 1084/1084 places, 120305/120305 transitions.
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : StigmergyElection-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}, { cond=p1, acceptance={} source=6 dest: 8}], [{ cond=(NOT p3), acceptance={} source=7 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 3}]], initial=0, aps=[p0:(AND (EQ s63 1) (EQ s191 1) (EQ s275 1) (EQ s403 1) (EQ s498 1) (EQ s604 1) (EQ s710 1) (EQ s816 1) (EQ s911 1) (EQ s1017 1)), p1:(OR (AND (EQ s63 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10b-LTLFireability-01 finished in 78870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F((!p1||G(!p2)))||G(!p3)))))'
Support contains 28 out of 1084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Applied a total of 0 rules in 1510 ms. Remains 1084 /1084 variables (removed 0) and now considering 120305/120305 (removed 0) transitions.
[2023-03-23 18:09:06] [INFO ] Invariant cache hit.
[2023-03-23 18:09:30] [INFO ] Implicit Places using invariants in 24034 ms returned []
Implicit Place search using SMT only with invariants took 24042 ms to find 0 implicit places.
[2023-03-23 18:09:31] [INFO ] Invariant cache hit.
[2023-03-23 18:10:01] [INFO ] Performed 31346/120305 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 18:10:31] [INFO ] Dead Transitions using invariants and state equation in 60146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85706 ms. Remains : 1084/1084 places, 120305/120305 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) p1 p3 p2), (AND p1 p3 p2), (AND p1 p3 (NOT p0) p2), (AND p1 p2), (AND p1 p2 (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-10b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p3), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s74 0) (EQ s191 0) (EQ s286 0) (EQ s381 0) (EQ s498 0) (EQ s604 0) (EQ s699 0) (EQ s827 0) (EQ s933 0) (EQ s1028 0)), p1:(AND (EQ s27 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 9856 ms.
Product exploration explored 100000 steps with 50000 reset in 8132 ms.
Computed a total of 150 stabilizing places and 160 stable transitions
Computed a total of 150 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p1 p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND p0 p1 p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p3))))
Knowledge based reduction with 17 factoid took 434 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-10b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10b-LTLFireability-02 finished in 107220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G((p1&&(p1 U (!p2||G(p1)))))))))'
Support contains 26 out of 1084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Applied a total of 0 rules in 1272 ms. Remains 1084 /1084 variables (removed 0) and now considering 120305/120305 (removed 0) transitions.
[2023-03-23 18:10:53] [INFO ] Invariant cache hit.
[2023-03-23 18:11:21] [INFO ] Implicit Places using invariants in 27885 ms returned []
Implicit Place search using SMT only with invariants took 27887 ms to find 0 implicit places.
[2023-03-23 18:11:21] [INFO ] Invariant cache hit.
[2023-03-23 18:11:52] [INFO ] Performed 33678/120305 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 18:12:21] [INFO ] Dead Transitions using invariants and state equation in 60129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89296 ms. Remains : 1084/1084 places, 120305/120305 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : StigmergyElection-PT-10b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s63 0) (EQ s169 0) (EQ s275 0) (EQ s403 0) (EQ s509 0) (EQ s604 0) (EQ s721 0) (EQ s805 0) (EQ s911 0) (EQ s1039 0)), p1:(OR (NEQ s63 1) (NEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 588 reset in 6842 ms.
Product exploration explored 100000 steps with 589 reset in 6691 ms.
Computed a total of 150 stabilizing places and 160 stable transitions
Computed a total of 150 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND p1 p0 p2))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 347 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 950 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 5491 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5491 steps, saw 4184 distinct states, run finished after 3001 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 18:12:44] [INFO ] Invariant cache hit.
[2023-03-23 18:12:45] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-03-23 18:13:09] [INFO ] After 24714ms SMT Verify possible using state equation in real domain returned unsat :1 sat :0 real:1
[2023-03-23 18:13:09] [INFO ] After 24854ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 18:13:09] [INFO ] After 25159ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 18:13:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2023-03-23 18:13:34] [INFO ] After 24761ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-23 18:13:34] [INFO ] After 24762ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-23 18:13:34] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 1084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Graph (trivial) has 1093 edges and 1084 vertex of which 170 / 1084 are part of one of the 30 SCC in 5 ms
Free SCC test removed 140 places
Drop transitions removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Graph (complete) has 3166 edges and 944 vertex of which 934 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.588 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 649 transitions
Trivial Post-agglo rules discarded 649 transitions
Performed 649 trivial Post agglomeration. Transition count delta: 649
Iterating post reduction 0 with 659 rules applied. Total rules applied 661 place count 934 transition count 119456
Reduce places removed 649 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 669 rules applied. Total rules applied 1330 place count 285 transition count 119436
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1340 place count 275 transition count 119436
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1340 place count 275 transition count 119385
Deduced a syphon composed of 51 places in 94 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1442 place count 224 transition count 119385
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1443 place count 224 transition count 119384
Performed 27 Post agglomeration using F-continuation condition.
Performed 43 Post agglomeration using F-continuation condition.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 44 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1545 place count 173 transition count 119333
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1565 place count 173 transition count 119313
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 1598 place count 140 transition count 12407
Iterating global reduction 5 with 33 rules applied. Total rules applied 1631 place count 140 transition count 12407
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1644 place count 140 transition count 12394
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1654 place count 130 transition count 12384
Iterating global reduction 6 with 10 rules applied. Total rules applied 1664 place count 130 transition count 12384
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1684 place count 120 transition count 12374
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1690 place count 117 transition count 12382
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1698 place count 117 transition count 12374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1700 place count 116 transition count 12380
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1708 place count 116 transition count 12372
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1710 place count 115 transition count 12378
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1718 place count 115 transition count 12370
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1720 place count 114 transition count 12376
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1728 place count 114 transition count 12368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1730 place count 113 transition count 12374
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1738 place count 113 transition count 12366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1740 place count 112 transition count 12372
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1748 place count 112 transition count 12364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1750 place count 111 transition count 12370
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1758 place count 111 transition count 12362
Free-agglomeration rule applied 59 times.
Iterating global reduction 6 with 59 rules applied. Total rules applied 1817 place count 111 transition count 12303
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 64 rules applied. Total rules applied 1881 place count 52 transition count 12298
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1891 place count 42 transition count 12288
Iterating global reduction 7 with 10 rules applied. Total rules applied 1901 place count 42 transition count 12288
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 1936 place count 42 transition count 12253
Drop transitions removed 192 transitions
Redundant transition composition rules discarded 192 transitions
Iterating global reduction 8 with 192 rules applied. Total rules applied 2128 place count 42 transition count 12061
Applied a total of 2128 rules in 165420 ms. Remains 42 /1084 variables (removed 1042) and now considering 12061/120305 (removed 108244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165425 ms. Remains : 42/1084 places, 12061/120305 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND p1 p0 p2))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 426 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Support contains 10 out of 1084 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Graph (trivial) has 1087 edges and 1084 vertex of which 170 / 1084 are part of one of the 30 SCC in 5 ms
Free SCC test removed 140 places
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 623 transitions
Trivial Post-agglo rules discarded 623 transitions
Performed 623 trivial Post agglomeration. Transition count delta: 623
Iterating post reduction 0 with 623 rules applied. Total rules applied 624 place count 943 transition count 119521
Reduce places removed 623 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 643 rules applied. Total rules applied 1267 place count 320 transition count 119501
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1277 place count 310 transition count 119501
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1277 place count 310 transition count 119460
Deduced a syphon composed of 41 places in 101 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1359 place count 269 transition count 119460
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1368 place count 260 transition count 119451
Iterating global reduction 3 with 9 rules applied. Total rules applied 1377 place count 260 transition count 119451
Performed 26 Post agglomeration using F-continuation condition.
Performed 42 Post agglomeration using F-continuation condition.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 58 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1475 place count 211 transition count 119402
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1505 place count 181 transition count 22226
Iterating global reduction 3 with 30 rules applied. Total rules applied 1535 place count 181 transition count 22226
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1545 place count 181 transition count 22216
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1555 place count 171 transition count 22196
Iterating global reduction 4 with 10 rules applied. Total rules applied 1565 place count 171 transition count 22196
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1575 place count 161 transition count 22176
Iterating global reduction 4 with 10 rules applied. Total rules applied 1585 place count 161 transition count 22176
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 1613 place count 147 transition count 22183
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1614 place count 146 transition count 22163
Iterating global reduction 4 with 1 rules applied. Total rules applied 1615 place count 146 transition count 22163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1616 place count 146 transition count 22162
Applied a total of 1616 rules in 108017 ms. Remains 146 /1084 variables (removed 938) and now considering 22162/120305 (removed 98143) transitions.
[2023-03-23 18:18:09] [INFO ] Flow matrix only has 22151 transitions (discarded 11 similar events)
// Phase 1: matrix 22151 rows 146 cols
[2023-03-23 18:18:09] [INFO ] Computed 2 place invariants in 304 ms
[2023-03-23 18:18:13] [INFO ] Implicit Places using invariants in 4061 ms returned []
Implicit Place search using SMT only with invariants took 4063 ms to find 0 implicit places.
[2023-03-23 18:18:13] [INFO ] Flow matrix only has 22151 transitions (discarded 11 similar events)
[2023-03-23 18:18:13] [INFO ] Invariant cache hit.
[2023-03-23 18:18:27] [INFO ] Dead Transitions using invariants and state equation in 14663 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/1084 places, 22162/120305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126752 ms. Remains : 146/1084 places, 22162/120305 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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 p1)]
Incomplete random walk after 10000 steps, including 481 resets, run finished after 910 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 42801 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42801 steps, saw 15288 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 18:18:32] [INFO ] Flow matrix only has 22151 transitions (discarded 11 similar events)
[2023-03-23 18:18:32] [INFO ] Invariant cache hit.
[2023-03-23 18:18:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 18:18:42] [INFO ] After 10008ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 18:18:50] [INFO ] State equation strengthened by 1023 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 18:18:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:18:57] [INFO ] After 25041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 10 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 22162/22162 transitions.
Graph (complete) has 1354 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.75 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 145 transition count 22124
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 54 place count 129 transition count 22124
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 124 transition count 9972
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 124 transition count 9972
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 69 place count 124 transition count 9967
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 109 place count 104 transition count 9947
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 119 place count 104 transition count 9937
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 175 place count 104 transition count 9881
Reduce places removed 57 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 265 place count 47 transition count 9848
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 275 place count 37 transition count 9838
Iterating global reduction 5 with 10 rules applied. Total rules applied 285 place count 37 transition count 9838
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 5 with 1023 rules applied. Total rules applied 1308 place count 37 transition count 8815
Performed 10 Post agglomeration using F-continuation condition with reduction of 6534 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1328 place count 27 transition count 2271
Drop transitions removed 10 transitions
Ensure Unique test removed 1221 transitions
Reduce isomorphic transitions removed 1231 transitions.
Iterating post reduction 6 with 1231 rules applied. Total rules applied 2559 place count 27 transition count 1040
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 2571 place count 21 transition count 1034
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2572 place count 20 transition count 1033
Applied a total of 2572 rules in 6029 ms. Remains 20 /146 variables (removed 126) and now considering 1033/22162 (removed 21129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6030 ms. Remains : 20/146 places, 1033/22162 transitions.
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=18 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1)]
Product exploration explored 100000 steps with 4811 reset in 4739 ms.
Product exploration explored 100000 steps with 4832 reset in 4449 ms.
Support contains 10 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 22162/22162 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 146 transition count 22146
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 130 transition count 22146
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 125 transition count 9994
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 125 transition count 9994
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 47 place count 125 transition count 9989
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 57 place count 125 transition count 9979
Applied a total of 57 rules in 7932 ms. Remains 125 /146 variables (removed 21) and now considering 9979/22162 (removed 12183) transitions.
[2023-03-23 18:19:20] [INFO ] Flow matrix only has 9968 transitions (discarded 11 similar events)
// Phase 1: matrix 9968 rows 125 cols
[2023-03-23 18:19:21] [INFO ] Computed 2 place invariants in 140 ms
[2023-03-23 18:19:26] [INFO ] Implicit Places using invariants in 5671 ms returned []
[2023-03-23 18:19:26] [INFO ] Flow matrix only has 9968 transitions (discarded 11 similar events)
[2023-03-23 18:19:26] [INFO ] Invariant cache hit.
[2023-03-23 18:19:27] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 7080 ms to find 0 implicit places.
[2023-03-23 18:19:30] [INFO ] Redundant transitions in 2650 ms returned []
[2023-03-23 18:19:30] [INFO ] Flow matrix only has 9968 transitions (discarded 11 similar events)
[2023-03-23 18:19:30] [INFO ] Invariant cache hit.
[2023-03-23 18:19:37] [INFO ] Dead Transitions using invariants and state equation in 6503 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/146 places, 9979/22162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24174 ms. Remains : 125/146 places, 9979/22162 transitions.
Treatment of property StigmergyElection-PT-10b-LTLFireability-04 finished in 548025 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((X((p1&&F(p2)))&&p0))))'
Support contains 22 out of 1084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Applied a total of 0 rules in 2144 ms. Remains 1084 /1084 variables (removed 0) and now considering 120305/120305 (removed 0) transitions.
// Phase 1: matrix 120305 rows 1084 cols
[2023-03-23 18:20:07] [INFO ] Computed 11 place invariants in 4866 ms
[2023-03-23 18:20:38] [INFO ] Performed 981/1084 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-23 18:20:40] [INFO ] Implicit Places using invariants in 37455 ms returned []
Implicit Place search using SMT only with invariants took 37459 ms to find 0 implicit places.
[2023-03-23 18:20:40] [INFO ] Invariant cache hit.
[2023-03-23 18:21:10] [INFO ] Performed 31420/120305 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 18:21:40] [INFO ] Dead Transitions using invariants and state equation in 60130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99742 ms. Remains : 1084/1084 places, 120305/120305 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-10b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (NEQ s38 1) (NEQ s144 1) (NEQ s250 1) (NEQ s345 1) (NEQ s451 1) (NEQ s557 1) (NEQ s685 1) (NEQ s791 1) (NEQ s886 1) (NEQ s1003 1)) (OR (EQ s38...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25100 reset in 7710 ms.
Product exploration explored 100000 steps with 25010 reset in 6493 ms.
Computed a total of 150 stabilizing places and 160 stable transitions
Computed a total of 150 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1023 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 5211 steps, run timeout after 3005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5211 steps, saw 4119 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 18:22:03] [INFO ] Invariant cache hit.
[2023-03-23 18:22:04] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 18:22:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2023-03-23 18:22:29] [INFO ] After 24588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 18:22:29] [INFO ] After 24704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-23 18:22:29] [INFO ] After 25148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 22 out of 1084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Graph (trivial) has 1091 edges and 1084 vertex of which 170 / 1084 are part of one of the 30 SCC in 5 ms
Free SCC test removed 140 places
Drop transitions removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Graph (complete) has 3166 edges and 944 vertex of which 934 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.440 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 647 transitions
Trivial Post-agglo rules discarded 647 transitions
Performed 647 trivial Post agglomeration. Transition count delta: 647
Iterating post reduction 0 with 657 rules applied. Total rules applied 659 place count 934 transition count 119458
Reduce places removed 647 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 667 rules applied. Total rules applied 1326 place count 287 transition count 119438
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1336 place count 277 transition count 119438
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1336 place count 277 transition count 119387
Deduced a syphon composed of 51 places in 110 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1438 place count 226 transition count 119387
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1439 place count 226 transition count 119386
Performed 27 Post agglomeration using F-continuation condition.
Performed 43 Post agglomeration using F-continuation condition.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 47 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1541 place count 175 transition count 119335
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1561 place count 175 transition count 119315
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 1587 place count 149 transition count 44917
Iterating global reduction 5 with 26 rules applied. Total rules applied 1613 place count 149 transition count 44917
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1619 place count 149 transition count 44911
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1629 place count 139 transition count 44901
Iterating global reduction 6 with 10 rules applied. Total rules applied 1639 place count 139 transition count 44901
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 15 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1659 place count 129 transition count 44891
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 16 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1665 place count 126 transition count 44899
Free-agglomeration rule applied 66 times.
Iterating global reduction 6 with 66 rules applied. Total rules applied 1731 place count 126 transition count 44833
Reduce places removed 66 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 67 rules applied. Total rules applied 1798 place count 60 transition count 44832
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1808 place count 50 transition count 44822
Iterating global reduction 7 with 10 rules applied. Total rules applied 1818 place count 50 transition count 44822
Ensure Unique test removed 287 transitions
Reduce isomorphic transitions removed 287 transitions.
Iterating post reduction 7 with 287 rules applied. Total rules applied 2105 place count 50 transition count 44535
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2111 place count 50 transition count 44535
Applied a total of 2111 rules in 136312 ms. Remains 50 /1084 variables (removed 1034) and now considering 44535/120305 (removed 75770) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136318 ms. Remains : 50/1084 places, 44535/120305 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 340 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
Support contains 22 out of 1084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Applied a total of 0 rules in 1373 ms. Remains 1084 /1084 variables (removed 0) and now considering 120305/120305 (removed 0) transitions.
[2023-03-23 18:24:47] [INFO ] Invariant cache hit.
[2023-03-23 18:25:16] [INFO ] Implicit Places using invariants in 29182 ms returned []
Implicit Place search using SMT only with invariants took 29189 ms to find 0 implicit places.
[2023-03-23 18:25:17] [INFO ] Invariant cache hit.
[2023-03-23 18:25:47] [INFO ] Performed 26694/120305 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 18:26:17] [INFO ] Dead Transitions using invariants and state equation in 60198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90766 ms. Remains : 1084/1084 places, 120305/120305 transitions.
Computed a total of 150 stabilizing places and 160 stable transitions
Computed a total of 150 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 295 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1181 ms. (steps per millisecond=8 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 4987 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4987 steps, saw 4065 distinct states, run finished after 3005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 18:26:26] [INFO ] Invariant cache hit.
[2023-03-23 18:26:27] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 18:26:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-03-23 18:26:52] [INFO ] After 24619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 18:26:52] [INFO ] After 24742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-23 18:26:52] [INFO ] After 25160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 22 out of 1084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Graph (trivial) has 1091 edges and 1084 vertex of which 170 / 1084 are part of one of the 30 SCC in 5 ms
Free SCC test removed 140 places
Drop transitions removed 190 transitions
Reduce isomorphic transitions removed 190 transitions.
Graph (complete) has 3166 edges and 944 vertex of which 934 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.431 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 647 transitions
Trivial Post-agglo rules discarded 647 transitions
Performed 647 trivial Post agglomeration. Transition count delta: 647
Iterating post reduction 0 with 657 rules applied. Total rules applied 659 place count 934 transition count 119458
Reduce places removed 647 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 667 rules applied. Total rules applied 1326 place count 287 transition count 119438
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1336 place count 277 transition count 119438
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1336 place count 277 transition count 119387
Deduced a syphon composed of 51 places in 91 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1438 place count 226 transition count 119387
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1439 place count 226 transition count 119386
Performed 27 Post agglomeration using F-continuation condition.
Performed 43 Post agglomeration using F-continuation condition.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 62 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1541 place count 175 transition count 119335
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1561 place count 175 transition count 119315
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 1587 place count 149 transition count 44917
Iterating global reduction 5 with 26 rules applied. Total rules applied 1613 place count 149 transition count 44917
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1619 place count 149 transition count 44911
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1629 place count 139 transition count 44901
Iterating global reduction 6 with 10 rules applied. Total rules applied 1639 place count 139 transition count 44901
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 16 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1659 place count 129 transition count 44891
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 15 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1665 place count 126 transition count 44899
Free-agglomeration rule applied 66 times.
Iterating global reduction 6 with 66 rules applied. Total rules applied 1731 place count 126 transition count 44833
Reduce places removed 66 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 67 rules applied. Total rules applied 1798 place count 60 transition count 44832
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1808 place count 50 transition count 44822
Iterating global reduction 7 with 10 rules applied. Total rules applied 1818 place count 50 transition count 44822
Ensure Unique test removed 287 transitions
Reduce isomorphic transitions removed 287 transitions.
Iterating post reduction 7 with 287 rules applied. Total rules applied 2105 place count 50 transition count 44535
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2111 place count 50 transition count 44535
Applied a total of 2111 rules in 134068 ms. Remains 50 /1084 variables (removed 1034) and now considering 44535/120305 (removed 75770) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134074 ms. Remains : 50/1084 places, 44535/120305 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 25010 reset in 6557 ms.
Product exploration explored 100000 steps with 24988 reset in 6571 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
Support contains 22 out of 1084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Graph (trivial) has 1091 edges and 1084 vertex of which 170 / 1084 are part of one of the 30 SCC in 6 ms
Free SCC test removed 140 places
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Performed 627 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 627 rules applied. Total rules applied 628 place count 944 transition count 120145
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 638 place count 944 transition count 120135
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 638 place count 944 transition count 120145
Deduced a syphon composed of 647 places in 125 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 658 place count 944 transition count 120145
Discarding 534 places :
Symmetric choice reduction at 2 with 534 rule applications. Total rules 1192 place count 410 transition count 119611
Deduced a syphon composed of 122 places in 120 ms
Iterating global reduction 2 with 534 rules applied. Total rules applied 1726 place count 410 transition count 119611
Performed 19 Post agglomeration using F-continuation condition.
Performed 33 Post agglomeration using F-continuation condition.
Performed 47 Post agglomeration using F-continuation condition.
Performed 61 Post agglomeration using F-continuation condition.
Performed 74 Post agglomeration using F-continuation condition.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 203 places in 53 ms
Iterating global reduction 2 with 81 rules applied. Total rules applied 1807 place count 410 transition count 119611
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 1904 place count 313 transition count 45132
Deduced a syphon composed of 132 places in 15 ms
Iterating global reduction 2 with 97 rules applied. Total rules applied 2001 place count 313 transition count 45132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 2007 place count 313 transition count 45126
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2033 place count 287 transition count 45090
Deduced a syphon composed of 116 places in 15 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 2059 place count 287 transition count 45090
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2069 place count 277 transition count 45080
Deduced a syphon composed of 116 places in 15 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 2079 place count 277 transition count 45080
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 129 places in 16 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 2092 place count 277 transition count 45139
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 2115 place count 254 transition count 45093
Deduced a syphon composed of 106 places in 18 ms
Iterating global reduction 3 with 23 rules applied. Total rules applied 2138 place count 254 transition count 45093
Deduced a syphon composed of 106 places in 16 ms
Applied a total of 2138 rules in 218566 ms. Remains 254 /1084 variables (removed 830) and now considering 45093/120305 (removed 75212) transitions.
[2023-03-23 18:32:59] [INFO ] Flow matrix only has 45082 transitions (discarded 11 similar events)
// Phase 1: matrix 45082 rows 254 cols
[2023-03-23 18:33:00] [INFO ] Computed 2 place invariants in 871 ms
[2023-03-23 18:33:30] [INFO ] Performed 33098/45093 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 18:33:42] [INFO ] Dead Transitions using invariants and state equation in 42742 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 254/1084 places, 45093/120305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261316 ms. Remains : 254/1084 places, 45093/120305 transitions.
Support contains 22 out of 1084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Applied a total of 0 rules in 1867 ms. Remains 1084 /1084 variables (removed 0) and now considering 120305/120305 (removed 0) transitions.
// Phase 1: matrix 120305 rows 1084 cols
[2023-03-23 18:33:48] [INFO ] Computed 11 place invariants in 4280 ms
[2023-03-23 18:34:15] [INFO ] Implicit Places using invariants in 30502 ms returned []
Implicit Place search using SMT only with invariants took 30506 ms to find 0 implicit places.
[2023-03-23 18:34:15] [INFO ] Invariant cache hit.
[2023-03-23 18:34:45] [INFO ] Performed 34903/120305 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-23 18:35:15] [INFO ] Dead Transitions using invariants and state equation in 60130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92537 ms. Remains : 1084/1084 places, 120305/120305 transitions.
Treatment of property StigmergyElection-PT-10b-LTLFireability-06 finished in 942168 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 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 17 out of 1084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Graph (trivial) has 1096 edges and 1084 vertex of which 170 / 1084 are part of one of the 30 SCC in 5 ms
Free SCC test removed 140 places
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 632 transitions
Trivial Post-agglo rules discarded 632 transitions
Performed 632 trivial Post agglomeration. Transition count delta: 632
Iterating post reduction 0 with 632 rules applied. Total rules applied 633 place count 943 transition count 119512
Reduce places removed 632 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 652 rules applied. Total rules applied 1285 place count 311 transition count 119492
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1295 place count 301 transition count 119492
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1295 place count 301 transition count 119451
Deduced a syphon composed of 41 places in 114 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1377 place count 260 transition count 119451
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1386 place count 251 transition count 119442
Iterating global reduction 3 with 9 rules applied. Total rules applied 1395 place count 251 transition count 119442
Performed 26 Post agglomeration using F-continuation condition.
Performed 42 Post agglomeration using F-continuation condition.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 113 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1493 place count 202 transition count 119393
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1525 place count 170 transition count 28533
Iterating global reduction 3 with 32 rules applied. Total rules applied 1557 place count 170 transition count 28533
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1569 place count 170 transition count 28521
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1579 place count 160 transition count 28501
Iterating global reduction 4 with 10 rules applied. Total rules applied 1589 place count 160 transition count 28501
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1599 place count 150 transition count 28481
Iterating global reduction 4 with 10 rules applied. Total rules applied 1609 place count 150 transition count 28481
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 14 places in 6 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 1637 place count 136 transition count 28488
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1638 place count 135 transition count 28468
Iterating global reduction 4 with 1 rules applied. Total rules applied 1639 place count 135 transition count 28468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1640 place count 135 transition count 28467
Applied a total of 1640 rules in 119761 ms. Remains 135 /1084 variables (removed 949) and now considering 28467/120305 (removed 91838) transitions.
[2023-03-23 18:37:42] [INFO ] Flow matrix only has 28456 transitions (discarded 11 similar events)
// Phase 1: matrix 28456 rows 135 cols
[2023-03-23 18:37:43] [INFO ] Computed 2 place invariants in 448 ms
[2023-03-23 18:37:47] [INFO ] Implicit Places using invariants in 5170 ms returned []
Implicit Place search using SMT only with invariants took 5171 ms to find 0 implicit places.
[2023-03-23 18:37:47] [INFO ] Flow matrix only has 28456 transitions (discarded 11 similar events)
[2023-03-23 18:37:47] [INFO ] Invariant cache hit.
[2023-03-23 18:38:06] [INFO ] Dead Transitions using invariants and state equation in 19089 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/1084 places, 28467/120305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144023 ms. Remains : 135/1084 places, 28467/120305 transitions.
Stuttering acceptance computed with spot in 157 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : StigmergyElection-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s19 1) (EQ s30 1) (EQ s43 1) (EQ s58 1) (EQ s71 1) (EQ s84 1) (EQ s100 1) (EQ s114 1) (EQ s128 1)), p0:(AND (EQ s6 1) (EQ s19 1) (EQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5080 reset in 5924 ms.
Product exploration explored 100000 steps with 5075 reset in 5567 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 379 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 507 resets, run finished after 999 ms. (steps per millisecond=10 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 25765 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 25765 steps, saw 13294 distinct states, run finished after 3006 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 18:38:23] [INFO ] Flow matrix only has 28456 transitions (discarded 11 similar events)
[2023-03-23 18:38:23] [INFO ] Invariant cache hit.
[2023-03-23 18:38:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 18:38:38] [INFO ] After 15018ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:3
[2023-03-23 18:38:48] [INFO ] State equation strengthened by 1023 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 18:38:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:38:48] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 17 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 28467/28467 transitions.
Graph (complete) has 1305 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.93 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 134 transition count 28445
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 40 rules applied. Total rules applied 62 place count 114 transition count 28425
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 72 place count 114 transition count 28415
Free-agglomeration rule applied 59 times.
Iterating global reduction 2 with 59 rules applied. Total rules applied 131 place count 114 transition count 28356
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 194 place count 54 transition count 28353
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 204 place count 44 transition count 28343
Iterating global reduction 3 with 10 rules applied. Total rules applied 214 place count 44 transition count 28343
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 3 with 1023 rules applied. Total rules applied 1237 place count 44 transition count 27320
Performed 10 Post agglomeration using F-continuation condition with reduction of 9515 identical transitions.
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1257 place count 34 transition count 17795
Drop transitions removed 10 transitions
Ensure Unique test removed 266 transitions
Reduce isomorphic transitions removed 276 transitions.
Iterating post reduction 4 with 276 rules applied. Total rules applied 1533 place count 34 transition count 17519
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1545 place count 28 transition count 17513
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1546 place count 27 transition count 17512
Applied a total of 1546 rules in 104040 ms. Remains 27 /135 variables (removed 108) and now considering 17512/28467 (removed 10955) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104042 ms. Remains : 27/135 places, 17512/28467 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 623 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p0 p1)]
Support contains 17 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 28467/28467 transitions.
Applied a total of 0 rules in 798 ms. Remains 135 /135 variables (removed 0) and now considering 28467/28467 (removed 0) transitions.
[2023-03-23 18:40:34] [INFO ] Flow matrix only has 28456 transitions (discarded 11 similar events)
[2023-03-23 18:40:34] [INFO ] Invariant cache hit.
[2023-03-23 18:40:40] [INFO ] Implicit Places using invariants in 5767 ms returned []
Implicit Place search using SMT only with invariants took 5769 ms to find 0 implicit places.
[2023-03-23 18:40:40] [INFO ] Flow matrix only has 28456 transitions (discarded 11 similar events)
[2023-03-23 18:40:40] [INFO ] Invariant cache hit.
[2023-03-23 18:40:59] [INFO ] Dead Transitions using invariants and state equation in 18500 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25070 ms. Remains : 135/135 places, 28467/28467 transitions.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 355 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 510 resets, run finished after 1254 ms. (steps per millisecond=7 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 29433 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 29433 steps, saw 13700 distinct states, run finished after 3004 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-23 18:41:04] [INFO ] Flow matrix only has 28456 transitions (discarded 11 similar events)
[2023-03-23 18:41:04] [INFO ] Invariant cache hit.
[2023-03-23 18:41:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 18:41:19] [INFO ] After 14579ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-23 18:41:28] [INFO ] State equation strengthened by 1023 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 18:41:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:41:29] [INFO ] After 25044ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 17 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 28467/28467 transitions.
Graph (complete) has 1305 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.160 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 134 transition count 28445
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 40 rules applied. Total rules applied 62 place count 114 transition count 28425
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 72 place count 114 transition count 28415
Free-agglomeration rule applied 59 times.
Iterating global reduction 2 with 59 rules applied. Total rules applied 131 place count 114 transition count 28356
Reduce places removed 60 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 194 place count 54 transition count 28353
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 204 place count 44 transition count 28343
Iterating global reduction 3 with 10 rules applied. Total rules applied 214 place count 44 transition count 28343
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 3 with 1023 rules applied. Total rules applied 1237 place count 44 transition count 27320
Performed 10 Post agglomeration using F-continuation condition with reduction of 9515 identical transitions.
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1257 place count 34 transition count 17795
Drop transitions removed 10 transitions
Ensure Unique test removed 266 transitions
Reduce isomorphic transitions removed 276 transitions.
Iterating post reduction 4 with 276 rules applied. Total rules applied 1533 place count 34 transition count 17519
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1545 place count 28 transition count 17513
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1546 place count 27 transition count 17512
Applied a total of 1546 rules in 104027 ms. Remains 27 /135 variables (removed 108) and now considering 17512/28467 (removed 10955) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104028 ms. Remains : 27/135 places, 17512/28467 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 319 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 138 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 170 ms :[p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 5070 reset in 5827 ms.
Product exploration explored 100000 steps with 5050 reset in 5409 ms.
Support contains 17 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 28467/28467 transitions.
Applied a total of 0 rules in 518 ms. Remains 135 /135 variables (removed 0) and now considering 28467/28467 (removed 0) transitions.
[2023-03-23 18:43:26] [INFO ] Flow matrix only has 28456 transitions (discarded 11 similar events)
[2023-03-23 18:43:26] [INFO ] Invariant cache hit.
[2023-03-23 18:43:30] [INFO ] Implicit Places using invariants in 4503 ms returned []
Implicit Place search using SMT only with invariants took 4505 ms to find 0 implicit places.
[2023-03-23 18:43:30] [INFO ] Flow matrix only has 28456 transitions (discarded 11 similar events)
[2023-03-23 18:43:30] [INFO ] Invariant cache hit.
[2023-03-23 18:43:53] [INFO ] Dead Transitions using invariants and state equation in 22483 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27511 ms. Remains : 135/135 places, 28467/28467 transitions.
Treatment of property StigmergyElection-PT-10b-LTLFireability-07 finished in 514001 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||G(p1)))))'
Support contains 20 out of 1084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1084/1084 places, 120305/120305 transitions.
Graph (trivial) has 1093 edges and 1084 vertex of which 170 / 1084 are part of one of the 30 SCC in 6 ms
Free SCC test removed 140 places
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 630 place count 943 transition count 119515
Reduce places removed 629 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 649 rules applied. Total rules applied 1279 place count 314 transition count 119495
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1289 place count 304 transition count 119495
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1289 place count 304 transition count 119454
Deduced a syphon composed of 41 places in 176 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1371 place count 263 transition count 119454
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1380 place count 254 transition count 119445
Iterating global reduction 3 with 9 rules applied. Total rules applied 1389 place count 254 transition count 119445
Performed 26 Post agglomeration using F-continuation condition.
Performed 42 Post agglomeration using F-continuation condition.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 53 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1487 place count 205 transition count 119396
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1514 place count 178 transition count 30428
Iterating global reduction 3 with 27 rules applied. Total rules applied 1541 place count 178 transition count 30428
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1548 place count 178 transition count 30421
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1558 place count 168 transition count 30401
Iterating global reduction 4 with 10 rules applied. Total rules applied 1568 place count 168 transition count 30401
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1578 place count 158 transition count 30381
Iterating global reduction 4 with 10 rules applied. Total rules applied 1588 place count 158 transition count 30381
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 14 places in 7 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 1616 place count 144 transition count 30388
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1617 place count 143 transition count 30368
Iterating global reduction 4 with 1 rules applied. Total rules applied 1618 place count 143 transition count 30368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1619 place count 143 transition count 30367
Applied a total of 1619 rules in 107908 ms. Remains 143 /1084 variables (removed 941) and now considering 30367/120305 (removed 89938) transitions.
[2023-03-23 18:46:04] [INFO ] Flow matrix only has 30356 transitions (discarded 11 similar events)
// Phase 1: matrix 30356 rows 143 cols
[2023-03-23 18:46:05] [INFO ] Computed 2 place invariants in 496 ms
[2023-03-23 18:46:12] [INFO ] Implicit Places using invariants in 8071 ms returned []
Implicit Place search using SMT only with invariants took 8072 ms to find 0 implicit places.
[2023-03-23 18:46:12] [INFO ] Flow matrix only has 30356 transitions (discarded 11 similar events)
[2023-03-23 18:46:12] [INFO ] Invariant cache hit.
[2023-03-23 18:46:35] [INFO ] Dead Transitions using invariants and state equation in 22423 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/1084 places, 30367/120305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138406 ms. Remains : 143/1084 places, 30367/120305 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-10b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s8 0) (EQ s24 0) (EQ s35 0) (EQ s50 0) (EQ s63 0) (EQ s78 0) (EQ s92 0) (EQ s106 0) (EQ s120 0) (EQ s136 0)), p0:(AND (EQ s6 1) (EQ s20 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5016 reset in 5897 ms.
Product exploration explored 100000 steps with 5006 reset in 5867 ms.
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 500 resets, run finished after 1180 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 30284 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 30284 steps, saw 13073 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 18:46:52] [INFO ] Flow matrix only has 30356 transitions (discarded 11 similar events)
[2023-03-23 18:46:52] [INFO ] Invariant cache hit.
[2023-03-23 18:46:52] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 18:46:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 18:47:08] [INFO ] After 15768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 18:47:18] [INFO ] State equation strengthened by 1023 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 18:47:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 18:47:18] [INFO ] After 26321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 20 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 30367/30367 transitions.
Graph (complete) has 1408 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.108 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 142 transition count 30345
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 9 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 40 rules applied. Total rules applied 62 place count 122 transition count 30325
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 72 place count 122 transition count 30315
Free-agglomeration rule applied 64 times.
Iterating global reduction 2 with 64 rules applied. Total rules applied 136 place count 122 transition count 30251
Reduce places removed 65 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 82 rules applied. Total rules applied 218 place count 57 transition count 30234
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 228 place count 47 transition count 30224
Iterating global reduction 3 with 10 rules applied. Total rules applied 238 place count 47 transition count 30224
Ensure Unique test removed 175 transitions
Reduce isomorphic transitions removed 175 transitions.
Iterating post reduction 3 with 175 rules applied. Total rules applied 413 place count 47 transition count 30049
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6298840 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15930728 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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-10b"
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-10b, 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-167912649600692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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