Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690555900162.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is StigmergyElection-PT-02b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555900162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-02b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717124799867

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-02b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 03:06:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 03:06:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:06:41] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-05-31 03:06:41] [INFO ] Transformed 291 places.
[2024-05-31 03:06:41] [INFO ] Transformed 332 transitions.
[2024-05-31 03:06:41] [INFO ] Found NUPN structural information;
[2024-05-31 03:06:41] [INFO ] Parsed PT model containing 291 places and 332 transitions and 734 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-02b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 265 transition count 306
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 265 transition count 306
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 255 transition count 296
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 255 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 254 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 254 transition count 295
Applied a total of 74 rules in 57 ms. Remains 254 /291 variables (removed 37) and now considering 295/332 (removed 37) transitions.
// Phase 1: matrix 295 rows 254 cols
[2024-05-31 03:06:41] [INFO ] Computed 3 invariants in 21 ms
[2024-05-31 03:06:42] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-31 03:06:42] [INFO ] Invariant cache hit.
[2024-05-31 03:06:42] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-31 03:06:42] [INFO ] Invariant cache hit.
[2024-05-31 03:06:42] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 254/291 places, 295/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 254/291 places, 295/332 transitions.
Support contains 45 out of 254 places after structural reductions.
[2024-05-31 03:06:42] [INFO ] Flatten gal took : 40 ms
[2024-05-31 03:06:42] [INFO ] Flatten gal took : 21 ms
[2024-05-31 03:06:42] [INFO ] Input system was already deterministic with 295 transitions.
Support contains 44 out of 254 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 25) seen :19
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :3
Running SMT prover for 3 properties.
[2024-05-31 03:06:43] [INFO ] Invariant cache hit.
[2024-05-31 03:06:43] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 03:06:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 03:06:43] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-31 03:06:43] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-31 03:06:43] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 6 ms.
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 255 edges and 254 vertex of which 39 / 254 are part of one of the 6 SCC in 5 ms
Free SCC test removed 33 places
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 315 edges and 221 vertex of which 219 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 219 transition count 93
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 62 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 324 place count 60 transition count 89
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 324 place count 60 transition count 80
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 342 place count 51 transition count 80
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 347 place count 46 transition count 75
Iterating global reduction 3 with 5 rules applied. Total rules applied 352 place count 46 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 352 place count 46 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 356 place count 44 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 357 place count 43 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 358 place count 43 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 359 place count 43 transition count 68
Performed 11 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 381 place count 32 transition count 54
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 382 place count 32 transition count 53
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 388 place count 26 transition count 41
Iterating global reduction 5 with 6 rules applied. Total rules applied 394 place count 26 transition count 41
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 398 place count 26 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 400 place count 25 transition count 37
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 403 place count 25 transition count 34
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 414 place count 25 transition count 23
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 428 place count 14 transition count 20
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 430 place count 12 transition count 18
Iterating global reduction 7 with 2 rules applied. Total rules applied 432 place count 12 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 433 place count 12 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 434 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 435 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 436 place count 10 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 436 place count 10 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 440 place count 8 transition count 13
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 445 place count 5 transition count 10
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 449 place count 5 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 451 place count 5 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 453 place count 3 transition count 4
Applied a total of 453 rules in 37 ms. Remains 3 /254 variables (removed 251) and now considering 4/295 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 3/254 places, 4/295 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA StigmergyElection-PT-02b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 37 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)||p0))&&(G(p2) U G(p3))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 241 transition count 282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 241 transition count 282
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 232 transition count 273
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 229 transition count 270
Applied a total of 50 rules in 24 ms. Remains 229 /254 variables (removed 25) and now considering 270/295 (removed 25) transitions.
// Phase 1: matrix 270 rows 229 cols
[2024-05-31 03:06:44] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 03:06:44] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 03:06:44] [INFO ] Invariant cache hit.
[2024-05-31 03:06:44] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-31 03:06:44] [INFO ] Invariant cache hit.
[2024-05-31 03:06:44] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/254 places, 270/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 331 ms. Remains : 229/254 places, 270/295 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND p3 (NOT p2)), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p3 p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p3 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(OR (EQ s170 0) (EQ s131 1)), p2:(OR (EQ s95 0) (EQ s87 1)), p0:(OR (EQ s170 0) (EQ s131 1)), p1:(AND (EQ s131 0) (EQ s170 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 230 ms.
Product exploration explored 100000 steps with 77 reset in 158 ms.
Computed a total of 31 stabilizing places and 33 stable transitions
Computed a total of 31 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p3 p2 p0 (NOT p1)), (X p3), (X (NOT (AND p3 (NOT p2)))), (X (AND p3 p2)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p3)), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 125 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p3), true, (AND (NOT p2) p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 125 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 03:06:45] [INFO ] Invariant cache hit.
[2024-05-31 03:06:45] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 03:06:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 03:06:46] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 03:06:46] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-31 03:06:46] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p3 p2 p0 (NOT p1)), (X p3), (X (NOT (AND p3 (NOT p2)))), (X (AND p3 p2)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p3)), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND (NOT p2) p3)), (F (NOT (AND p2 p3))), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p2) (NOT p3)))
Knowledge based reduction with 14 factoid took 224 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02b-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLCardinality-02 finished in 2067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(F(p1)))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 253 edges and 254 vertex of which 34 / 254 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 155 place count 225 transition count 110
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 158 rules applied. Total rules applied 313 place count 71 transition count 106
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 316 place count 69 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 68 transition count 105
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 317 place count 68 transition count 99
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 329 place count 62 transition count 99
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 336 place count 55 transition count 92
Iterating global reduction 4 with 7 rules applied. Total rules applied 343 place count 55 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 343 place count 55 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 347 place count 53 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 349 place count 51 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 351 place count 51 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 352 place count 51 transition count 84
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 374 place count 40 transition count 73
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 380 place count 34 transition count 60
Iterating global reduction 5 with 6 rules applied. Total rules applied 386 place count 34 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 390 place count 34 transition count 56
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 391 place count 33 transition count 54
Iterating global reduction 6 with 1 rules applied. Total rules applied 392 place count 33 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 398 place count 30 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 401 place count 30 transition count 52
Applied a total of 401 rules in 31 ms. Remains 30 /254 variables (removed 224) and now considering 52/295 (removed 243) transitions.
[2024-05-31 03:06:46] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
// Phase 1: matrix 48 rows 30 cols
[2024-05-31 03:06:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 03:06:46] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 03:06:46] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
[2024-05-31 03:06:46] [INFO ] Invariant cache hit.
[2024-05-31 03:06:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 03:06:46] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-31 03:06:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 03:06:46] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
[2024-05-31 03:06:46] [INFO ] Invariant cache hit.
[2024-05-31 03:06:46] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/254 places, 52/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 30/254 places, 52/295 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s11 1), p1:(AND (EQ s22 0) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-03 finished in 254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(!p1)&&(G(p1)||X(X(F(!p0)))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 242 transition count 283
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 242 transition count 283
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 235 transition count 276
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 235 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 233 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 233 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 232 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 232 transition count 273
Applied a total of 44 rules in 17 ms. Remains 232 /254 variables (removed 22) and now considering 273/295 (removed 22) transitions.
// Phase 1: matrix 273 rows 232 cols
[2024-05-31 03:06:46] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 03:06:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 03:06:46] [INFO ] Invariant cache hit.
[2024-05-31 03:06:46] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-31 03:06:46] [INFO ] Invariant cache hit.
[2024-05-31 03:06:46] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/254 places, 273/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 232/254 places, 273/295 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR p1 p0), true, p1, p0, p1, p0]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s231 0) (EQ s39 1)), p0:(OR (EQ s32 0) (EQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-04 finished in 569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(F(p1)))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 241 transition count 282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 241 transition count 282
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 233 transition count 274
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 230 transition count 271
Applied a total of 48 rules in 18 ms. Remains 230 /254 variables (removed 24) and now considering 271/295 (removed 24) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-05-31 03:06:47] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 03:06:47] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 03:06:47] [INFO ] Invariant cache hit.
[2024-05-31 03:06:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-31 03:06:47] [INFO ] Invariant cache hit.
[2024-05-31 03:06:47] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/254 places, 271/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 230/254 places, 271/295 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s201 0) (EQ s229 1)), p1:(OR (EQ s157 0) (EQ s205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 281 ms.
Product exploration explored 100000 steps with 33333 reset in 206 ms.
Computed a total of 32 stabilizing places and 34 stable transitions
Computed a total of 32 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLCardinality-05 finished in 1053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 241 transition count 282
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 241 transition count 282
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 233 transition count 274
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 230 transition count 271
Applied a total of 48 rules in 12 ms. Remains 230 /254 variables (removed 24) and now considering 271/295 (removed 24) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-05-31 03:06:48] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 03:06:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 03:06:48] [INFO ] Invariant cache hit.
[2024-05-31 03:06:48] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-31 03:06:48] [INFO ] Invariant cache hit.
[2024-05-31 03:06:48] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/254 places, 271/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 230/254 places, 271/295 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s126 0) (EQ s14 1)), p1:(OR (EQ s56 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-02b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-02b-LTLCardinality-07 finished in 839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X(F(p0)))||(p1&&F(p2)))))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 242 transition count 283
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 242 transition count 283
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 234 transition count 275
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 234 transition count 275
Applied a total of 40 rules in 12 ms. Remains 234 /254 variables (removed 20) and now considering 275/295 (removed 20) transitions.
// Phase 1: matrix 275 rows 234 cols
[2024-05-31 03:06:49] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 03:06:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 03:06:49] [INFO ] Invariant cache hit.
[2024-05-31 03:06:49] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-31 03:06:49] [INFO ] Invariant cache hit.
[2024-05-31 03:06:49] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/254 places, 275/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 234/254 places, 275/295 transitions.
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(NOT p1), acceptance={} source=6 dest: 2}]], initial=3, aps=[p2:(AND (EQ s191 0) (EQ s120 1)), p0:(AND (EQ s199 0) (EQ s112 1)), p1:(EQ s23 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-08 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U p1)))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 240 transition count 281
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 240 transition count 281
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 231 transition count 272
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 228 transition count 269
Applied a total of 52 rules in 21 ms. Remains 228 /254 variables (removed 26) and now considering 269/295 (removed 26) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-31 03:06:49] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 03:06:50] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 03:06:50] [INFO ] Invariant cache hit.
[2024-05-31 03:06:50] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-31 03:06:50] [INFO ] Invariant cache hit.
[2024-05-31 03:06:50] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/254 places, 269/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 228/254 places, 269/295 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s219 0) (EQ s61 1)), p0:(OR (EQ s83 0) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 70 reset in 71 ms.
Product exploration explored 100000 steps with 195 reset in 69 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 100 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 03:06:50] [INFO ] Invariant cache hit.
[2024-05-31 03:06:50] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:06:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 03:06:50] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:06:50] [INFO ] Deduced a trap composed of 164 places in 74 ms of which 2 ms to minimize.
[2024-05-31 03:06:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-31 03:06:50] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-31 03:06:51] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 269/269 transitions.
Graph (trivial) has 228 edges and 228 vertex of which 27 / 228 are part of one of the 5 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 302 edges and 206 vertex of which 204 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 142 rules applied. Total rules applied 144 place count 204 transition count 97
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 144 rules applied. Total rules applied 288 place count 64 transition count 93
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 291 place count 62 transition count 92
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 294 place count 61 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 295 place count 60 transition count 90
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 295 place count 60 transition count 77
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 321 place count 47 transition count 77
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 322 place count 47 transition count 76
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 342 place count 37 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 345 place count 37 transition count 63
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 352 place count 30 transition count 47
Iterating global reduction 7 with 7 rules applied. Total rules applied 359 place count 30 transition count 47
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 364 place count 30 transition count 42
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 365 place count 29 transition count 41
Iterating global reduction 8 with 1 rules applied. Total rules applied 366 place count 29 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 372 place count 26 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 374 place count 25 transition count 38
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 377 place count 25 transition count 35
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 388 place count 25 transition count 24
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 402 place count 14 transition count 21
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 404 place count 12 transition count 19
Iterating global reduction 9 with 2 rules applied. Total rules applied 406 place count 12 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 407 place count 12 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 408 place count 12 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 409 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 410 place count 10 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 410 place count 10 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 412 place count 9 transition count 15
Performed 3 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 7 rules applied. Total rules applied 419 place count 5 transition count 11
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 5 rules applied. Total rules applied 424 place count 4 transition count 7
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 426 place count 4 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 427 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 428 place count 3 transition count 4
Applied a total of 428 rules in 25 ms. Remains 3 /228 variables (removed 225) and now considering 4/269 (removed 265) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 3/228 places, 4/269 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 168 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Applied a total of 0 rules in 3 ms. Remains 228 /228 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2024-05-31 03:06:51] [INFO ] Invariant cache hit.
[2024-05-31 03:06:51] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 03:06:51] [INFO ] Invariant cache hit.
[2024-05-31 03:06:51] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-31 03:06:51] [INFO ] Invariant cache hit.
[2024-05-31 03:06:51] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 228/228 places, 269/269 transitions.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 599 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 140 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 03:06:52] [INFO ] Invariant cache hit.
[2024-05-31 03:06:52] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 03:06:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 03:06:52] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 03:06:52] [INFO ] Deduced a trap composed of 164 places in 65 ms of which 1 ms to minimize.
[2024-05-31 03:06:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-31 03:06:52] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-31 03:06:52] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 269/269 transitions.
Graph (trivial) has 228 edges and 228 vertex of which 27 / 228 are part of one of the 5 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 302 edges and 206 vertex of which 204 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 142 rules applied. Total rules applied 144 place count 204 transition count 97
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 144 rules applied. Total rules applied 288 place count 64 transition count 93
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 291 place count 62 transition count 92
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 294 place count 61 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 295 place count 60 transition count 90
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 295 place count 60 transition count 77
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 321 place count 47 transition count 77
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 322 place count 47 transition count 76
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 342 place count 37 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 345 place count 37 transition count 63
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 352 place count 30 transition count 47
Iterating global reduction 7 with 7 rules applied. Total rules applied 359 place count 30 transition count 47
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 364 place count 30 transition count 42
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 365 place count 29 transition count 41
Iterating global reduction 8 with 1 rules applied. Total rules applied 366 place count 29 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 372 place count 26 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 374 place count 25 transition count 38
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 377 place count 25 transition count 35
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 388 place count 25 transition count 24
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 402 place count 14 transition count 21
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 404 place count 12 transition count 19
Iterating global reduction 9 with 2 rules applied. Total rules applied 406 place count 12 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 407 place count 12 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 408 place count 12 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 409 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 410 place count 10 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 410 place count 10 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 412 place count 9 transition count 15
Performed 3 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 7 rules applied. Total rules applied 419 place count 5 transition count 11
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 5 rules applied. Total rules applied 424 place count 4 transition count 7
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 426 place count 4 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 427 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 428 place count 3 transition count 4
Applied a total of 428 rules in 18 ms. Remains 3 /228 variables (removed 225) and now considering 4/269 (removed 265) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 3/228 places, 4/269 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 336 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 689 reset in 77 ms.
Product exploration explored 100000 steps with 51 reset in 71 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Graph (trivial) has 224 edges and 228 vertex of which 27 / 228 are part of one of the 5 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 134 rules applied. Total rules applied 135 place count 206 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 138 place count 206 transition count 241
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 138 place count 206 transition count 243
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 143 place count 206 transition count 243
Discarding 109 places :
Symmetric choice reduction at 2 with 109 rule applications. Total rules 252 place count 97 transition count 134
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 109 rules applied. Total rules applied 361 place count 97 transition count 134
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 379 place count 97 transition count 134
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 403 place count 73 transition count 100
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 427 place count 73 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 431 place count 73 transition count 96
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 438 place count 66 transition count 88
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 445 place count 66 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 446 place count 65 transition count 87
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 447 place count 65 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 448 place count 65 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 449 place count 64 transition count 86
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 450 place count 64 transition count 86
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 456 place count 64 transition count 103
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 461 place count 59 transition count 93
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 466 place count 59 transition count 93
Deduced a syphon composed of 27 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 474 place count 59 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 475 place count 58 transition count 84
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 476 place count 58 transition count 84
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 476 rules in 38 ms. Remains 58 /228 variables (removed 170) and now considering 84/269 (removed 185) transitions.
[2024-05-31 03:06:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 03:06:53] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 58 cols
[2024-05-31 03:06:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 03:06:53] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/228 places, 84/269 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 58/228 places, 84/269 transitions.
Built C files in :
/tmp/ltsmin2343467592814620831
[2024-05-31 03:06:53] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2343467592814620831
Running compilation step : cd /tmp/ltsmin2343467592814620831;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 630 ms.
Running link step : cd /tmp/ltsmin2343467592814620831;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2343467592814620831;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12401143081180213704.hoa' '--buchi-type=spotba'
LTSmin run took 194 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-02b-LTLCardinality-09 finished in 4794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 250 edges and 254 vertex of which 39 / 254 are part of one of the 6 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 148 place count 220 transition count 110
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 151 rules applied. Total rules applied 299 place count 73 transition count 106
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 302 place count 71 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 70 transition count 105
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 303 place count 70 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 317 place count 63 transition count 98
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 322 place count 58 transition count 93
Iterating global reduction 4 with 5 rules applied. Total rules applied 327 place count 58 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 327 place count 58 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 329 place count 57 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 330 place count 56 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 56 transition count 88
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 355 place count 44 transition count 76
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 360 place count 39 transition count 65
Iterating global reduction 4 with 5 rules applied. Total rules applied 365 place count 39 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 367 place count 39 transition count 63
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 368 place count 38 transition count 61
Iterating global reduction 5 with 1 rules applied. Total rules applied 369 place count 38 transition count 61
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 375 place count 35 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 377 place count 35 transition count 60
Applied a total of 377 rules in 16 ms. Remains 35 /254 variables (removed 219) and now considering 60/295 (removed 235) transitions.
[2024-05-31 03:06:54] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
// Phase 1: matrix 56 rows 35 cols
[2024-05-31 03:06:54] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 03:06:54] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 03:06:54] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-31 03:06:54] [INFO ] Invariant cache hit.
[2024-05-31 03:06:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 03:06:54] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-31 03:06:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 03:06:54] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
[2024-05-31 03:06:54] [INFO ] Invariant cache hit.
[2024-05-31 03:06:54] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/254 places, 60/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 35/254 places, 60/295 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s13 1) (AND (NEQ s25 0) (NEQ s33 1)) (AND (NEQ s4 0) (NEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 576 steps with 86 reset in 5 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-10 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(!p1 U (p2||G(!p1))))))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 240 transition count 281
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 240 transition count 281
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 231 transition count 272
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 228 transition count 269
Applied a total of 52 rules in 17 ms. Remains 228 /254 variables (removed 26) and now considering 269/295 (removed 26) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-31 03:06:54] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 03:06:55] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 03:06:55] [INFO ] Invariant cache hit.
[2024-05-31 03:06:55] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-31 03:06:55] [INFO ] Invariant cache hit.
[2024-05-31 03:06:55] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/254 places, 269/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 228/254 places, 269/295 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s79 0) (EQ s172 1)), p2:(AND (NEQ s93 1) (NOT (OR (EQ s174 0) (EQ s36 1)))), p1:(OR (EQ s174 0) (EQ s36 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 351 reset in 153 ms.
Product exploration explored 100000 steps with 63 reset in 141 ms.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 03:06:56] [INFO ] Invariant cache hit.
[2024-05-31 03:06:56] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 03:06:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 03:06:56] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-31 03:06:56] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-31 03:06:56] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 6 factoid took 233 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Applied a total of 0 rules in 4 ms. Remains 228 /228 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2024-05-31 03:06:56] [INFO ] Invariant cache hit.
[2024-05-31 03:06:56] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 03:06:56] [INFO ] Invariant cache hit.
[2024-05-31 03:06:56] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-31 03:06:56] [INFO ] Invariant cache hit.
[2024-05-31 03:06:57] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 228/228 places, 269/269 transitions.
Computed a total of 30 stabilizing places and 32 stable transitions
Computed a total of 30 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 137 steps, including 2 resets, run visited all 2 properties in 4 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 77 reset in 84 ms.
Product exploration explored 100000 steps with 52 reset in 176 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Graph (trivial) has 225 edges and 228 vertex of which 34 / 228 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 200 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 134 place count 200 transition count 235
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 134 place count 200 transition count 237
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 200 transition count 237
Discarding 109 places :
Symmetric choice reduction at 2 with 109 rule applications. Total rules 247 place count 91 transition count 128
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 109 rules applied. Total rules applied 356 place count 91 transition count 128
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 373 place count 91 transition count 128
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 396 place count 68 transition count 95
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 419 place count 68 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 421 place count 68 transition count 93
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 429 place count 60 transition count 83
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 437 place count 60 transition count 83
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 439 place count 58 transition count 81
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 441 place count 58 transition count 81
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 447 place count 58 transition count 98
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 453 place count 52 transition count 86
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 459 place count 52 transition count 86
Deduced a syphon composed of 23 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 465 place count 52 transition count 80
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 465 rules in 17 ms. Remains 52 /228 variables (removed 176) and now considering 80/269 (removed 189) transitions.
[2024-05-31 03:06:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 03:06:58] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 52 cols
[2024-05-31 03:06:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 03:06:58] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/228 places, 80/269 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 52/228 places, 80/269 transitions.
Built C files in :
/tmp/ltsmin3287978112180572319
[2024-05-31 03:06:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3287978112180572319
Running compilation step : cd /tmp/ltsmin3287978112180572319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 359 ms.
Running link step : cd /tmp/ltsmin3287978112180572319;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3287978112180572319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6514414042890527143.hoa' '--buchi-type=spotba'
LTSmin run took 128 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-02b-LTLCardinality-13 finished in 3857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Graph (trivial) has 257 edges and 254 vertex of which 39 / 254 are part of one of the 6 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 154 place count 220 transition count 104
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 157 rules applied. Total rules applied 311 place count 67 transition count 100
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 314 place count 65 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 64 transition count 99
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 315 place count 64 transition count 93
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 327 place count 58 transition count 93
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 334 place count 51 transition count 86
Iterating global reduction 4 with 7 rules applied. Total rules applied 341 place count 51 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 341 place count 51 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 345 place count 49 transition count 84
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 347 place count 47 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 349 place count 47 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 350 place count 47 transition count 78
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 372 place count 36 transition count 67
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 379 place count 29 transition count 52
Iterating global reduction 5 with 7 rules applied. Total rules applied 386 place count 29 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 390 place count 29 transition count 48
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 391 place count 28 transition count 46
Iterating global reduction 6 with 1 rules applied. Total rules applied 392 place count 28 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 398 place count 25 transition count 47
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 401 place count 25 transition count 44
Applied a total of 401 rules in 15 ms. Remains 25 /254 variables (removed 229) and now considering 44/295 (removed 251) transitions.
[2024-05-31 03:06:58] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 25 cols
[2024-05-31 03:06:58] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 03:06:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-31 03:06:58] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-31 03:06:58] [INFO ] Invariant cache hit.
[2024-05-31 03:06:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 03:06:58] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-31 03:06:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 03:06:58] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-31 03:06:58] [INFO ] Invariant cache hit.
[2024-05-31 03:06:58] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/254 places, 44/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 25/254 places, 44/295 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18 reset in 37 ms.
Product exploration explored 100000 steps with 20 reset in 37 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 44/44 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-05-31 03:06:59] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-31 03:06:59] [INFO ] Invariant cache hit.
[2024-05-31 03:06:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 03:06:59] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-31 03:06:59] [INFO ] Invariant cache hit.
[2024-05-31 03:06:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 03:06:59] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-31 03:06:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 03:06:59] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-31 03:06:59] [INFO ] Invariant cache hit.
[2024-05-31 03:06:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 25/25 places, 44/44 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 38 ms.
Product exploration explored 100000 steps with 85 reset in 37 ms.
Built C files in :
/tmp/ltsmin15653669197695181324
[2024-05-31 03:07:00] [INFO ] Computing symmetric may disable matrix : 44 transitions.
[2024-05-31 03:07:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:07:00] [INFO ] Computing symmetric may enable matrix : 44 transitions.
[2024-05-31 03:07:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:07:00] [INFO ] Computing Do-Not-Accords matrix : 44 transitions.
[2024-05-31 03:07:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 03:07:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15653669197695181324
Running compilation step : cd /tmp/ltsmin15653669197695181324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 119 ms.
Running link step : cd /tmp/ltsmin15653669197695181324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15653669197695181324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18436192039806516492.hoa' '--buchi-type=spotba'
LTSmin run took 57 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-02b-LTLCardinality-14 finished in 1976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 295/295 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 243 transition count 284
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 243 transition count 284
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 236 transition count 277
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 236 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 235 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 235 transition count 276
Applied a total of 38 rules in 13 ms. Remains 235 /254 variables (removed 19) and now considering 276/295 (removed 19) transitions.
// Phase 1: matrix 276 rows 235 cols
[2024-05-31 03:07:00] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 03:07:00] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 03:07:00] [INFO ] Invariant cache hit.
[2024-05-31 03:07:00] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-31 03:07:00] [INFO ] Invariant cache hit.
[2024-05-31 03:07:01] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/254 places, 276/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 235/254 places, 276/295 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-02b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s117 1), p0:(OR (EQ s192 0) (EQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-02b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-02b-LTLCardinality-15 finished in 450 ms.
All properties solved by simple procedures.
Total runtime 19901 ms.

BK_STOP 1717124822094

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-02b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is StigmergyElection-PT-02b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690555900162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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