fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r417-tall-171690556000192
Last Updated
July 7, 2024

About the Execution of 2023-gold for StigmergyElection-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
829.247 46155.00 67293.00 2046.40 FTTTTFFFTFTFTFTF normal

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-171690556000192.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-05b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556000192
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 18:44 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 428K 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-05b-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-05b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717125750729

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-05b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 03:22:32] [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:22:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:22:32] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-31 03:22:32] [INFO ] Transformed 699 places.
[2024-05-31 03:22:32] [INFO ] Transformed 1266 transitions.
[2024-05-31 03:22:32] [INFO ] Found NUPN structural information;
[2024-05-31 03:22:32] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 194 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 4 formulas.
FORMULA StigmergyElection-PT-05b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 618 transition count 1185
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 618 transition count 1185
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 202 place count 578 transition count 1145
Iterating global reduction 0 with 40 rules applied. Total rules applied 242 place count 578 transition count 1145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 247 place count 573 transition count 1140
Iterating global reduction 0 with 5 rules applied. Total rules applied 252 place count 573 transition count 1140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 254 place count 571 transition count 1138
Iterating global reduction 0 with 2 rules applied. Total rules applied 256 place count 571 transition count 1138
Applied a total of 256 rules in 195 ms. Remains 571 /699 variables (removed 128) and now considering 1138/1266 (removed 128) transitions.
// Phase 1: matrix 1138 rows 571 cols
[2024-05-31 03:22:32] [INFO ] Computed 6 invariants in 33 ms
[2024-05-31 03:22:33] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-31 03:22:33] [INFO ] Invariant cache hit.
[2024-05-31 03:22:33] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2024-05-31 03:22:33] [INFO ] Invariant cache hit.
[2024-05-31 03:22:34] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 571/699 places, 1138/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1673 ms. Remains : 571/699 places, 1138/1266 transitions.
Support contains 27 out of 571 places after structural reductions.
[2024-05-31 03:22:34] [INFO ] Flatten gal took : 129 ms
[2024-05-31 03:22:34] [INFO ] Flatten gal took : 81 ms
[2024-05-31 03:22:34] [INFO ] Input system was already deterministic with 1138 transitions.
Support contains 25 out of 571 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-31 03:22:35] [INFO ] Invariant cache hit.
[2024-05-31 03:22:36] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-31 03:22:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 03:22:37] [INFO ] After 646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-31 03:22:37] [INFO ] Deduced a trap composed of 168 places in 303 ms of which 4 ms to minimize.
[2024-05-31 03:22:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2024-05-31 03:22:37] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 1 ms to minimize.
[2024-05-31 03:22:38] [INFO ] Deduced a trap composed of 169 places in 246 ms of which 1 ms to minimize.
[2024-05-31 03:22:38] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 2 ms to minimize.
[2024-05-31 03:22:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 840 ms
[2024-05-31 03:22:39] [INFO ] Deduced a trap composed of 168 places in 291 ms of which 9 ms to minimize.
[2024-05-31 03:22:39] [INFO ] Deduced a trap composed of 167 places in 244 ms of which 1 ms to minimize.
[2024-05-31 03:22:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 646 ms
[2024-05-31 03:22:39] [INFO ] Deduced a trap composed of 170 places in 244 ms of which 0 ms to minimize.
[2024-05-31 03:22:40] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 1 ms to minimize.
[2024-05-31 03:22:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 578 ms
[2024-05-31 03:22:40] [INFO ] After 3637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 355 ms.
[2024-05-31 03:22:40] [INFO ] After 4266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 16 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Graph (trivial) has 556 edges and 571 vertex of which 75 / 571 are part of one of the 13 SCC in 4 ms
Free SCC test removed 62 places
Drop transitions removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Graph (complete) has 1075 edges and 509 vertex of which 505 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 341 rules applied. Total rules applied 343 place count 505 transition count 714
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 350 rules applied. Total rules applied 693 place count 168 transition count 701
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 11 rules applied. Total rules applied 704 place count 161 transition count 697
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 708 place count 157 transition count 697
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 708 place count 157 transition count 674
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 754 place count 134 transition count 674
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 757 place count 131 transition count 670
Iterating global reduction 4 with 3 rules applied. Total rules applied 760 place count 131 transition count 670
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 761 place count 131 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 762 place count 130 transition count 669
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 762 place count 130 transition count 668
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 764 place count 129 transition count 668
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 765 place count 128 transition count 666
Iterating global reduction 6 with 1 rules applied. Total rules applied 766 place count 128 transition count 666
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 808 place count 107 transition count 645
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 813 place count 107 transition count 640
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 826 place count 94 transition count 222
Iterating global reduction 7 with 13 rules applied. Total rules applied 839 place count 94 transition count 222
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 848 place count 94 transition count 213
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 864 place count 86 transition count 205
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 874 place count 81 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 875 place count 81 transition count 212
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 884 place count 81 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 886 place count 80 transition count 209
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 894 place count 80 transition count 201
Free-agglomeration rule applied 27 times.
Iterating global reduction 9 with 27 rules applied. Total rules applied 921 place count 80 transition count 174
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 28 rules applied. Total rules applied 949 place count 53 transition count 173
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 953 place count 49 transition count 169
Iterating global reduction 10 with 4 rules applied. Total rules applied 957 place count 49 transition count 169
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 960 place count 49 transition count 166
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 963 place count 49 transition count 166
Applied a total of 963 rules in 190 ms. Remains 49 /571 variables (removed 522) and now considering 166/1138 (removed 972) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 49/571 places, 166/1138 transitions.
Finished random walk after 6689 steps, including 2 resets, run visited all 11 properties in 56 ms. (steps per millisecond=119 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 75 stabilizing places and 80 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' '!(X(X(F((F(p0)&&G(p1))))))'
Support contains 3 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 559 transition count 1126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 559 transition count 1126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 553 transition count 1120
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 551 transition count 1118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 549 transition count 1116
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 549 transition count 1116
Applied a total of 44 rules in 56 ms. Remains 549 /571 variables (removed 22) and now considering 1116/1138 (removed 22) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-31 03:22:41] [INFO ] Computed 6 invariants in 15 ms
[2024-05-31 03:22:41] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-31 03:22:41] [INFO ] Invariant cache hit.
[2024-05-31 03:22:41] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-31 03:22:41] [INFO ] Invariant cache hit.
[2024-05-31 03:22:42] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/571 places, 1116/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1085 ms. Remains : 549/571 places, 1116/1138 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 323 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s256 0), p0:(AND (EQ s351 0) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 161 steps with 1 reset in 3 ms.
FORMULA StigmergyElection-PT-05b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLCardinality-00 finished in 1461 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(p0)||(p1&&G(p2))))||F(p3)))'
Support contains 6 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 562 transition count 1129
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 562 transition count 1129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 558 transition count 1125
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 558 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 557 transition count 1124
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 557 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 556 transition count 1123
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 556 transition count 1123
Applied a total of 30 rules in 86 ms. Remains 556 /571 variables (removed 15) and now considering 1123/1138 (removed 15) transitions.
// Phase 1: matrix 1123 rows 556 cols
[2024-05-31 03:22:42] [INFO ] Computed 6 invariants in 9 ms
[2024-05-31 03:22:42] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-31 03:22:42] [INFO ] Invariant cache hit.
[2024-05-31 03:22:43] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2024-05-31 03:22:43] [INFO ] Invariant cache hit.
[2024-05-31 03:22:43] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 556/571 places, 1123/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1237 ms. Remains : 556/571 places, 1123/1138 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p3) (NOT p0)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(AND (EQ s490 0) (EQ s193 1)), p0:(OR (EQ s225 0) (EQ s439 1)), p1:(OR (EQ s193 0) (EQ s490 1)), p2:(AND (EQ s33 0) (EQ s357 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 446 ms.
Product exploration explored 100000 steps with 33333 reset in 411 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 p1 (NOT p2)), (X (NOT (AND (NOT p3) p1 p2))), (X (OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 26 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLCardinality-01 finished in 2427 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))'
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 560 transition count 1127
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 560 transition count 1127
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 555 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 555 transition count 1122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 553 transition count 1120
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 551 transition count 1118
Applied a total of 40 rules in 61 ms. Remains 551 /571 variables (removed 20) and now considering 1118/1138 (removed 20) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2024-05-31 03:22:45] [INFO ] Computed 6 invariants in 16 ms
[2024-05-31 03:22:45] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-31 03:22:45] [INFO ] Invariant cache hit.
[2024-05-31 03:22:45] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2024-05-31 03:22:45] [INFO ] Invariant cache hit.
[2024-05-31 03:22:46] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 551/571 places, 1118/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1183 ms. Remains : 551/571 places, 1118/1138 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s404 0) (EQ s451 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 485 ms.
Product exploration explored 100000 steps with 50000 reset in 480 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLCardinality-03 finished in 2300 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(X((X(p0)&&(X(G(p0))||p1))))))'
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 559 transition count 1126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 559 transition count 1126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 553 transition count 1120
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 551 transition count 1118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 549 transition count 1116
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 549 transition count 1116
Applied a total of 44 rules in 62 ms. Remains 549 /571 variables (removed 22) and now considering 1116/1138 (removed 22) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-31 03:22:47] [INFO ] Computed 6 invariants in 18 ms
[2024-05-31 03:22:47] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-31 03:22:47] [INFO ] Invariant cache hit.
[2024-05-31 03:22:47] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-05-31 03:22:47] [INFO ] Invariant cache hit.
[2024-05-31 03:22:48] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/571 places, 1116/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1120 ms. Remains : 549/571 places, 1116/1138 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(OR (EQ s297 0) (EQ s453 1)), p1:(OR (EQ s297 0) (EQ s453 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 254 ms.
Product exploration explored 100000 steps with 20000 reset in 264 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 704385 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 704385 steps, saw 120203 distinct states, run finished after 3004 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 03:22:52] [INFO ] Invariant cache hit.
[2024-05-31 03:22:52] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 03:22:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 03:22:53] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 03:22:53] [INFO ] Deduced a trap composed of 167 places in 266 ms of which 0 ms to minimize.
[2024-05-31 03:22:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2024-05-31 03:22:53] [INFO ] After 756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-31 03:22:53] [INFO ] After 915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 559 edges and 549 vertex of which 82 / 549 are part of one of the 14 SCC in 1 ms
Free SCC test removed 68 places
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 1044 edges and 481 vertex of which 477 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 340 rules applied. Total rules applied 342 place count 477 transition count 684
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 346 rules applied. Total rules applied 688 place count 141 transition count 674
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 695 place count 136 transition count 672
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 697 place count 134 transition count 672
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 697 place count 134 transition count 647
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 747 place count 109 transition count 647
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 748 place count 109 transition count 646
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 800 place count 83 transition count 620
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 810 place count 83 transition count 610
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 831 place count 62 transition count 168
Iterating global reduction 6 with 21 rules applied. Total rules applied 852 place count 62 transition count 168
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 863 place count 62 transition count 157
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 868 place count 57 transition count 152
Iterating global reduction 7 with 5 rules applied. Total rules applied 873 place count 57 transition count 152
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 883 place count 52 transition count 147
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 889 place count 49 transition count 155
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 897 place count 49 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 899 place count 48 transition count 153
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 907 place count 48 transition count 145
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 933 place count 48 transition count 119
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 976 place count 22 transition count 102
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 981 place count 17 transition count 97
Iterating global reduction 8 with 5 rules applied. Total rules applied 986 place count 17 transition count 97
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1001 place count 17 transition count 82
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 1017 place count 17 transition count 66
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1019 place count 17 transition count 66
Applied a total of 1019 rules in 63 ms. Remains 17 /549 variables (removed 532) and now considering 66/1116 (removed 1050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 17/549 places, 66/1116 transitions.
Finished random walk after 86 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 422 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 320 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 17 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-31 03:22:54] [INFO ] Invariant cache hit.
[2024-05-31 03:22:55] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-31 03:22:55] [INFO ] Invariant cache hit.
[2024-05-31 03:22:55] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-05-31 03:22:55] [INFO ] Invariant cache hit.
[2024-05-31 03:22:56] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1088 ms. Remains : 549/549 places, 1116/1116 transitions.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 110 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 670573 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 670573 steps, saw 114782 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 03:22:59] [INFO ] Invariant cache hit.
[2024-05-31 03:22:59] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 03:22:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 03:23:00] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 03:23:00] [INFO ] Deduced a trap composed of 167 places in 277 ms of which 0 ms to minimize.
[2024-05-31 03:23:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2024-05-31 03:23:00] [INFO ] After 790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-31 03:23:00] [INFO ] After 954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 559 edges and 549 vertex of which 82 / 549 are part of one of the 14 SCC in 1 ms
Free SCC test removed 68 places
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 1044 edges and 481 vertex of which 477 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 340 rules applied. Total rules applied 342 place count 477 transition count 684
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 346 rules applied. Total rules applied 688 place count 141 transition count 674
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 695 place count 136 transition count 672
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 697 place count 134 transition count 672
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 697 place count 134 transition count 647
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 747 place count 109 transition count 647
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 748 place count 109 transition count 646
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 800 place count 83 transition count 620
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 810 place count 83 transition count 610
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 831 place count 62 transition count 168
Iterating global reduction 6 with 21 rules applied. Total rules applied 852 place count 62 transition count 168
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 863 place count 62 transition count 157
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 868 place count 57 transition count 152
Iterating global reduction 7 with 5 rules applied. Total rules applied 873 place count 57 transition count 152
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 883 place count 52 transition count 147
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 889 place count 49 transition count 155
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 897 place count 49 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 899 place count 48 transition count 153
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 907 place count 48 transition count 145
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 933 place count 48 transition count 119
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 976 place count 22 transition count 102
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 981 place count 17 transition count 97
Iterating global reduction 8 with 5 rules applied. Total rules applied 986 place count 17 transition count 97
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1001 place count 17 transition count 82
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 1017 place count 17 transition count 66
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1019 place count 17 transition count 66
Applied a total of 1019 rules in 68 ms. Remains 17 /549 variables (removed 532) and now considering 66/1116 (removed 1050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 17/549 places, 66/1116 transitions.
Finished random walk after 67 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=67 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 256 ms.
Product exploration explored 100000 steps with 20000 reset in 260 ms.
Applying partial POR strategy [true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 559 edges and 549 vertex of which 82 / 549 are part of one of the 14 SCC in 2 ms
Free SCC test removed 68 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 328 rules applied. Total rules applied 329 place count 481 transition count 1038
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 334 place count 481 transition count 1033
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 334 place count 481 transition count 1038
Deduced a syphon composed of 338 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 344 place count 481 transition count 1038
Discarding 277 places :
Symmetric choice reduction at 2 with 277 rule applications. Total rules 621 place count 204 transition count 761
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 2 with 277 rules applied. Total rules applied 898 place count 204 transition count 761
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 939 place count 204 transition count 761
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 996 place count 147 transition count 278
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 1053 place count 147 transition count 278
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1064 place count 147 transition count 267
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1085 place count 126 transition count 241
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 1106 place count 126 transition count 241
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1111 place count 121 transition count 236
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 1116 place count 121 transition count 236
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1124 place count 121 transition count 276
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1137 place count 108 transition count 250
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 1150 place count 108 transition count 250
Deduced a syphon composed of 48 places in 0 ms
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 1164 place count 108 transition count 236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1165 place count 108 transition count 249
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1166 place count 107 transition count 247
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1167 place count 107 transition count 247
Deduced a syphon composed of 48 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 1171 place count 107 transition count 243
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 1171 rules in 110 ms. Remains 107 /549 variables (removed 442) and now considering 243/1116 (removed 873) transitions.
[2024-05-31 03:23:02] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-31 03:23:02] [INFO ] Flow matrix only has 237 transitions (discarded 6 similar events)
// Phase 1: matrix 237 rows 107 cols
[2024-05-31 03:23:02] [INFO ] Computed 3 invariants in 6 ms
[2024-05-31 03:23:02] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/549 places, 243/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 107/549 places, 243/1116 transitions.
Built C files in :
/tmp/ltsmin16645616164113220528
[2024-05-31 03:23:02] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16645616164113220528
Running compilation step : cd /tmp/ltsmin16645616164113220528;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16645616164113220528;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16645616164113220528;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 15 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-31 03:23:05] [INFO ] Computed 6 invariants in 11 ms
[2024-05-31 03:23:05] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-31 03:23:05] [INFO ] Invariant cache hit.
[2024-05-31 03:23:06] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-31 03:23:06] [INFO ] Invariant cache hit.
[2024-05-31 03:23:06] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1099 ms. Remains : 549/549 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin12060822751507748825
[2024-05-31 03:23:06] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12060822751507748825
Running compilation step : cd /tmp/ltsmin12060822751507748825;'/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 1924 ms.
Running link step : cd /tmp/ltsmin12060822751507748825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin12060822751507748825;'/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/stateBased12940872086517600004.hoa' '--buchi-type=spotba'
LTSmin run took 322 ms.
FORMULA StigmergyElection-PT-05b-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-05b-LTLCardinality-04 finished in 21864 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)&&F(G(p1)))))'
Support contains 5 out of 571 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Graph (trivial) has 577 edges and 571 vertex of which 80 / 571 are part of one of the 14 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 348 place count 504 transition count 715
Reduce places removed 347 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 358 rules applied. Total rules applied 706 place count 157 transition count 704
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 713 place count 151 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 714 place count 150 transition count 703
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 714 place count 150 transition count 685
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 750 place count 132 transition count 685
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 758 place count 124 transition count 676
Iterating global reduction 4 with 8 rules applied. Total rules applied 766 place count 124 transition count 676
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 766 place count 124 transition count 675
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 768 place count 123 transition count 675
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 769 place count 122 transition count 673
Iterating global reduction 4 with 1 rules applied. Total rules applied 770 place count 122 transition count 673
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 771 place count 121 transition count 671
Iterating global reduction 4 with 1 rules applied. Total rules applied 772 place count 121 transition count 671
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 812 place count 101 transition count 651
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 829 place count 84 transition count 234
Iterating global reduction 4 with 17 rules applied. Total rules applied 846 place count 84 transition count 234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 854 place count 84 transition count 226
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 857 place count 81 transition count 220
Iterating global reduction 5 with 3 rules applied. Total rules applied 860 place count 81 transition count 220
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 862 place count 79 transition count 216
Iterating global reduction 5 with 2 rules applied. Total rules applied 864 place count 79 transition count 216
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 888 place count 67 transition count 225
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 889 place count 66 transition count 210
Iterating global reduction 5 with 1 rules applied. Total rules applied 890 place count 66 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 891 place count 66 transition count 209
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 898 place count 66 transition count 202
Applied a total of 898 rules in 74 ms. Remains 66 /571 variables (removed 505) and now considering 202/1138 (removed 936) transitions.
[2024-05-31 03:23:09] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
// Phase 1: matrix 196 rows 66 cols
[2024-05-31 03:23:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 03:23:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 03:23:09] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
[2024-05-31 03:23:09] [INFO ] Invariant cache hit.
[2024-05-31 03:23:09] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 03:23:09] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-31 03:23:09] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 03:23:09] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
[2024-05-31 03:23:09] [INFO ] Invariant cache hit.
[2024-05-31 03:23:09] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/571 places, 202/1138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 66/571 places, 202/1138 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s3 0) (EQ s59 1)) (OR (EQ s45 0) (EQ s16 1))), p1:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLCardinality-07 finished in 449 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(!p0)||p1))))'
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 561 transition count 1128
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 561 transition count 1128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 557 transition count 1124
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 557 transition count 1124
Applied a total of 28 rules in 34 ms. Remains 557 /571 variables (removed 14) and now considering 1124/1138 (removed 14) transitions.
// Phase 1: matrix 1124 rows 557 cols
[2024-05-31 03:23:09] [INFO ] Computed 6 invariants in 14 ms
[2024-05-31 03:23:09] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-31 03:23:09] [INFO ] Invariant cache hit.
[2024-05-31 03:23:10] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2024-05-31 03:23:10] [INFO ] Invariant cache hit.
[2024-05-31 03:23:10] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 557/571 places, 1124/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1128 ms. Remains : 557/571 places, 1124/1138 transitions.
Stuttering acceptance computed with spot in 322 ms :[p0, p0]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s263 0) (EQ s192 1)), p1:(OR (EQ s263 0) (EQ s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLCardinality-09 finished in 1474 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(G((X(p0)&&((!p1&&X(p1))||X(G(p1)))))))'
Support contains 3 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 561 transition count 1128
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 561 transition count 1128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 555 transition count 1122
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 555 transition count 1122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 553 transition count 1120
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 551 transition count 1118
Applied a total of 40 rules in 58 ms. Remains 551 /571 variables (removed 20) and now considering 1118/1138 (removed 20) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2024-05-31 03:23:11] [INFO ] Computed 6 invariants in 9 ms
[2024-05-31 03:23:11] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-31 03:23:11] [INFO ] Invariant cache hit.
[2024-05-31 03:23:11] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-05-31 03:23:11] [INFO ] Invariant cache hit.
[2024-05-31 03:23:12] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 551/571 places, 1118/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1139 ms. Remains : 551/571 places, 1118/1138 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s296 0) (EQ s55 1)), p0:(EQ s114 0)], 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 485 steps with 5 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLCardinality-11 finished in 1284 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(G(p0)))'
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 1138/1138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 559 transition count 1126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 559 transition count 1126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 553 transition count 1120
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 551 transition count 1118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 549 transition count 1116
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 549 transition count 1116
Applied a total of 44 rules in 60 ms. Remains 549 /571 variables (removed 22) and now considering 1116/1138 (removed 22) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2024-05-31 03:23:12] [INFO ] Computed 6 invariants in 19 ms
[2024-05-31 03:23:12] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-31 03:23:12] [INFO ] Invariant cache hit.
[2024-05-31 03:23:13] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-05-31 03:23:13] [INFO ] Invariant cache hit.
[2024-05-31 03:23:13] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/571 places, 1116/1138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1125 ms. Remains : 549/571 places, 1116/1138 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s356 0) (EQ s419 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 783 steps with 8 reset in 5 ms.
FORMULA StigmergyElection-PT-05b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLCardinality-13 finished in 1249 ms.
All properties solved by simple procedures.
Total runtime 41362 ms.

BK_STOP 1717125796884

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-05b"
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-05b, 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-171690556000192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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